Go to content
The program generates mazes using three standard algorithms: Depth-first search, Prim's algorithm, and Kruskal's algorithm. The Show Gen option will allow you to watch the construction process. Use the scrollbar below the option to control the generation speed. Similarly, the Show Solve option will display the process of solving the maze, and has a scrollbar for speed control. The Backtracks option controls the display of dead-end paths, where the solver backs up.
The Cycle button will loop the program indefinitely, generating and solving mazes using the current settings. ## Glossary

### algorithm

A set of precise instructions which, if followed, will solve a problem.

### cycle

Decision maths: a closed path, ie the end vertex of the last edge is the first vertex of the start edge.
Mechanics: a cycle is completed when an oscillating object returns to the same position traveling in the same direction at the same speed

### kruskal's algorithm

a method for finding the minimum connector of a network, based on finding the lightest edge at each stage

### solve

To find the answer or solution to a problem.

### speed

velocity without direction; a scalar quantity

Full Glossary List

## This question appears in the following syllabi:

SyllabusModuleSectionTopicExam Year
AQA A-Level (UK - Pre-2017)D1Algorithms on graphsMinimum connector-
AQA AS Further Maths 2017Discrete MathsNetworksMinimum Connector-
AQA AS/A2 Further Maths 2017Discrete MathsNetworksMinimum Connector-
Edexcel A-Level (UK - Pre-2017)D1Algorithms on graphsMinimum connector-
Edexcel AS Further Maths 2017Decision Maths 1Algorithms on GraphsMinimum Connector-
Edexcel AS/A2 Further Maths 2017Decision Maths 1Algorithms on GraphsMinimum Connector-
I.B. Higher Level10Algorithms on graphsMinimum connector-
OCR A-Level (UK - Pre-2017)D1Algorithms on graphsMinimum connector-
OCR AS Further Maths 2017Discrete MathsNetwork AlgorithmsMinimum Connector-
OCR MEI AS Further Maths 2017Modelling with AlgorithmsNetworksMinimum Connector-
OCR-MEI A-Level (UK - Pre-2017)D1Algorithms on graphsMinimum connector-
Universal (all site questions)AAlgorithms on graphsMinimum connector-