Mind · Strategy
BeamSearch
Width-limited heuristic search
Definition
Mechanism
A heuristic search algorithm that explores a graph by expanding the most promising SolverNodes in a limited set (the beam). It manages a Queue of fixed size 'k'. At each step, it generates all successors of all nodes in the beam, Ranks them, and Selects the top 'k' for the next iteration.
Invariants
- Breadth Constraint: Active nodes never exceed Beam Width.
- Optimality: The K nodes selected are the highest ranked.
Risks
Failure modes
None stated.
Relationships
Builds on
References
Infrastructure
Ordered container with FIFO/LIFO/priority discipline and explicit dequeue semantics
Infrastructure
Order items by score
Infrastructure
Generic selection of items from a set based on criteria
Society
Stateful container for a running solver instance
Nothing in this library builds on this pattern yet.
Reference
Parameters
beam_widthInteger, [1, 100]- Number of parallel paths to keep