• Welcome to the Speedsolving.com, home of the web's largest puzzle community!
    You are currently viewing our forum as a guest which gives you limited access to join discussions and access our other features.

    Registration is fast, simple and absolutely free so please, join our community of 40,000+ people from around the world today!

    If you are already a member, simply login to hide this message and begin participating in the community!

2x2x2 move count

Gparker

Member
Joined
Feb 11, 2009
Messages
766
Location
suffolk,virginia
YouTube
Visit Channel
im not color neutral and i use ortega, well i am part if you count yellow or white. it takes me about 5 moves to get one face, and im not sure about guimond id say almost the same
 

Lt-UnReaL

Member
Joined
Dec 6, 2006
Messages
1,146
Location
Rochester, NY
WCA
2008CLAY01
Some numbers I found a while ago:

OFOTA 1st step ~ 1
SS 1st step ~ 1
CLL 1st step ~ 5.5
Ortega 1st step(also Full EG 1st step) ~ 3.5


Ortega ~ 18.5
OFOTA ~ 14
SS ~ 14
CLL ~ 14
CLL + adjacent EG case ~ 12.5
Full EG(CLL + adjacent & diagonal EG) ~ 12

Sorry, don't know about Guimond...and G-FASSST, who knows? (Okay, 1st step of G-FASSST ~ 1)
 
Last edited:

cuBerBruce

Member
Joined
Oct 8, 2006
Messages
914
Location
Malden, MA, USA
WCA
2006NORS01
YouTube
Visit Channel
For a face, it takes 2 moves usually

I doubt it's that low. May a face containing opposite colors, but not a single-color face (Ortega method).

and for the guimod first step takes about 1.

You must be thinking of what I call "step 0" and step 0 takes close to zero moves on average. What I think of as step 1 certainly takes over 3 moves on average.

EDIT:
I once wrote a program to calculate the number of moves needed for Guimond "step 0" for all 2x2x2 positions (color neutral). 3097152 positions required no moves. 569088 positions required 1 move. 7776 positions required 2 moves. 144 positions required 3 moves. This works out to an average of approximately 0.159 moves.

I note that this analysis makes the assumption of always performing step 0, even if the corners are already all oriented. In reality, if you had all corners oriented, you would just skip step 0 & 1, rather than making make 3 moves to complete step 0 (and then another 3 moves to complete step 1).
 
Last edited:

Lucas Garron

Administrator
Joined
Jul 6, 2007
Messages
3,718
Location
California
WCA
2006GARR01
YouTube
Visit Channel
I'm pretty sure I haven't seen the suggestion before, but I don't wanna make a new thread.

Has anyone considered the following variation/simplification of EG before?

solved case bottom layer: CLL
adj case bottom layer: adj alg
opp case bottom layer: R2 F2 R2 + CLL
 

TMOY

Member
Joined
Jun 29, 2008
Messages
1,802
WCA
2008COUR01
You must be thinking of what I call "step 0" and step 0 takes close to zero moves on average. What I think of as step 1 certainly takes over 3 moves on average.

I tried something like 20-30 step 1 solves of (my own slightly modified version of) Guimond.
Got one 2-moves solve, two 3s, two 5s, two 6s and all the rest were 4s, which makes an average slightly above 4 moves.
 

Lt-UnReaL

Member
Joined
Dec 6, 2006
Messages
1,146
Location
Rochester, NY
WCA
2008CLAY01
Ortega ~ 18.5
OFOTA ~ 14
SS ~ 14
CLL ~ 14
CLL + adjacent EG case ~ 12.5
Full EG(CLL + adjacent & diagonal EG) ~ 12

What really.

Yes, really.

I'm just going to assume that you meant to say, "Not really", because that's what it sounds like. If you think the move count I provided for step 1 for all of those methods is accurate, then the move count I provided for all steps for all of those methods must be accurate. All I did was take the first step and add the average move count it takes for each algorithm needed afterward, and added 0.75 to the total for AUF (added 1.00 to Ortega because it needs 2 separate algorithms after step 1, but lots of them have easy mirrors).
 
Last edited:

James Kobel

Member
Joined
Dec 13, 2008
Messages
139
Location
:noitacoL
WCA
2008Kobe01
YouTube
Visit Channel
For a face, it takes 2 moves usually

I doubt it's that low. May a face containing opposite colors, but not a single-color face (Ortega method).

and for the guimod first step takes about 1.

You must be thinking of what I call "step 0" and step 0 takes close to zero moves on average. What I think of as step 1 certainly takes over 3 moves on average.

Yes, I was talking about a face of opposite colors. And is your step zero where you get 3 corners oriented?
 

cuBerBruce

Member
Joined
Oct 8, 2006
Messages
914
Location
Malden, MA, USA
WCA
2006NORS01
YouTube
Visit Channel
For a face, it takes 2 moves usually

