No description
87d564bfb1
Recreate Heuristic.{h,cpp} (per-agent backward-BFS shortest-path distance table)
and rewire genSwapRoom to route by the exact distance gradient instead of the
Manhattan approximation. Manhattan (kept on the stress-test branch) is exact only
on obstacle-free maps; the Dijkstra table is correct on maps with obstacles, which
main targets.
Note: Heuristic.cpp was never committed originally (untracked, then deleted), so
its body is reconstructed to match the known interface; behaviour is verified
VALID & COMPLETE on empty and room_cycle(_cycle) maps.
Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
|
||
|---|---|---|
| asset | ||
| dataset/test_files | ||
| inc | ||
| src | ||
| .DS_Store | ||
| .gitignore | ||
| asan.cmake | ||
| CMakeLists.txt | ||
| ubsan.cmake | ||