Lee algorithm
Algorithm based on breadth-first search to solve mazes
The Lee algorithm is one possible solution for maze routing problems based on breadth-first search. It always gives an optimal solution, if one exists, but is slow and requires considerable memory.
Nº Q4060677 ★
Common · Knowledge
Lee algorithm
Algorithm based on breadth-first search to solve mazes
The Lee algorithm is one possible solution for maze routing problems based on breadth-first search. It always gives an optimal solution, if one exists, but is slow and requires considerable memory.
From Wikipedia
The Lee algorithm is one possible solution for maze routing problems based on breadth-first search. It always gives an optimal solution, if one exists, but is slow and requires considerable memory.
Text: Wikipédia, CC BY-SA 4.0. · Image: Ian Kilgore (CC BY 3.0) ·
Related cards
-
Breadth-first search
Algorithm for searching the nodes of a graph in order by their hop count from a starting node
Nº Q325904 ★★★
Not listed
-
Maze-solving algorithm
Automated method for solving mazes
Nº Q1606072 ★★
Not listed
-
Pathfinding
Plotting, by a computer application, of the shortest route between two points
Nº Q1969601 ★
Not listed
-
Leaky bucket
Network traffic shaping and policing algorithm
Nº Q1378386 ★
Not listed
-
G
Greedy algorithm
Algorithm that makes locally optimal choices in a sequence of steps with the goal of reaching a global optimum
Nº Q504353 ★★★
Not listed
-
B
Best-first search
Algorithm
Nº Q830527 ★
Not listed