dChan
Veteran
- Joined
- Feb 28, 2007
- Messages
- 1,243
- Location
- Somewhere without clouds...
- WCA ID
- 2007CHAN06
- YouTube
- Visit Channel
Last year I had stumbled upon a page in Lucas Garron's site "garron.us" that contained PLL algorithms processed through a cube solving tool. The algorithms reduced many of the usual moves required to solve each PLL case, turning a 13 move algorithm into a 9 move algorithms as well as reducing all the others by several moves. I probably would have taken to learning all of them over to get faster times but I took a break from cubing shortly afterwards and abandoned learning them. Now that I am back and I am thinking about simple ways to reduce your solving time, I thought back to those algorithms and started thinking, "What if we all relearned PLL or even OLL with those shorter algorithms?" Would it make us faster? I would think so.
What do you guys think? Or, more importantly, has this already been thought of while I was gone? I'm sure someone else saw the page which I can no longer find.
Has anyone thought of running every F2L, OLL, and PLL case through a cube solver to see what they got?
What do you guys think? Or, more importantly, has this already been thought of while I was gone? I'm sure someone else saw the page which I can no longer find.
Has anyone thought of running every F2L, OLL, and PLL case through a cube solver to see what they got?