Search — From DFS, BFS, A* to Minimax and Alpha-Beta Pruning | Harvard CS50 AI Week 0
Week 0 is about search: DFS and BFS differ only in whether the frontier is a stack or a queue; A* adds the steps already taken to a heuristic estimate and guarantees the shortest path when the heuristic never overestimates; Minimax has the two players take the maximum and the minimum in turn, and alpha-beta pruning cuts branches that cannot change the result. With time links for every section, plus the approach, common mistakes and ways to check your work for the Degrees and Tic-Tac-Toe projects; the reference implementations are folded at the end of each project.