coinman
Veteran
Just got a 5:51.xx solve on my third attempt (the two first was hoers long). I bought two of them so i still have one that is solvable 
Follow along with the video below to see how to install our site as a web app on your home screen.
Note: This feature may not be available in some browsers.
I wonder what the God's Algorithm count would look like for LL corners, just using UL/UB/UF/UR turns.
Well, actually, nevermind that, I did the calculations. Here are the number of positions at each depth:
0 moves: 1 (that's the solved case)
1 move: 4
2 moves: 10
3 moves: 20
4 moves: 34
5 moves: 52
6 moves: 74
7 moves: 100
8 moves: 130
9 moves: 128
10 moves: 74
11 moves: 20
12 moves: 1 (that's the U2 case)
The average case takes 7.39 moves to solve.
What do you mean? What details do you want? I'm not gonna just go posting an optimal solution to each position![]()
My method (when it's been scrambled without jumbling) is as follows:
- First layer centers.
- Finish first layer by pairing the corners up with two centers each before inserting.
- Last layer corners (I solve one by one, then do last two at once).
- Last layer centers, do the 3-cycles first and then any 2-cycles in pairs.
I use three main algs: J-perm (UL UF UR UF UL), 2-2 cycle ((UF UR)3), 3-cycle ((UF FR UR FR)2) and inverse. And see, it works pretty well:
36.48, (1:01.38), (34.00), 51.96, 42.26, 41.95, 46.47, 57.55, 54.00, 45.83, 49.07, 47.68 => 47.32![]()
- Finish first layer by pairing the corners up with two centers each before inserting.
How do you do this step? I can't find a way to pair the corners with centers easily and if manage i can't keep them paired up wile moving it to insert it in the right slot.
No, I don't have GAP, I used ksolve (+ some javascript stuff to generate cases).
The <UR,UF,FR> subgroup sounds interesting, only about 2600 cases so it's still doable with my primitive methodI'll take a look.
EDIT: Tried it, here's what comes up:
Depth 0: 1
Depth 1: 3
Depth 2: 6
Depth 3: 12
Depth 4: 24
Depth 5: 48 [it stops doubling here, so if you do up to 5 moves there is exactly 1 optimal solution and it's the inverse]
Depth 6: 93
Depth 7: 180
Depth 8: 315
Depth 9: 489
Depth 10: 604
Depth 11: 522
Depth 12: 250
Depth 13: 42
Depth 14: 3 [RF UF RF UR UF UR UF RF UF RF UR UF UR UF, or a corner 2-2 cycle, and its rotations]
So that's 2592 total cases, with an average of 9.45 moves to solve.
Hm, what do you mean? It took about 20 seconds for ksolve to generate those cases (but I do have optimal solutions for them all now) so at about 100 cases/sec it would take a LOT of time for anything serious like pyraminx or 2x2. I imagine an algorithm which goes through the state tree once would take a lot less time than one which separately computes each optimal solution, though.
There's [DF, FR UR UB UL UB UR UF FR], 18 moves, but it's still pretty long. I seriously think you are going to have better luck (from an efficiency standpoint) doing the corners before the centers.
You can solve all the last layer corners in 16 turns with the method I posted so unless you are making big savings on the centers this doesn't seem worth it. What is your method for the last layer centers?
[FR FD FR , FU] [FD FR FD , FL] (16 turns)
Skip the first turn (cyclical shift) for twisting 2 diagonally opposite cornera inatead, also 16 turns. Still working on the super twist. I'm down to 22 turns, due to partial cancellation (still twicw the 12 turn 3- twist)
Per
You can solve all the last layer corners in 16 turns with the method I posted so unless you are making big savings on the centers this doesn't seem worth it. What is your method for the last layer centers?
I also now rediscovered how to swap two corners without turning them. It takes a four centers jumbling twist. Just do UR UL jumble UF UR UL. You can save a quarter turn on the first UL by stopping in the jumbling position.