Maze Algorithm

Given an ascii maze, a Robot will traverse through the maze until it
reaches the end. At each fork in the maze the Robot will randomly take
a turn. When a dead end is reached the Robot will return to the
previous fork in the in the maze. This algorithm is defaulted to run
the Robot 10 times through the maze and calculates from those runs the
shortest and longest paths.