Stachu Korick | @stachudotnet | hello@stachu.net
Nov 17, 2018
Stachu
site: stachu.net
.NET
email: hello@stachu.net
github: @stachudotnet
facebook: @stachudotnet
twitter: @stachudotnet
The core structure of the Rubik's Cube does not move relative to each
12 Edges surround the core and the centers.
Each of these 12 pieces has two orientations; "correct" and "flipped."
An edge cannot have opposite-side colors.
8 "corner" pieces surround the core and edges.
Each of them has 3 orientations: "correct," "twisted clockwise" and "twisted counter-clockwise."
These also cannot have two "opposite" colors.
Modeling the cube's state
Writing a scrambler
Transcribing the basic 18 'moves'
Getting *some* solver running
Facelet
Facelet Array
Cubie
Piece Arrays
CO+CP+EO+EP
CO + CP + EO + EP
CO: 0 <= x1 < 3^7
EO: 0 <= x2< 2^11
CP: 0 <= x3< 8!
EP: 0 <= x4< 12!
R2 U2
R2
U2
U2 R2
U2 R2 U2 R2 U2 R2
U2 R2 U2
U2 R2 U2 R2
U2 R2 U2 R2 U2
R2 U2 R2
R2 U2 R2 U2
R2 U2 R2 U2 R2
Cross
F2L
(First 2 Layers)
OLL
(Orientation of the Last Layer)
PLL
(Permutation of the Last Layer)
Solved:
Solve the rest, using only <U,D,R2,L2,F2,B2>
Corner Orientation
Corner Permutation
function Treesearch(position p, depth d) if d = 0 then if p is solved then Hooray! else if d > 0 then if prune1[p] <= d and prune2[p] <= d then for each available move m Treesearch(result of m applied to p, d-1)
@stachudotnet on twitter and
(hello@)stachu.net
Topic suggestions: