Maze

For the R&B/soul music band, see Maze (band).

A small maze.

A maze is a tour puzzle in the form of a complex branching passage through which the solver must find a route. This is different from a labyrinth, which has an unambiguous through-route and is not designed to be difficult to navigate.

The pathways and walls in a maze or labyrinth are fixed. Maze-type puzzles where the given walls and paths may change during the game are covered under the main puzzle category of tour puzzles.

One type of maze consists of a set of rooms linked by doors (so a passageway is just another room in this definition). You enter at one spot, and exit at another, or the idea may be to reach a certain spot in the maze.

Mazes have been built with walls and rooms, with hedges, turf, or crops such as corn or, indeed, maize, or with paving stones of contrasting colors or designs.

Mazes can also be drawn on paper to be followed by a pencil.

One of the short stories of Jorge Luis Borges featured a book that was a literary maze.

Various maze generation algorithms exist for building mazes, either by hand or by computer.

Contents

1 Solving mazes

1.1 Wall follower
1.2 Pledge algorithm
1.3 Random mouse
1.4 Tremaux's algorithm

2 Mazes open to the public

3 Maze by Christopher Manson

4 Mazes in science experiments

5 Other types of mazes

6 External links

Solving mazes

The mathematician Leonhard Euler was one of the first to analyse plane mazes mathematically, and in doing so founded the science of topology.

The following algorithms are designed to be used inside the maze by a traveler with no prior knowledge of the maze's layout. There are other algorithms that can be used for solving paper mazes, where the solver has an overview of the maze.

Wall follower

Missing image
Maze01-02.png
right-hand rule

The wall follower, the best-known rule for traversing mazes, is also known as either the left-hand rule or the right-hand rule. If the maze is simply connected, that is, all its walls are connected together or to the maze's outer boundary, by keeping one hand in contact with one wall of the maze you are guaranteed not to get lost and will reach a different exit if there is one; otherwise, you will return to your entrance. If the maze is not simply connected, this method will not help you to find the disjoint parts of the maze.

Pledge algorithm

Disjoint mazes can still be solved with the wall follower method, if the entrance and exit to the maze are on the outer walls of the maze. If however, the solver starts inside the maze, it might be on a section disjoint from the exit, and wall followers will constantly go around their ring. The Pledge algorithm (named after Jon Pledge of Exeter) can solve this problem.

The Pledge algorithm, designed to circumvent obstacles, requires an arbitrarily chosen direction to go towards. When an obstacle is met, one hand (say the right hand) is kept along the obstacle while the angles turned are counted. When the solver is facing the original direction again, and the total number of turns made is 0, the solver leaves the obstacle and continues moving in its original direction.

This algorithm allows a person with a compass to find the exit of any finite and fair 2 dimensional maze, regardless of the initial position of the solver. Higher dimensional mazes cannot be solved by this method or by wall followers, and one has to resort to one of the following methods.

Random mouse

This is a trivial method that can be implemented by a very unintelligent robot or perhaps a mouse, but which is not guaranteed to work. It is simply to proceed in a straight line until an obstruction is reached, and then to make a random decision about the next direction to follow. This will of course fail if the exit is, or is only reachable by, an opening in the middle of a wall.

Tremaux's algorithm

This efficient method requires drawing a line on the floor to mark your path, and is guaranteed to work for all mazes that have well-defined passages. On arriving at an unmarked junction, pick any direction. If you have visited the junction before, return the way you came. If revisiting a passage that is already marked, draw a second line, and at the next junction, take any unmarked passage if possible, otherwise take a marked one. You will never need to take any passage more than twice. If there is no exit, this method will take you back to the start.

See also [1] (http://www.riemannsurfaces.info/OtherTopics)

Mazes open to the public

Public maze in Schönbrunn Palace

Hampton Court Palace, England (hedge maze)
Chatsworth, England (hedge maze)
Samsø, Denmark (The biggest maze in the world) - http://www.samsolabyrinten.com/
Schönbrunn Palace, Austria (small entrance fee, tower at the center to overlook the hedge maze)
Longleat, England (hedge maze)
The Crystal Palace, England. A tiny maze in the park.
hedge maze at Leeds Castle, Maidstone, Kent, England. This is one of over 500 mazes worldwide which have been designed by Adrian Fisher. His company sells the full concept including detailled plans and bridges. Some of his most famous examples are very large maize mazes. Maize mazes are usually only kept for one growing season, so they can be different every year.

Maze by Christopher Manson

Maze (Henry Holt & Company, Inc.; (February 1989), ISBN 0805010882), billed as "The World's Hardest Puzzle", is a 45-room house in the form of a book. A party of naïve adventurers is led through by an unnamed poet, whose identity is a subject of much speculation. Each page is a room, with hundreds of possible visual clues in the picture along with the numbers of the rooms that can be entered, and a page describing the actions of the narrator and the adventurers which may contain even more clues. The object is to reach the "center" (Page 45), answer the riddle found there, and get back out in the fewest possible steps (16).

Online version: http://archives.obs-us.com/obs/english/books/holt/books/maze/
Solution to the riddle and connectivity matrix: http://rec-puzzles.org/new/sol.pl/treasure/maze

Mazes in science experiments

Mazes are often used in science experiments to study spatial navigation and learning. Such experiments typically use rats or mice. Examples are

Other types of mazes

Logic mazes: These mazes use some rule other than "don't cross the lines" to restrict motion. Examples are

Area-mazes or A-mazes, which the area of the tile you step on has to alternatingly increase and decrease with every step.
Dice mazes, in which a die is rolled onto cells based on various rules.
Number Mazes, in which a grid of numbers is navigated by traveling the number shown on the current square.
Multi State mazes, in which the rules for navigation change depending on how the maze has been navigated.

Mazes in higher dimensions: It is possible for a maze to have three or more dimensions. A maze with bridges is three dimensional, and some natural cave systems are three dimensional mazes. The computer game Descent utilized fully three dimensional mazes, and there is a computer program to simulate a maze navigable in four dimensions.