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.
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:
