Search I: Chapter 3 Aim: achieving generality
Search I: Chapter 3 Aim: achieving generality. Q: how to formulate a problem as a search problem?. Search (one solution). Brute force DFS, BFS, iterative deepening, iterative broadening Heuristic Best first, beam, hill climbing, simulated annealing, limited discrepancy Optimizing
577 views • 35 slides