📁 Files & materials on GitHub → UC Berkeley / CS 188
Uniform Cost Search (UCS) vs Dijkstra: Same Idea, Different Goal
Consistency: Why Admissible Isn't Enough for A* Graph Search