test: reproduce greedy final-route hard-constraint bypass - #139
Draft
ShiboSoftwareDev wants to merge 1 commit 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 |
Contributor
Author
|
/update-snapshots |
ShiboSoftwareDev
force-pushed
the
agent/repro-greedy-final-route-hard-constraints
branch
from
August 2, 2026 10:40
ff2434e to
4a2854f
Compare
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.
Stack
Stacked on #138.
Problem
The normal path search rejects a same-layer crossing with an infinite cost. The timeout-only greedy completion solver replaces the whole cost calculation with zero, so it also removes that hard rejection.
The result can be marked solved even though two different nets cross inside a single-layer region. The autorouter then receives topology that no physical high-density solver can implement legally.
Reproduction
The fixture has one single-layer square with an already-routed vertical net. A horizontal net is left for greedy timeout completion. The only horizontal path crosses the vertical net.
The test uses the real tiny-hypergraph solver state and its native visualization. On this reproduction branch, greedy completion accepts the crossing and the final safety assertion fails. The fix PR will use this exact fixture and assertion unchanged.
Validation