• Welcome to SpeedSolving.com — the world’s largest puzzle community!

    You’re currently browsing as a guest, which means you have limited access to discussions, resources, member profiles, and community features.

    Join 50,000+ cubers and puzzle enthusiasts from around the world to ask questions, share solves, improve faster, and be part of the community.

    Registration is free, fast, and easy — create your account today.

    Already a member? Log in here to hide this message and start participating.

Algorithms for WVCP

bilde

Member
Joined
Jul 9, 2015
Messages
14
Hello,

Solving winter variation + corner permutation at the same time has been proposed a lot, but I've never seen a collection with algorithms for the entire set before, so I've generated them all. Some of the algorithms are pretty nice, while others are rather nasty. I do however believe that a lot of these cases can be improved upon, because I was really lazy while generating some of these, as I'm not really interested in learning all the algorithms myself.

I don't think this method is really good, however I think it's a good idea to learn maybe two different algorithms for each WV case so that you can for example avoid diagonal swaps. Personally I only know a couple cases, and I basically only use som of them to force LL skips every now and then.

https://docs.google.com/spreadsheets/d/1w_ZdrQP_IRK8p9MirpP0xKXu1j4k2pn24UUFPuFFtHw/edit?usp=sharing

Feel free to suggest algorithms or other improvements, and feel free to discuss the "method" here. Personally, I don't think it's going to be that fast, but it's interesting for sure, and may have some applications.

Edit: Please not there may be mistakes in this document, I haven't thoroughly checked all the cases, there might be duplicates and such, but they should be correct though.
 
Last edited:
You finished! :D

I think it'll be interesting to see how widely some of these get used. I can see quite a few ZZ users learning possibly 2-3 algs per case, especially those who use WV already rather than COLL. This could be great for ZZ OH as well, though we might possibly have to have a new set of algs generated for that.
 
After performing R U' R' U repeatedly, I noticed that it will always come back to certain cases. Does anyone have a list of cases that cycle through each other for that? i.e: the first case on the list, if you perform R U' R' U, you get another case, if you do it again, you get another case. for that case, there are 6 possibe cases that cancel into that first one. How many are there that will cancel into each other? In theory, you could spam R U' R' U to bring it to a case you know, reducing the alg count signifigantly.
 
After performing R U' R' U repeatedly, I noticed that it will always come back to certain cases. Does anyone have a list of cases that cycle through each other for that? i.e: the first case on the list, if you perform R U' R' U, you get another case, if you do it again, you get another case. for that case, there are 6 possibe cases that cancel into that first one. How many are there that will cancel into each other? In theory, you could spam R U' R' U to bring it to a case you know, reducing the alg count signifigantly.

First, any sequence of moves including a nop will always cycle back to a solved cube. The amount of times you have to execute the sequence is less than or equal to 1260.

Now let's take a look at your proposal. Doing a two gen sequence to cycle cases will retain the same cp. This brings the cases for this cycling step down to 27 cases, WV itself.

CO Cycles
1 > 4 > 21 > 25 > 26 > 13
2 > 7 > 27 > 24 > 8 > 17
3 > 15 > 11 > 10 > 20 > 16
5 > 14 > 22
6 > 9 > 18 > 12 > 23 > 19

Interesting how the 5, 14, 22 cycle is one R U' R' U / it's inverse off.

This mean we have 6 distinct co cycles and 6 corner permutarions. That means with your idea you would only need to learn 36 algs.the only problem is you may a 4 * 3 = 12 move long intro to your alg.
 
Last edited:
I've clicked on the link but the images do not appear correctly. Any idea how to view the images?
 
Back
Top