Deterministic ants in labirynth -- information gained by map sharing
  A few of ant robots are dropped to a labirynth, formed by a square lattice with a small number of nodes removed. Ants move according to a deterministic algorithm designed to explore all corridors. Each ant remembers the shape of corridors which she has visited. Once two ants met, they share the information acquired. We evaluate how the time of getting a complete information by an ant depends on the number of ants, and how the length known by an ant depends on time. Numerical results are presented in the form of scaling relations. 
Janusz Malinowski and Krzysztof Ku{\l}akowski
physics.data-an physics.soc-ph