⚙️ Configuration vs. Planning Problems
142 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
# ⚙️ Configuration vs. Planning Problems ## 1.
⚙️ Configuration vs. Planning Problems
1. 🎯 Learning Objectives
- Distinguish configuration (goal state only) from planning (path to goal)
- Classify given problems correctly
- Explain why path reconstruction is optional for configuration problems
2. 📖 Core Content
3.1 Configuration Problems
Solution = Goal State. The path doesn't matter. Examples: N-Queens, Sudoku, SAT, Map Coloring MoveGen: Place/modify one element at a time GoalTest: Check if constraints satisfied
3.2 Planning Problems
Solution = Path from Start to Goal. The sequence matters. Examples: 8-puzzle, Rubik's Cube, Route-finding, TSP MoveGen: Apply legal moves GoalTest: Check if state matches goal configuration
3.3 Why the Distinction Matters
- Configuration problems: Can use local search, CSP, without path tracking
- Planning problems: Need search algorithms with nodePairs, OPEN/CLOSED
- Wrong approach → wasted computation Join Discord PreviousState Space SearchNextImplicit vs Explicit