Finding Algorithms and Cases?

BadgerSex

Regular
Joined
Jul 23, 2008
Messages
53
I'm trying to improve corners-first by experimenting with a ZB-type method of putting the last corner or corner pair in on the D face while orienting the rest of the corners on the U face. But how can I find all of the cases that can happen for this, and how can I find the algorithms after that?
 
Cases are the same as CLS or SS.

And we've had a lot of threads asking how to find algs, with sufficient information about solvers. You'd get much more, better, and faster information by finding those. ;)
 
Cases are the same as CLS or SS.

And we've had a lot of threads asking how to find algs, with sufficient information about solvers. You'd get much more, better, and faster information by finding those. ;)

Thanks. I didn't really know what to call it, but i guess the cases still aren't quite the same because you don't have to preserve the position of most of the f2l, only corners. that means i could have simpler algorithms for it.

and your webpage is cool, although a few things are missing (links to pdf don't always work, etc.)
 
i think you shld use CLS, because i don't think you would want to stay with corners first forever :D after that you can always use CLS for normal 3x3 ha ha.

Why that?, CF is much better than most people think, a higly optimised CF can do the cube in 45 STM on average. Using 3 tps that gives 15 second averages, some cubers can do 4-5 tps...
 
i think you shld use CLS, because i don't think you would want to stay with corners first forever :D after that you can always use CLS for normal 3x3 ha ha.

Why that?, CF is much better than most people think, a higly optimised CF can do the cube in 45 STM on average. Using 3 tps that gives 15 second averages, some cubers can do 4-5 tps...
I agree. But I would rather try to optimize edges than corners, since edges are usually the slowest part of CF...
 
Back
Top