43'252'003'274'489'856'000
( ≈43 Quintillion)
20 Moves
( 35 years of calculation for one processor)
5.25s - Collin Burns '15
What is the world record for the fastest solve?
Pyraminx
2x2
4x4
5x5
6x6
7x7
Megaminx
Skewb
Square-1
Rubiks Clock
One-Handed
With Feet
Blindfolded
Multi-Blindfolded
R
L
U
D
F
B
R'
L'
U'
D'
F'
B'
x
x'
y
y'
z
z'
If the Edge is twisted incorrectly-> F U' R U'
Scramble: L2 F2 U' F2 D B2 F2 D2 L
The white-orange Edge is already in the top layer -> U
In the bottom layer, there is the White-Green Edge.
This Edge must go below the Green Center -> D2
And has to be turned to the top layer-> F2
In the bottom layer there is the White-Red Edge.
This Edge must go below the Red Center -> D'
And has to be turned to the top layer -> F2
The last Edge (White-Blue) is placed on the red side
This Edge must turned down to the bottom layer -> F
Afterwards the Edge has to go below the blue center-> D
Because we moved the White-Red Edge, it has to go back up again -> F'
And now, the White-Blue Edge can be turned up -> F2
As long as the Corner is correctly inserted
Is a corner already in the top layer, you have to perform the Algorithm ( R' D' R D ) once.
We search a non-yellow side in the top-layer
U'
To the Left
To the Right
U R U' R' U' F' U F
U' L' U L U F U' F'
(U' L' U L) (U F U' F')
(U R U' R') (U' F' U F)
(F R U) (R' U' F')
Dot
L-Shape
Line
Alg -> L-Shape
2 times Alg
Alg
(F R U) (R' U' F')
(R U R') U (R U2 R') U
2 adjacent correct pieces
No adjacent correct pieces
Alg -> 2 adjacent correct pieces
Place the two correct pieces at the back left + Alg
Hint: Sometimes you have to turn the U-Layer a couple of times (maximum 3 times) to see if there are 2 adjacent correct pieces.
(U R U' L') (U R' U' L)
Corner Permutation Algorithm
Corner Orientation Algorithm
R' D' R D
One correct corner
No correct corner
You have to look around the whole cube to see if there is a correctly placed corner.
Correct corner on the front-right
U R U' L' U R' U' L
U R U' L' U R' U' L
<-- One correct corner
Congratulations!
Author: Tobias D. Peter
Licence: CC BY SA -