Sakarie
Veteran
There are a lot of people that knows BH/commutators for edges and corners now, which is great! At least for me, I thought that that would be the final method-destination,and that I wouldn't need to learn another algorithm after that. Now I know I'm wrong.
What I want to do is to take every single three-cycle, and find the speed-optimal algorithm/-s for it! How great wouldn't that be?
I obviously can't do it alone, but is anyone else interested? The best way is using the wiki, and creating something like "Cycle UF->UR" and then list all 20 possible ends to that cycle, and everyone could submit their fastest algorithm/-s for 3x3.
Everyone not using the same buffer would be a problem, but since i think that UF is the most usual, we could start there, and the continue with UR or something. Since edges have a lot of more possibilities, I'd say that's more useful.
What I want to do is to take every single three-cycle, and find the speed-optimal algorithm/-s for it! How great wouldn't that be?
I obviously can't do it alone, but is anyone else interested? The best way is using the wiki, and creating something like "Cycle UF->UR" and then list all 20 possible ends to that cycle, and everyone could submit their fastest algorithm/-s for 3x3.
Everyone not using the same buffer would be a problem, but since i think that UF is the most usual, we could start there, and the continue with UR or something. Since edges have a lot of more possibilities, I'd say that's more useful.