class Theseus::Solvers::Astar
An implementation of the A* search algorithm. Although this can be used to search “perfect” mazes (those without loops), the recursive backtracker is more efficient in that case.
The A* algorithm really shines, though, with multiply-connected mazes (those with non-zero braid values, or some symmetrical mazes). In this case, it is guaranteed to return the shortest path through the maze between the two points.
Attributes
open[R]
The open set. This is a linked list of Node
instances, used by the A* algorithm to determine which nodes remain to be considered. It is always in sorted order, with the most likely candidate at the head of the list.