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 ★
Común · Saberes
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.
En Wikipedia
Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.
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.
Texto: Wikipedia en inglés, CC BY-SA 4.0. · Imagen: Ian Kilgore (CC BY 3.0) ·
Cartas cercanas
-
Búsqueda en anchura
Algoritmo de búsqueda no informada utilizado para recorrer o buscar elementos en un grafo (usado frecuentemente sobre árboles)
Nº Q325904 ★★★
Sin ofertas
-
Maze-solving algorithm
Automated method for solving mazes
Nº Q1606072 ★★
Sin ofertas
-
Búsqueda de ruta
Nº Q1969601 ★
Sin ofertas
-
Algoritmo de cubeta con goteo
Nº Q1378386 ★
Sin ofertas
-
A
Algoritmo voraz
Nº Q504353 ★★★
Sin ofertas
-
B
Best-first search
Algorithm
Nº Q830527 ★
Sin ofertas