A Line-Maze Solving Algorithm

Building a Line Maze Solving Robot

Two years ago, I developed a PowerPoint presentation to fully explain the algorithm for solving a line maze. I have had numerous requests for this document, so here is a direct link: line-maze-algorithm.pdf

Index

Index

SECTION	CLICK LINK TO GO TO THAT SECTION
1	What is a Line Maze?
1.1	What is a Line Maze?
1.2	Definitions
1.3	Islands or Loops in Mazes
1.4	Line Maze Contest Rules (Basic)
1.5	A Basic Algorithm for Solving a Maze
2	LINE MAZE CONTESTS
2.1	Line Maze Contest Rules in More Detail
2.2	Line Maze Solutions
2.2.1	Simple Line Maze Solution
2.2.2	Quickest Path Method
2.2.3	Advanced Strategies; P.I.D. (Proportional, Integrative, Derivitive)
2.2.4	Advanced Strategies; Skipping Intersections
2.2.5	Advanced Strategies; Faster Cornering
3	HOW A MAZE IS SOLVED
3.1.1	The Left Hand Rule
3.1.2	The Right Hand Rule
3.2.1	Handling Intersections; Detecting Them
3.2.2	The Eight Possible Intersections in Mazes
3.2.3	Intersection Patterns with Five Sensors
3.3	Eliminating or Correcting Bad Turns
3.4	Following the Line
4	STORING THE MAZE
5	PSEUDOCODE FOR THE ALGORITHMS
5.1	Functions
5.2	Breaking Down the Program
5.3	The Big Picture
5.4	Pseudocode
6	SOURCE CODE