guitardude7241
Member
I saw the thread in the begginer's forum about the future of cubing. I could say Fridrich has found it's end. Well, maybe a second faster on average, but not too much(not saying it's slow, it's rather fast). But there's the methods that aren't explored by too many, such as ZZ and ZB. EJF2L has come up recently, and the masters of Roux have gotten a tad faster(obviously by practice, and practice alone). I know Jason Baum is learning ZB, and that has quite a few algorithms. I've heard talk of marking out OLL and PLL and using 1LLL. Does anybody know how many different cases there'd be for 1LLL? I've thought the averaging of sub-9.5 and lower would come by methods with lower move counts, or a knowledge of much more algorithms, or(I'd think it'd be unlikely) some super-hybrid. Has anybody come up with very efficient methods/possibly efficient methods(with work, of course) other than the ones we know?