I was discussing this with Kirjava last night as well, this may only really work on odd numbered cubes. OLL Parity is easy enough to spot but unless the recognition system becomes so easy that spotting PLL Parity isn't a problem, then it could potentially be problematic.
This is a 3x3x3 method. I forgot that people do 3x3x3 LL on 4x4x4 too XD
I just used grep to list all the cases that start with Sune. Turns out, many. :D
I knew I wouldn't know exactly how I was going to organise the data until I started looking deeper at it, but I wasn't expecting this.
Probably, but I picked Sune because it's good. I'm hoping I can cover the other half with FRUR'U'F' etc. Should make any solution stupid fast.
Didn't read the whole thread, so my questions may have been answered: Are there "usable" necessary and/or sufficient conditions that determine if an arbitrary set of algs can solve any LL case in two steps? Naturally, the next question is what is the minimum number of algs necessary?
I wonder if it's possible at all to treat a certain pair of opposite edges as being the same, then you would get a solved LL or pure PLL parity. Not sure how this would affect the recog system, since nobody knows what it is yet. Not that I would ever use this system for 4x4 anyway, I'll stick with going for 1-looking OLL and PLL using various tricks to make the parity cases nicer (I've 'learned' OLL already, although I've forgotten some which I need to pick up again, and I need to finish working on PLL).
3577/4128
Using Sune, SexyHammer, FRURUF & DblFRURUF for first alg so far.
EDIT:
3853/4128
Added M'UMU2M'UM, R'U'R'FRF'UR, RUR'U'M'URU'r'
Last edited by Kirjava; 05-23-2012 at 05:24 PM.
Bookmarks