I *think* Blah got it wrong regarding no. of cases.
In Fridrich LS, there are 42 cases including LS skip (just counting cases from
here). Of these, 12 (inc solved LS) have the corner permuted and therefore 8 CO cases (so 12*8). The rest have 27 possible COs (27*30).
Therefore the total no. of COLS cases = (12*8 + 27*30) = 906
Using mirrors, we can reduce this to (6*8), and (16*27) = 480
Regarding ZZ-c:
We forgot to include the fact that there are far fewer LS cases because of EOLine.
LS cases with corner permuted and edge oriented: 6 (inc solved LS)
LS cases with edge oriented not inc. above: 15
Therefore the total no. of algorithms for ZZ-c = (6*8 + 15*27) = 453
Using mirrors, we can reduce this to (5*8 + 14*27) = 418
Even if somebody already knew CLS, WV & SV and was using ZZ, you would still have twice as many (*27) cases to learn, and just over twice as many (*8) cases to learn.
That's a lot.
I *think* that is right, if this is wrong, feel free to correct me.