I doubt it's that low. May a face containing opposite colors, but not a single-color face (Ortega method).

and for the guimod first step takes about 1.

You must be thinking of what I call "step 0" and step 0 takes close to zero moves on average. What I think of as step 1 certainly takes over 3 moves on average.

Yes, I was talking about a face of opposite colors. And is your step zero where you get 3 corners oriented?

Ok, but one face of opposite colors isn't applicable for either Guimond or Ortega methods.

More precisely, step 0 gets 3 oriented corners and 1 mis-oriented corner in one layer.
 

DavidWoner

The Punchmaster
Joined
May 7, 2008
Messages
3,936
Location
Kansas City, MO, USA
WCA
2008WONE01
YouTube
Visit Channel
I'm pretty sure I haven't seen the suggestion before, but I don't wanna make a new thread.

Has anyone considered the following variation/simplification of EG before?

solved case bottom layer: CLL
adj case bottom layer: adj alg
opp case bottom layer: R2 F2 R2 + CLL

yes, people who are too lazy to learn the rest of EG are doing this right now.
 

cuBerBruce

Member
Joined
Oct 8, 2006
Messages
914
Location
Malden, MA, USA
WCA
2006NORS01
YouTube
Visit Channel
I realize I have previously analyzed the case of making a face of opposite colors. The worst case positions required 3 moves, and the average was approximately 1.0294 moves.

I have modified my code to also do the analysis for one face of one color, and for two faces of two opposite colors. The worst case for Ortega step 1 is 5 moves, not 4. However, over 99.95% of cases do not require more than 4 moves.

Results of my analyses are below:

Code:
Goal: one face of opposite colors

distance  positions
    0      699984
    1     2189088
    2      762048
    3       23040

Average distance = 1.0294


Goal: one face of a single color

distance  positions
    0        22654
    1       132828
    2       626354
    3      2057908
    4       832588
    5         1828

Average distance = 2.966


Goal: two opposite faces of two opposite colors

distance  positions
    0        14832
    1        29376
    2       175392
    3       851040
    4      2066688
    5       535680
    6         1152

Average distance = 3.779

Note, that if you strictly follow Guimond step 0 + step 1, the average move count will be higher than 3.779, since the above table is for the optimal number of moves to reach the goal of step 1 from the initial state.
 
Joined
Apr 29, 2006
Messages
1,802
Can you do an average step 1 for SS? (the 3/4 of a single-color face step) I'm wondering if there are any length 3 positions.
 

cuBerBruce

Member
Joined
Oct 8, 2006
Messages
914
Location
Malden, MA, USA
WCA
2006NORS01
YouTube
Visit Channel
Can you do an average step 1 for SS? (the 3/4 of a single-color face step) I'm wondering if there are any length 3 positions.

OK, here are the results I get.

Code:
Goal: 3 or more stickers of the same color on at least one face.

distance  positions
    0      1075254
    1      2149200
    2       447630
    3         2076

Average distance = 0.830

Goal: Exactly 3 stickers of the same color on at least one face.

distance  positions
    0      1060856
    1      2140980
    2       470142
    3         2182

Average distance = 0.840
An example of a position that requires three moves to get at least three stickers of the same color on a face is given by the following scramble:

R' F' U F' U F2 U R' F U'
 
Joined
Apr 29, 2006
Messages
1,802
Can you do an average step 1 for SS? (the 3/4 of a single-color face step) I'm wondering if there are any length 3 positions.

OK, here are the results I get.

Code:
Goal: 3 or more stickers of the same color on at least one face.

distance  positions
    0      1075254
    1      2149200
    2       447630
    3         2076

Average distance = 0.830

Goal: Exactly 3 stickers of the same color on at least one face.

distance  positions
    0      1060856
    1      2140980
    2       470142
    3         2182

Average distance = 0.840
An example of a position that requires three moves to get at least three stickers of the same color on a face is given by the following scramble:

R' F' U F' U F2 U R' F U'

Interestingly enough, one of the positions that go from distance 0 to 3 between the two sets is the solved position. :p
 
Joined
Sep 21, 2010
Messages
13
Location
Poznan, Poland
WCA
2006ROBA01
I want to share some stats I've calculated for first step in different 2x2 methods. The values already calculated in this topic are correct according to my independent tests. Here I want to paste the first step for CLL stats. Full report on other methods is on my website here:
http://2x2.great-site.net/stats.html.

CLL first step - average distance 4.028
DistancePositionsProbability
038140.104%
1225300.613%
21301053.541%
365137117.728%
4178788448.661%
5106115228.882%
6172960.471%
780.0002%


On http://2x2.great-site.net/stats.html there are also all scrambles to longest cases for first steps. For example:
 
Last edited:
Top