Use this search tool when a large decision tree makes exhaustive exploration impractical and you can define how candidates are expanded and ranked.

Search tree

Required object.

Beam width

Required integer.

Maximum depth

Required integer.

The cited overview of Beam search supplies background for the terminology and domain context used by this tool.^[1]

Expand a scored tree while retaining only the best paths at each level. Inputs are interpreted exactly in the displayed units and the calculation returns the following fields without presentation rounding.

Beam trace

Returned object.

• A bounded search can discard the path leading to the best result, and its output depends on the scoring function, branching order, beam width, stopping rule, and duplicate handling.
• Beam width must be at least 1.
• Beam width must be no greater than 1000.
• Maximum depth must be at least 1.
• Maximum depth must be no greater than 30.
• Use finite inputs in the displayed units, preserve source measurements and assumptions, and independently verify consequential decisions.

Compare the result with exhaustive search on small cases, increase the beam width, or use a domain-specific exact or heuristic search when completeness matters.

• Graph Breadth-First Traversal

  Visit every node reachable from a start node in breadth-first order over directed edges, visiting neighbors in ascending order and reporting each node's depth.

• Graph Depth-First Traversal

  Visit every node reachable from a start node in iterative depth-first preorder over directed edges, descending into the smallest-numbered neighbor first and reporting each node's depth.

• Permutations Generator

  Generate every ordering of a list in deterministic lexicographic order.