A robot that tries to find the "door"—the break in the black rectangle. It does this first by trying to go in every direction, and removing the directions that don't work from of its list of directions. The second time, it just picks a direction randomly and goes there. For both times, it records how many tries it took to find the door.
I conjecture that if you ran this program tons and tons of times (we're talking thousands), on average it would take the robot less tries to find the door through the first method. Simple, yes, but I find it interesting.
