For technical reasons, this maze won't do anything when you click on it. If you return to this page from a different kind of computer (or turn on Java), you may be able to move the blue square by clicking.
In this maze, each of the large squares represents a two-dimensional slice of the maze. You are the blue square; you can move on white squares, but not red ones. You move by either clicking on a small square that is in the same large square and shares a side with your present square, or by clicking on a small square that is in the same position as your present square, on a large square that shares a side with your present large square. If you aren't sure if a move is legal, try it. If you're allowed to move on a square from your present square, the computer will let you; if you can't make that move, nothing bad will happen — you just won't move anywhere. The goal is to get to the light green square.
Want a much more challenging maze? This adaptation is provided courtesy of Guy Srinivasan.
For technical reasons, this maze won't do anything when you click on it. If you return to this page from a different kind of computer (or turn on Java), you may be able to move the blue square by clicking.
The maze is a hypercube; in the same sense that a diagram might represent a three dimensional structure by showing some two dimensional slices one above the other, this maze represents a four dimensional structure by a grid of two dimensional slices. For progammers who might be curious, the source code for the original, easier maze, the newer, harder maze and Javadoc documentation for both the original and harder mazes are provided.
In eighth grade, when I first wrote this, I was very interested in