Search
DFS search
- Not complete
- Not optimal
- Time complexity \(O(b^m)\)
- Space complexity \(O(mb)\)
BFS search
- Complete
- Optimal
- Time complexity \(O(b^m)\)
- Space complexity \(O(b^m)\)
IDS (Iterative Deepening Search)
- Complete
- Optimal
- Time complexity \(O(b^m)\)
- Space complexity \(O(bm)\)
Lowest-Cost-First Search (LCFS)
- Complete (but paths need to be positive)
- Optimal (but paths need to be non-negative)
- Time complexity \(O(b^m)\)
- Space complexity \(O(b^m)\)