admissible-heuristics

A limited-capacity rescue boat rescues passengers, retrieves black boxes, and drops off passengers at a station with 5 actions (Pick-up, Drop, Retrieve, Movement) using BFS, DFS, Iterative deepening, Greedy with 2 heuristics, and A* with 2 admissible heuristics.

Measures the trade an inadmissible heuristic makes in A*: search time saved against path quality given up, on maps small enough to verify by eye. Zero dependencies, 86 tests.