Math & Optimization · beginner · concept 57 of 311 · Updated Nov 4, 2026

🗺️Search Algorithms (A*, Minimax)

Search algorithms find a route through a space of possible states, such as a path on a map or a move in a game. Breadth-first and depth-first search explore systematically; A* uses a heuristic to head toward the goal; minimax plans against an opponent. This is classic AI that still runs in navigation and games, and it sits inside systems like AlphaGo.