GeezerVisonThe World Wide Web, restored to 800 pixels of glory. | |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites | |
GeezerVison is showing github.com — Bound automatic diagonal heuristics by two cardinal steps by antonsoo · Pull Request #198 · libtcod/python-tcod Conversation
Contributor
Cap the automatic diagonal estimate at two cardinal steps. Keep the actual diagonal edge cost, diagonal-only graphs, greed multiplier and explicit heuristic overrides. The regressions cover C/F layouts and diagonal-only movement. An independent sample-dungeon heap oracle confirms all 60 previously incorrect single-endpoint queries, with all 1,920 ordinary-cost controls unchanged. A separate many-to-many reconstruction correction handles the remaining 59 failures; both together match all 2,240 queries. Full headless tests pass (324 passed, 95 skipped), using pinned native resource assets and SDL dummy audio. Mypy and applicable project formatting/hooks pass.
Sorry, something went wrong. Uh oh!
There was an error while loading. Please reload this page. All reactions
|
There was an error while loading. Please reload this page.
Codecov Report✅ All modified and coverable lines are covered by tests. Additional details and impacted files@@ Coverage Diff @@ ## main #198 +/- ## ======================================= Coverage 86.09% 86.09% ======================================= Files 29 29 Lines 7597 7597 ======================================= Hits 6541 6541 Misses 1056 1056 ☔ View full report in Codecov by Harness. 🚀 New features to boost your workflow:
|
Sorry, something went wrong.
There was an error while loading. Please reload this page.
There was an error while loading. Please reload this page.
There was an error while loading. Please reload this page.
Successfully merging this pull request may close these issues.
There was an error while loading. Please reload this page.