created with NetLogo
view/download model file: tileworld.nlogo
This is the classic tileworld problem. There are empty holes and tiles.The agents must push the tiles so that they cover the empty holes. Agentscan push each other or more than one tile at once. The solution implementedhere is the obvious one. AFAIK, there is no consensus on what is thebest algorithm for solving this problem. The Tileworld was first introduced in