The applet below simulates the behavior of three distributed coverage algorithms (Brick&Mortar, Depth First Search, Ants), which can be used to explore an unknown area by a number of mobile nodes. The area has a number of square cells that must be visited and a number of black cells that represent walls (or obstacles in general). To find out how to run the simulation, please read the instructions below the applet area.