Best-First Search
Domain: Algorithms
🎯 Motivation
A search that uses a heuristic to decide which node to explore next, prioritising the most promising path. Greedy BFS and A* are examples.
📋 Concrete Example
Using a distance heuristic: at each step, explore the node that appears closest to the goal. Like BFS but guided by an estimate rather than exploring uniformly.
🔗 Analogy
A hiker choosing trails: at each junction, they pick the trail that looks most like it heads toward the summit, rather than trying every trail equally.