test: reproduce cross-layer heuristic detour - #143
Draft
ShiboSoftwareDev wants to merge 9 commits into
Draft
Conversation
|
The latest updates on your projects. Learn more about Vercel for GitHub.
|
Benchmark This PRRun benchmarks by commenting on this PR: Everything after Examples:
Any PR whose title contains |
This was referenced Aug 2, 2026
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Problem
The solver's A* heuristic measures XY distance to the goal. For a route whose goal is on another layer, nearby ports on the wrong layer therefore look cheaper than the only useful direction: toward an existing region where the route can change layers.
Reproduction
The fixture has:
z0start andz1goal that are close in XY;z0dead ends; andThe route is limited to ten A* iterations. Timeout fallback is disabled so it cannot hide the bounded search failure. The current heuristic explores the nearby wrong-layer branches first and reaches the iteration limit before completing the legal detour.
Snapshot
The top view is the input topology. The bottom view is the failed bounded search; the green candidates remain near the wrong-layer dead ends while the legal multilayer region is farther right.
The fixture and SVG were executed and generated in GitHub Actions. No project command was run locally.