Search

• Brute force

  • DFS, BFS, iterative deepening, iterative broadening

• Heuristic

  • Best first, beam, hill climbing, simulated annealing, limited discrepancy

• Optimizing

  • Branch & bound, A*, IDA*, SMA*

• Adversary Search

  • Minimax, alpha-beta, conspiracy search

• Constraint Satisfaction

  • As search, preprocessing, backjumping, forward checking, dynamic variable ordering 

Previous slide

Next slide

Back to first slide

View graphic version