Multi-Path Plan Generator
Generate multiple candidate next-steps at each plan node enabling later selection — the planning generator pattern paired with tree-of-thoughts / LATS-style search.
Problem
When generator and search policy are fused, neither can be tuned independently. The generator's quality limits the search; the search's strategy limits how generator candidates are used. Isolating the generator (this pattern) from the search policy enables independent tuning. Distinct from single-path-plan-generator and from tree-of-thoughts (the full search algorithm).
Solution
Multi-path generator interface: (current_node, history, K) → [candidate_step_1, ..., candidate_step_K]. Search policy (tree-of-thoughts, LATS, beam search, MCTS) decides which candidates to expand. Generator and search policy are separate components and can be swapped independently. Pair with tree-of-thoughts, lats, single-path-plan-generator (alternative), beam search.
When to use
- Plan path quality varies significantly — search pays off.
- Cost budget allows K× per-node generation.
- Search algorithm benefits from diverse candidate generation.
Open the full interactive page →
Diagram, neighbourhood map, code examples, related patterns and full provenance.