📁 Files & materials on GitHub → UC Berkeley / CS 188

Notes

Uniform Cost Search (UCS) vs Dijkstra: Same Idea, Different Goal

Consistency: Why Admissible Isn't Enough for A* Graph Search

AC-3's Queue: Why Order Doesn't Matter (and When It Does)