Game
reading the chain…
Game
reading the chain…
Game #124 · set #1
One move of fog-of-war chess — a single decision node, engine-certified.
All-time
first round 33d ago · last 1d ago
How it's built
One position, one move, under fog: the chain draws the hidden-piece placement, your move is the single decision node, and the tree's 24 canonical branches carry the engine-evaluated outcome bands. The revealed placement doubles as the round's certificate — re-run the engine on (placement, move) and it must land in the settled band, so the proof is a chess engine's arithmetic, not our word. As everywhere, the edge check applies at optimal play; every deviation is yours.
Build one yourself — the SDK seals any distribution the edge band admits.
Sealed on-chain
These numbers are read from the sealed tree itself, not from this site's copy of it. Sealing is one-way: the contract verified the optimal-play return against its edge band once, and the tree has been immutable since — every round below settled against exactly these words.
The committed game tree
The whole game as the contract holds it, reconstructed from the sealed on-chain words at render time. Hover any node: green-filled nodes are chance (the seed decides), outlined nodes are decisions (you decide), colored endpoints are payouts. This object is what was submitted for edge-checking — the contract never learned the rules, only this shape.
Recent rounds
Each round's roll is re-derived from the revealed seed on its channel's proof page — nothing here is read from a private database of outcomes.