Skip to content

The price of a full search

Exhausting a plain row-scan search of the real Eternity II pieces with five clues takes about 10^40.457 nodes (2^134.4), measured, and the random-model prediction lands within 0.04 digits of it. The official piece set is an ordinary member of the boards painted with the same colour counts on this statistic. This prices the full search; it finds no way to shorten it.

by Raphaël Anjou

experimentmeasurementmeasuredReduce the searchBacktrackingWhy it resistsUpdated 2026-11-14
Reproduceseeded: reproduces with the given seedreruns the searchBudget: about 32 s per five-clue repetition at N = 1e6 particles; about 4 to 5 s per repetition at N = 1e5
Hardware & run
Native runCPU only
0.0089core-hours
Cores
1
CPU
10-core Apple laptop, runs limited to 4 single-threaded processes
Machine
10-core Apple laptop
Budget
about 32 s per five-clue repetition at N = 1e6 particles; about 4 to 5 s per repetition at N = 1e5
Start
seeded; every estimate is deterministic given its seed and binary
Reproduce this result

seeded: reproduces with the given seed

just experiments real-puzzle-profile m2

Re-runs the population estimate of the row-scan tree on the official pieces (five clues, centre clue only, no clue) with the committed seeds; it reproduces the estimates, not an enumeration of the tree, which is out of reach.

Code & data on GitHub

Keep exploring

Referenced by

Page sourceView as Markdown