Deterministic daily puzzles and grid logic
By Mihai
How a date seed, a solution counter and explicit rules produce a shared daily Queens grid, and how other grid games differ.
A daily puzzle needs a common clock
If every visitor uses local midnight, players on different sides of the world can see different daily grids at the same moment. Void Fabric instead uses the UTC date, formatted YYYY-MM-DD. That string becomes a numeric seed for a deterministic pseudo-random generator. The same seed and implementation recreate the same candidate sequence. An already open board stays fixed until reset so that a midnight boundary does not erase a game in progress. A future generator change must be treated as a rules-version change.
Queens uses regional constraints
The seven-by-seven board has seven connected regions. Exactly one queen belongs in each row, column and region, and two queens may not touch even at a corner. This is not classical chess-queen movement: a distant shared diagonal is allowed. The generator first selects a row-by-row placement satisfying column and adjacency constraints, then grows regions from those positions. That construction supplies at least one solution, but it does not by itself prove that there is only one.
Count solutions before presenting a grid
A backtracking solver visits one row at a time and tracks used columns, used regions and adjacency to the previous row. It can stop after two solutions because a second solution already disqualifies uniqueness. The generator retries a bounded number of candidates and has a deterministic unique fallback. Accepted boards have exactly one solution under the published rules. Uniqueness does not automatically imply a particular human difficulty or that a specified deduction system can solve the board without trial placements.
Minesweeper protects the opening, not every deduction
Mines are generated after the first reveal, excluding the selected cell and its neighbors. This guarantees a zero opening. Later states can still require guesses because the generator does not run a no-guess solver. Numbered cells count all eight neighboring positions. Chording opens unflagged neighbors when the neighboring flag count matches the number, so incorrect flags can cause a loss. The algorithm must distinguish the player’s hypothesis from an actual proof of safety.
2048 combines deterministic moves with random spawns
A directional move compresses each line and merges equal adjacent values once. Two pairs of twos create two fours in one move. A valid changed board receives a new random tile; an unchanged move does not. Preserving empty space and arranging larger tiles along an edge can make planning easier, but a random spawn still changes the future position. The saved board and single undo make a session easier to resume and inspect. Points per move is a descriptive statistic rather than an optimization guarantee.