We consider a model of a deterministic (Ma,Mw)-agent with Ma bits of internal memory and Mw bits at each node of some graph G that is able to visit vertices and traverse edges of G. The memory at each node is accesible only upon visiting to that node. The goal of the agent is to explore an anonymous and initially unknown G, i.e. visit all its n nodes.