The 4×4×4 Cube Can Be Solved in 53 Outer Block Turns

We prove that every position of the 4×4×4 cube (Rubik's Revenge) can be solved in at most 53 moves in the outer block turn metric (OBTM), with positions taken modulo whole-cube rotation. The previous best published bound in this metric was 55 (Chen, 2015), with a claimed 54 (2026). The proof follows Chen's three-stage reduction: at most 17 moves reach the stage-3 entry set, using an exact phase-1 distance table on 6,902,491,710 symmetry classes and row certificates at depths 11 and 12; at most 16 moves finish stage 3, by an exhaustive search over all 440,974,716,000 cells of a symmetry-reduced encoding of the 7,041,323,520,000 stage-3 states, whose per-depth counts match two independently published distributions; and the 3×3×3 diameter theorem supplies the final 20. The result is computer-assisted. The archive contains the certificates, checker outputs, source code and a SHA-256 list of every file.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-13
DOI
https://doi.org/10.5281/zenodo.24190725
Citations
1
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 53 Outer Block Turns

JiwonByun
1 citations
Zenodo (CERN European Organization for Nuclear Research)
Artificial Intelligence in Games
preprint

The 4×4×4 Cube Can Be Solved in 53 Outer Block Turns

JiwonByun
preprint en
1 citations

Abstract

We prove that every position of the 4×4×4 cube (Rubik's Revenge) can be solved in at most 53 moves in the outer block turn metric (OBTM), with positions taken modulo whole-cube rotation. The previous best published bound in this metric was 55 (Chen, 2015), with a claimed 54 (2026). The proof follows Chen's three-stage reduction: at most 17 moves reach the stage-3 entry set, using an exact phase-1 distance table on 6,902,491,710 symmetry classes and row certificates at depths 11 and 12; at most 16 moves finish stage 3, by an exhaustive search over all 440,974,716,000 cells of a symmetry-reduced encoding of the 7,041,323,520,000 stage-3 states, whose per-depth counts match two independently published distributions; and the 3×3×3 diameter theorem supplies the final 20. The result is computer-assisted. The archive contains the certificates, checker outputs, source code and a SHA-256 list of every file.

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