Chapter 3.4 - 3.7
Notation
- b - branching factor
- d - depth of shallowest goal node
- m - maximum length of any path in the state space
- l - depth limit
- TC - time complexity
- SC - space complexity
Tree Search
Uninformed Search
- Breadth-first search - BFS
- Uniform-cost search
- Depth-first search - DFS
- Backtracking search
- Depth-limited search - DLS
- Iterative-deepening - ID
Summary Table
| Search | Complete? | Optimal? |
Best TC | Average TC | Worst TC |
Best SC | Average SC | Worst SC |
| BFS |
| | |
| | |
| |
| DFS |
| | |
| | |
| |
| DLS |
| | |
| | |
| |
| ID |
| | |
| | |
| |
Other Issues
- Bidirectional search
- Avoiding repeated states
- Sensorless problems
- Contingency problems