DescriptionIn 2010, Tomas Rokicki, Herbert Kociemba, Morley Davidson, and John Dethridge proved that every solvable Rubik's Cube configuration can be solved in 20 moves or fewer — a figure popularly called 'God's Number' — using a massive distributed computer search (with computing time donated by Google) that partitioned the cube's roughly 43 quintillion possible positions into a set of cosets, each individually verified to be solvable in 20 moves or fewer. It also confirmed that 20 is tight, since specific positions are known that provably require the full 20 moves.
Formal questionEvery solvable configuration of the standard 3x3x3 Rubik's Cube can be solved in at most 20 face-turn moves, a bound proven exhaustively via computer search in 2010 and shown to be tight (some positions genuinely require all 20 moves).
Scope auditDoes your result fit this record?
Change a parameter to stress-test whether a proposed result is still inside the published specification. This is an audit aid, not a proof checker.
This record has no editable parameters. Read the formal question and assumptions before challenging it.
Scope matches the published specificationNo parameters changed
