Thus many maze solving algorithms are closely related to graph theory. Mazes containing no loops are known as "standard", or "perfect" mazes, and are equivalent to a tree in graph theory. The mathematician Leonhard Euler was one of the first to analyze plane mazes mathematically, and in doing so made the first significant contributions to the branch of mathematics known as topology. Some maze solving methods are designed to be used inside the maze by a traveler with no prior knowledge of the maze, whereas others are designed to be used by a person or computer program that can see the whole maze at once. Maze solving is the act of finding a route through the maze from the start to finish.
Mazes can also be printed or drawn on paper to be followed by a pencil or fingertip. Players enter at one spot, and exit at another, or the idea may be to reach a certain spot in the maze. Another type of maze consists of a set of rooms linked by doors (so a passageway is just another room in this definition). Indoors, mirror mazes are another form of maze, in which many of the apparent pathways are imaginary routes seen through multiple reflections in mirrors. Maize mazes can be very large they are usually only kept for one growing season, so they can be different every year, and are promoted as seasonal tourist attractions.
Mazes have been built with walls and rooms, with hedges, turf, corn stalks, straw bales, books, paving stones of contrasting colors or designs, and brick, or in fields of crops such as corn or, indeed, maize.
0 kommentar(er)
