flâneur

CS106B Mazes

web.stanford.edu · 4,573 words · saved by 1 readers

A maze is a twisty arrangement of corridors that challenges the solver to find a path from the entry to the exit. This part of the assignment is about using ADTs to represent, process, and solve mazes. Labyrinths and mazes have fascinated humans since ancient times (remember Theseus and the Minotaur?), but mazes can be more than just recreation. The mathematician Leonhard Euler was one of the first to analyze mazes mathematically, and in doing so, he founded the branch of mathematics known as topology. Many algorithms that operate on mazes are closely related to graph theory and have applications to diverse tasks such as designing circuit boards, routing network traffic, motion planning, and social networking. Your goal for the maze portion of the assignment to implement neat algorithms to solve a maze, while gaining practice with ADTs. Before jumping into the code, please carefully read this background information on how we will represent mazes, which ADTs to use, and the format of th

CS106B Mazes Mazes Assignment by Julie Zelenski with additions by Sean Szumlanski A maze is a twisty arrangement of corridors that challenges the solver to find a path from the entry to the exit. This part of the assignment is about using ADTs to represent, process, and solve mazes. An introduction to mazes Labyrinths and mazes have fascinated humans since ancient times (remember Theseus and the Minotaur ?), but mazes can be more than just recreation. The mathematician Leonhard Euler was one of the first to analyze mazes mathematically, and in doing so, he founded the branch of mathematics kno

related reading