• 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!

Curvy copter 2-look L4C algorithms(move optimal!)

Would you support curvy copter as an event?

  • Yes

    Votes: 22 56.4%
  • No

    Votes: 4 10.3%
  • After better hardware / solutions exist

    Votes: 13 33.3%

  • Total voters
    39

Wish Lin

Member
Joined
Jun 18, 2019
Messages
673
Location
Taipei, Taiwan
WCA
2018LINW02
One of the helper files for my solver has optimal solutions for each of the 419904 cases for after F2L is solved. These are just two of them. The file was made with a simple BFS from the solved position.

P.S. I cannot guarantee that they are actually move optimal, just that they are move optimal under the restriction that only the U edges are used. I doubt there are any better ways with the other edges.
How can I use this function? I am working on CC COLL now. Thanks!

Btw, After I start your program, it spits out 11 scrambles and exited. Is that normal?
 
Joined
Oct 17, 2017
Messages
194
Location
Here
WCA
2018OLSE04
How can I use this function? I am working on CC COLL now. Thanks!

Btw, After I start your program, it spits out 11 scrambles and exited. Is that normal?
The scrambles are numbered 0-11 because I was too lazy to add a +1 in the code.

To use that file, either write some code to use the file or feed the position you want solved into the solver. Both of these will require you to be able to edit the code.
 

Wish Lin

Member
Joined
Jun 18, 2019
Messages
673
Location
Taipei, Taiwan
WCA
2018LINW02
The scrambles are numbered 0-11 because I was too lazy to add a +1 in the code.

To use that file, either write some code to use the file or feed the position you want solved into the solver. Both of these will require you to be able to edit the code.
Uh, where is the place I can input the position? If I am right, starting for line 179 is the solver, BUT I am not sure where to input it. Sorry that I am not that familiar with python.
 
Last edited:

Wish Lin

Member
Joined
Jun 18, 2019
Messages
673
Location
Taipei, Taiwan
WCA
2018LINW02
Using the tables whatshisbucket generated, I've put together a list of algs for l4c. I currently have it up at https://superphluous.github.io/curvycopterl4c.html.
I didn't account for symmetry in the program (only went through once manually looking for duplicates) so there might still be a few duplicate cases listed.
Woah! Nice work! How did you use his program? I have trouble using it.
 
Joined
Oct 17, 2017
Messages
194
Location
Here
WCA
2018OLSE04
Uh, where is the place I can input the position? If I am right, starting for line 179 is the solver, BUT I am not sure where to input it. Sorry that I am not that familiar with python.
The first block of code after line 179 generates a random position. If you want to fix the position, just put something below that block defining "start" to be whatever position you want.
Of course it would be faster if you just ran the following code instead:
Python:
def encode4(pos):

    code=0

    for i in range(4):

        code+=pos[3]*5**i

    code*=256

    for i in range(4):

        code+=pos[1]*4**i

    code*=81

    for i in range(4):

        code+=pos[2]*3**i

    code*=16

    for i in range(4):

        code+=pos[0]*2**i

    return code

f=open("phase4.txt")

i=0

phase4={}

for line in f:

    if i==0:

        curr=int(line)

    else:

        make=line.split()

        phase4[curr]=make

    i=1-i

f.close()

pos=[[0,0,0,0,0,0,0,0,0,0,0,0],[0,1,2,3,4,5,6,7],[1,1,1,0,0,0,0,0],[0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5]]

print(" ".join(phase4[encode4(pos)]))
The above would print the sequence that solves pure sune; just change pos to whatever position you want to solve.
 

Wish Lin

Member
Joined
Jun 18, 2019
Messages
673
Location
Taipei, Taiwan
WCA
2018LINW02
The first block of code after line 179 generates a random position. If you want to fix the position, just put something below that block defining "start" to be whatever position you want.
Of course it would be faster if you just ran the following code instead:
Python:
def encode4(pos):

    code=0

    for i in range(4):

        code+=pos[3]*5**i

    code*=256

    for i in range(4):

        code+=pos[1]*4**i

    code*=81

    for i in range(4):

        code+=pos[2]*3**i

    code*=16

    for i in range(4):

        code+=pos[0]*2**i

    return code

f=open("phase4.txt")

i=0

phase4={}

for line in f:

    if i==0:

        curr=int(line)

    else:

        make=line.split()

        phase4[curr]=make

    i=1-i

f.close()

pos=[[0,0,0,0,0,0,0,0,0,0,0,0],[0,1,2,3,4,5,6,7],[1,1,1,0,0,0,0,0],[0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5]]

print(" ".join(phase4[encode4(pos)]))
The above would print the sequence that solves pure sune; just change pos to whatever position you want to solve.
Thanks for the info!
 

Wish Lin

Member
Joined
Jun 18, 2019
Messages
673
Location
Taipei, Taiwan
WCA
2018LINW02
A small program I made to test these L4C algs in GelatinBrain quickly:
C++:
#include<iostream>
#include<iomanip>
using namespace std;
char in;
bool state = true;
int main(){
    for(int i = 0;state != false;i++){
        in = cin.get();
        cout<<"/*"<<setfill('0')<<setw(6)<<i<<"*/U"<<in<<",\n";
        if(cin.get() == EOF)
        state = false;
    }
return 0;
}
Just paste the pure F,R,B,L notationed algs in it and it will turn it into GelatinBrain notation.
 

TheDubDubJr

Cupcake
Joined
Mar 14, 2012
Messages
497
Location
Minneapolis, MN
WCA
2011WELC01
YouTube
Visit Channel
Using the tables whatshisbucket generated, I've put together a list of algs for l4c. I currently have it up at https://superphluous.github.io/curvycopterl4c.html.
I didn't account for symmetry in the program (only went through once manually looking for duplicates) so there might still be a few duplicate cases listed.

I see the site no longer works. Do you know if you would be able to get it back up again?
 

Wish Lin

Member
Joined
Jun 18, 2019
Messages
673
Location
Taipei, Taiwan
WCA
2018LINW02

hi870169

Member
Joined
Feb 11, 2020
Messages
11
Hello, I am confused about the algorithms. I use the one look ones, and I can't avoid getting a X perm. Is it my problem? I can't figure it out. Help.:)
 
Top