Search algorithms: BFS, DFS, A*, minimax
Artificial Intelligence · Engineering
Study notes
Find shortest path in a maze: BFS explores level by level, guaranteeing shortest. A* with Manhattan heuristic goes straight toward goal, faster. For tic-tac-toe, minimax explores all moves assuming optimal opponent; alpha-beta prunes branches that cannot beat the best found. GPS uses A*; chess engines use minimax with pruning.