Ed's challenge

New Sept 2003: Ed Pegg's challenge (see original Maze of Life page) was successfully solved in June 2003 by Berend Jan van der Zwaag who discovered the maximum score is indeed infinity. Here is his recipe: "First, do /RRL\\USS/SDSS<D\SSSS/D>SDU>\>\LSS. Then, as often as you like, visit goal and starting point and return to the exact same cell-arrangement following the looping string >>SL\SSRRLUSSSDSDRU<LS/<SSSSSSS/R\U/S><UDS/R>\RL<SDL<DSSS/\UD."

To explore the loop in action see the pre-loaded applet below. Use undo to step backwards through the loop, or hit undo-all and then redo to step forwards from the original start state, first to the loop entry state (illustrated) and then on round the loop back to the entry state. Note the blue cell visits both the original start and goal points (illustrated in red) enroute.

Sorry, this is a Java applet.

Loop entry state and original start/end
points (red). The loop visits both
red squares and returns to the entry state.

applet - © Andrea Gilbert 2000-2002
challenge provided by Ed Pegg (2000)
solution provided by Berend Jan van der Zwaag (2003)