- commit
- 54ada95c9fd9a7c279ba06720f7da126539e7d9b
- parent
- 8ecc483177ce8e8347785469d91e5e47e29b56b9
- author
- Dami <dami.etoile@gmail.com>
| M | openspec/ | 4 | ++++ |
| M | openspec/ | 1 | + |
@@ -47,6 +47,10 @@ The engine SHALL apply at most one noun-to-noun transformation link to each obje
4747 - **WHEN** the board contains `BABA IS ROCK` and `ROCK IS FLAG`4848 - **THEN** a BABA object becomes ROCK for that turn and does not become FLAG until a later turn that still satisfies the second rule4949 50+#### Scenario: Restoring a settled snapshot is not a turn51+- **WHEN** a snapshot contains ROCK after the first link of `BABA IS ROCK`, `ROCK IS FLAG`52+- **THEN** restoring that snapshot preserves ROCK and its automaton phase; only a later accepted turn may advance it to FLAG53+5054 ### Requirement: Rule reading SHALL select one stacked token per cell/path and enumerate alternatives5155 For each candidate sentence path, the parser SHALL select one word from each stacked cell, enumerate every valid alternative, and allow a sentence to start at a stacked cell. It SHALL not combine all stacked tokens as one permissive grammar. The resulting semantic rules SHALL remain deterministically ordered and physically sourced.5256 @@ -10,6 +10,7 @@
1010 - [x] 2.3 Verify one-link noun transformation chains and later-turn behavior.1111 - [x] 2.4 Implement one-token-per-cell/path stacked parsing, enumerate valid alternatives, allow stacked sentence starts, and add the five worlds fixtures without permissive token combinations.1212 - [x] 2.5 Bound stacked parser work; reject pathological initial packs and roll back a turn that exceeds the budget.13+- [x] 2.6 Make settled snapshot restore idempotent for one-link transformations so solver frontiers do not advance without a turn.1314 1415 ## 3. Verification and worlds handoff1516