The 4×4×4 Cube Can Be Solved in 51 Block Turns

We prove that every position of the 4×4×4 cube can be solved in at most 51 moves in the block turn metric (BT), improving the previous bound of 53 (Rokicki, 2015). The bound is 17 + 14 + 20: 17 outer block turns reach the stage-3 entry set (from the companion paper on the 53-move OBTM bound); an exhaustive BT stage-3 search over all 440,974,716,000 cells gives diameter 15, attained by exactly 56 states that are all strict maxima, and a junction lemma saves one move for every final syllable of the stage-1+2 word; the 3×3×3 diameter gives the final 20. We also reproduce the outer-block stage-3 search of the companion paper with an independent implementation and correct two statements of that paper, neither of which affects its theorem. Version 1.1 adds the computation archive of campaign r52 (run log, source code, worker reports and data, with SHA-256 checksums).

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-13
DOI
https://doi.org/10.5281/zenodo.24190741
Primary Topic
Artificial Intelligence in Games
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The 4×4×4 Cube Can Be Solved in 51 Block Turns

JiwonByun
4 links
Zenodo (CERN European Organization for Nuclear Research)
Artificial Intelligence in Games
preprint

The 4×4×4 Cube Can Be Solved in 51 Block Turns

JiwonByun
preprint en

Abstract

We prove that every position of the 4×4×4 cube can be solved in at most 51 moves in the block turn metric (BT), improving the previous bound of 53 (Rokicki, 2015). The bound is 17 + 14 + 20: 17 outer block turns reach the stage-3 entry set (from the companion paper on the 53-move OBTM bound); an exhaustive BT stage-3 search over all 440,974,716,000 cells gives diameter 15, attained by exactly 56 states that are all strict maxima, and a junction lemma saves one move for every final syllable of the stage-1+2 word; the 3×3×3 diameter gives the final 20. We also reproduce the outer-block stage-3 search of the companion paper with an independent implementation and correct two statements of that paper, neither of which affects its theorem. Version 1.1 adds the computation archive of campaign r52 (run log, source code, worker reports and data, with SHA-256 checksums).

Zenodo (CERN European Organization for Nuclear Research)
Artificial Intelligence in Games
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon