Repository navigation
Conversation
…trol floor_compare.py and round_search.py now raise instead of using assert, so the checks survive python3 -O. round_search.py gains a control that the win test fires one key before the record's end. The README says which scripts carry controls and what the winding identity does and does not show.
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.
Part of siliconcordat/.github#5. This reports a measurement under the III-21 threads in #22 and #53 (items C2 and E3).
What was measured
The published proof for III-21 at 270 keys splits every route at the move of the crate into the Druid's chamber.
It states that at least 74 further keys remain after the lower entrance, 75 after the upper entrance with a Fighter push, and 76 with a Thief pull. The page does not say whether these counts include hero switch presses (the
Akey). These floors are universal, so they must hold at every position right after that crate move (source claim).On real positions right after that crate move, two quantities were computed with the repo's own code:
a: the least total of solo move keys over all 720 assignments of the six heroes to the six exits (solo_walk_plus_wall_convert_matrixandenumerate_all_goal_bijections).b: the least number ofApresses needed to make every hero that is not on an exit act at least once, starting from the active hero.Positions were generated by breadth first search from record-route states, so each one is reachable. There were 43 distinct positions, all with the Fighter as the mover (16 upper, 27 lower). They fall at keys 195 to 206, later than every group in the proof's table, so none of them is one of the proof's 47,644 positions. The proof publishes counts per group, not positions.
aba + bevaluate_operator_counting_bound, rounded up)Status: verified. The scripts are on branch
exp/iii21-switch-floor-checkinexperiments/iii21_switch_floor_check. Reproduce withpython3 scripts/floor_compare.py. The check fails if the metric stops falling as the record route advances (ais 58 at key 195 and 36 at key 246).What follows
Neither
anora + bis close to 74. So this computation does not show whether the published floors count switch presses. It shows only that the floors come from something stronger than a hero-to-exit move sum plus the first round of presses. The move sumais also not a lower bound on its own, because a Bard key can move several heroes at once and a Wizard swap moves a hero by many cells.The proof page also says that four positions were excluded by a separate check that "followed each concrete board through the first cycle of hero turns" (source claim). So the prover already reasons about the turn order in some form.
Proposed: ask the proof's maintainer whether the 74, 75 and 76 count
Apresses. If they do not, the repo's merged Druid switch tax (5 here) adds on top. If they do, nothing is gained.Other results
Apresses equals the winding of the activation order. The winding is the sum of the forward cyclic distances from each acting hero to the next. For the 316-key record it is 75 and 75. For the part after key 195 it is 27 and 27. Reproduce withpython3 scripts/winding_identity.py. Adding six presses or removing one breaks the equality.Aonce per hero or more in a row and does not end on presses. It shows that the records waste no full cycle. It does not show that a winding bound is tight.python3 scripts/layer_table.py.With k = 6 and target 271, 160 positions in 6 groups would remain. With k = 9 and no search the bound is 271 (earliest handoff 188, plus 74, plus 9). Both rest on the published floors and group counts (source claim). The earlier groups were searched only to the budget of the 270 proof, so they would need to be searched again for 271.