A card from a free library — ask anything, no account, works offline. Every card carries its source.
The solve path — two jaws that close on the answer
floor
How the engine solves a hard problem when no rule finds the exact answer (the barriers). Two jaws: EXCLUDE from outside (the barriers, the moat — cut the dead branches) and CONVERGE from inside (anchor, then the two doors — GET CLOSE, the bounded estimate, and CHANGE OF DOMAIN, the eigenbasis flip — then REFINE). They meet at the ANSWER: a value with a proven bound, small enough to decide. The proposer stays free; the checks and the bounds carry the certainty. Found, never generated — the steps point at the doors (tools/seed_solve_path.py).
source
Narrow Highway — the solve path (operator seed) · project_the_solve_path_get_close_and_change_of_domain
card id
card_floor_the_solve_path
address
WIT.codex.EXP/the-solve-path/REF.WITNESSED@narrow-highway
adjoining cards
- has part → Exclude from outside — the barriers and the moat — a jaw of the solve path (Exclude from outside)
- has part → Converge from inside — anchor on what you know exactly — a jaw of the solve path (Converge from inside)
- connects at → The narrow way — exclude, narrow, converge to one — the method: two jaws converge on the one answer
- connects at → The energy eigenbasis — the stationary states — the change-of-domain door IS diagonalizing H; eigenvectors = the stationary states
- connects at → Least action — of all paths, the stationary one — a stationary point is an optimization: exclude the non-stationary, converge on delta S = 0
- connects at → Nash equilibrium — a fixed point — the equilibrium is a fixed point - the solve path's converge step
- connects at → Zero-sum and minimax — the mixed value — the minimax value is an optimization - converge on the saddle point
- part of → The Floor of Discovery — one floor, and by its design the fear of God — the solve path on the one map
Is this card incomplete? Tell the library — it will call out for more ↗