Tag
graph-search
- Oct 7, 2026 Bidirectional Search and the Problem of Knowing When to Stop Why two frontiers can meet without the answer being final, which stopping rules are provably safe, and how the meeting point is recovered from two label arrays. algorithms
- Aug 22, 2024 A* and the Conditions on a Heuristic Admissibility versus consistency, why a consistent heuristic removes the need to reopen closed nodes, and what weighting the heuristic buys and costs in solution quality. algorithms