Skip to content

Frame and corners: a wrong frame is not cheap to refute

Refuting a wrong full frame of the real pieces is not cheap: the preregistered kill line is met, and refuting partial frames costs 2.2 to 2.5 bits more than it can save. The cheap information about the frame, about 17.4 bits, sits at the four clue corners. Whether frames away from the corners can be refuted cheaply is undecided.

by Raphaël Anjou

experimentmeasurementmeasuredparkedWhy it resistsReduce the searchUpdated 2026-11-14
Reproduceheavy compute: script and results are committedreruns the searchBudget: about 59 core-hours (test stage 4.8 h, extra far-from-corner set 1.1 h)
Hardware & run
Native runCPU only
48.0core-hours
Cores
10
Threads
12
GPUs
0
CPU
x86 host, 12 threads, at most 10 used
Machine
12-thread x86 host, 10 jobs in parallel
Budget
about 59 core-hours (test stage 4.8 h, extra far-from-corner set 1.1 h)
Start
frame samples and counts seeded; refuter timings depend on the host
Reproduce this result

heavy compute: script and results are committed

just experiments frame-cores

Reruns the whole preregistered measurement (about 59 core-hours) and regenerates the tables from the raw rows; frame samples and counts are seeded, refuter timings are not. The 17.4-bit and 10^13.6 figures come from the pricing notes, not from this command.

Keep exploring

Referenced by

Page sourceView as Markdown