Answers are grounded in this paper and cite their sources.
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).
No takes yet. Share an insight, caveat, or question.
JiwonByun (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: