Skip to content

Seven families of approaches priced out against the row-scan tree

None of seven families of approaches (search that learns, lossy representations, the shape of the tree, adaptive orders, tile-set structure, algebraic and search-space reformulation), nor the far ideas, frame nogoods or alternative fill orders, is priced at 10 bits or more with a mechanism behind it. The largest surviving gain is about 5.5 bits, against a gap of 56 to 73 bits; a few closures rest on one reader or one solver family and are marked as such.

by Raphaël Anjou

findingdead endmeasuredparkedReduce the searchBacktrackingExact methodsLearned guidanceUpdated 2026-11-14
Reproducedeterministic: reproduces byte-for-bytere-verifies a stored board
Verify the stored board

deterministic: reproduces byte-for-byte

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

just experiments approach-pricing

Reprints the ceiling table of a perfect free cut from the committed level profile and reruns two cheap stdlib checks; it does not rerun the studies behind the family table, many of which take minutes to hours or import tools not packaged with the folder.

Code & data on GitHub

Keep exploring

Referenced by

Page sourceView as Markdown