I could've sworn there was a statistics thread, but I can't seem to find it...
How many cases are needed to perform full reduction to 2-gen after 2x2x3 + 1 F2L Pair, leaving a 2-gen LSLL?
i.e. how many cases are needed to solve CP + EO + FD edge?
Here's what I have so far:
If we fix the FD edge at UF, there are 2^6/2 unique EO cases, and only 2 types of swaps are needed to reduce corners to 2-gen group. Yielding 64 algorithms?
How many cases are needed to perform full reduction to 2-gen after 2x2x3 + 1 F2L Pair, leaving a 2-gen LSLL?
i.e. how many cases are needed to solve CP + EO + FD edge?
Here's what I have so far:
If we fix the FD edge at UF, there are 2^6/2 unique EO cases, and only 2 types of swaps are needed to reduce corners to 2-gen group. Yielding 64 algorithms?
Last edited: