Search Summary

Time Space Complete? Opt?

Brute force DFS b^d d N N

BFS b^d b^d Y Y

Iterative deepening b^d bd Y Y

Iterative broadening b^d

Heuristic Best first b^d b^d N N

Beam b^d b+L N N

Hill climbing b^d b N N

Simulated annealing b^d b N N

Limited discrepancy b^d bd Y/N Y/N

Optimizing A* b^d b^d Y Y

IDA* b^d b Y Y

SMA* b^d [b-max] Y Y