drag to look around · s scramble · urfdlb turn (shift back) · enter solve · ? the moves explained · space next step · p play · 1-4 a way to solve it
El cubo deEdgar
Scramble it, or turn its faces yourself. The solver tries every sequence of moves, the short ones first, until one solves it: so the way back it shows you is the shortest there is. Then take it one turn at a time.
The group theory under it
The moves of a cube form a group: any two make a third, and each can be undone. The solver's shortcuts rest on these laws about it, written in Bend and proved in Bend: its checker accepts every proof, and so does BendTT's kernel (bend PROOF.bend --verdict).
- Four quarter turns are none.
U⁴ = 1, for every face.proved - Every move can be undone.
R R′ = 1, for every face and every turn.proved - Two turns of one face are one.
Rᵃ Rᵇ = Rᵃ⁺ᵇ, so a shortest solution never turns a face twice in a row, and the search never tries it.proved - Opposite faces commute.
U D = D U, so the search tries the two in one order only.proved - Other faces do not.
R U ≠ U R: the group is not commutative.proved - What a move keeps. Every move twists the corners by 0 in all (mod 3), flips the edges by 0 in all (mod 2), and moves corners and edges with the same parity.proved
- Famous orders.
(R U R′ U′)⁶ = 1and(R U)¹⁰⁵ = 1.proved - One scramble commutes with every move. The superflip, every edge flipped in place:
X R = R Xfor every move, soXcommutes with every cube.proved - Any first move. The search may begin with every one of the 18 moves, and after a face it skips only that face and, for U, R and F, the face across.proved
The solving happens on your device, in Bend compiled to JavaScript, on one Web Worker for each of its cores. First a quick search (Kociemba's two-phase algorithm) finds a short way back, about 20 moves, in a second or two. Then the shortest is looked for, and only lengths below the short way's need searching: once they all have no solution, the short way is a shortest one. Why the first solution found is a shortest one: the search is Korf's (1997) IDA*. Each bound on the length is searched in full, its subtrees shared out among the workers, and a branch is cut only when a table proves it cannot finish in time: one table for the corners (88 million positions) and one each for two sets of six edges (43 million each), fetched once and kept by your browser. Every cube is at most 20 moves from solved. A phone or a laptop proves the shortest for cubes up to about 14 or 15 moves from solved in seconds; a fully random cube (17 or 18) takes it longer than the 240 s it gets, and then the page gives the short way, says it may not be the shortest, and how far the search got.