Skip to content

PRIOR

Build a board from nothing, breaking ties by where pieces tend to sit in the strong boards we already have. It reaches a high score with no starting board to copy.

by Raphaël Anjou

experimentsolvermeasuredplateaued460/480matched edgesBuild boards upLearned guidanceUpdated 2026-07-21
Reproducestochastic — won't reproduce exactly; the board is verifiablere-verifies a stored boardBudget: not logged (exploratory run, not the standardized single-core bench)
Pipeline
  1. 1
    beam producernot yet written up

    Build a board from empty, cell by cell, breaking ties by the learned prior

    carries: Positional corpus prior: a 256×256 count of where each piece sits in strong boards

  2. 2
    refinementnot yet written up

    A short local-refinement tail lifts the mid-450s construction to the committed 460

Complexity
Time
prior build O(B·256) over B corpus boards; beam construction O(W·256·|moves|)
Space
256×256 count matrix (65,536 ints); rotation-aware variant 1024×256 (262,144)

The prior is a single pass over the corpus; the construction cost is the beam search it biases, plus an optional local-refinement tail.

Hardware & run
Native runCPU only
Cores
8
RAM
16 GiB
GPUs
0
CPU
Apple M1
Machine
MacBook (Apple M1, 8 cores)
Budget
not logged (exploratory run, not the standardized single-core bench)
Start
stochastic; see the run's repro command
Verify the stored board

stochastic — won't reproduce exactly; the board is verifiable

This verifies the board, not the search that produced it.

just research-record-boards
Code & data on GitHub

Keep exploring

Referenced by

Page sourceView as Markdown