🎯 SMGS & Beam Stack Search
155 words
1 min read
Visual companion
Python
Type and operator map
Python Week 1: the first filter for runtime behavior
View
Revision summary
What this note is really saying
Short form
# 🎯 SMGS & Beam Stack Search ## 1. 🎯 Learning Objectives - Explain multi-goal search scenarios - Describe Beam Stack Search combining beam width with depth-first ordering - Compare SMGS with A* for multiple goals ## 2.
🎯 SMGS & Beam Stack Search
1. 🎯 Learning Objectives
- Explain multi-goal search scenarios
- Describe Beam Stack Search combining beam width with depth-first ordering
- Compare SMGS with A* for multiple goals
2. 📖 Core Content
3.1 Multi-Goal Search
Some problems have multiple goal states. We want the closest goal (shortest path to any goal).
3.2 Beam Stack Search
Combines beam search (width k) with stack-based DFS ordering. Maintains k beams at each depth but uses LIFO ordering within each level.
Advantages over standard beam: Complete (can revisit pruned beams if needed).
4. 📝 Practice Questions
Q1: Why is Beam Stack Search more complete than standard Beam Search?Answer: Standard Beam Search permanently prunes states that fall outside the top k. Beam Stack keeps a stack of beams, allowing recovery of previously pruned paths if the current beam fails. Join Discord PreviousMonotone ConditionNextSequence Alignment