ananasclassic
Member
I have made public a computer-assisted proof artifact that improves the known OBTM upper bound for the 4x4x4 Rubik’s Cube from 55 to 54:
https://github.com/AnanasClassic/4x4x4-obtm-54-research
The new exact result is that phases 1 and 2 of the three-phase decomposition can always be completed jointly in at most 18 moves. Combining this with the previously published bounds of 16 moves for phase 3 and 20 moves for the reduced 3x3x3 phase gives:
18 + 16 + 20 = 54 OBTM.
The repository contains the implementation, exact computations, certificates, verification scripts, and reproducibility instructions.
I would be particularly interested in independent scrutiny of:
https://github.com/AnanasClassic/4x4x4-obtm-54-research
The new exact result is that phases 1 and 2 of the three-phase decomposition can always be completed jointly in at most 18 moves. Combining this with the previously published bounds of 16 moves for phase 3 and 20 moves for the reduced 3x3x3 phase gives:
18 + 16 + 20 = 54 OBTM.
The repository contains the implementation, exact computations, certificates, verification scripts, and reproducibility instructions.
I would be particularly interested in independent scrutiny of:
- the precise definition and implementation of the phase 1/2 boundary;
- the parity convention and its implementation;
- the composition of phase states and cosets;
- whether the certificates and verification procedure are sufficient for independent reproduction.