Maze navigation

This simulation was developed by Brian Cipriano. A walker is inside a maze, starting at an initial location. It walks around trying to find an exit point. Whenever it gets to a point where it can make a decision, it stops to see if it  has been here before. If it has, it makes sure to take a path different than it did before, choosing randomly from the other options. If it hasn't been here before, it chooses randomly from all options.

This behavior could certainly improve, by applying a number of artificial intelligence techniques.

Here's a movie of a walker navigating a couple of mazes, in Breve.



This Breve code uses the following files:
Maze.tz
Walker.tz
tester2.tz (a sample use of the two above files)