# Solving the final layer as 270 special cases with alg combos

Here is what I believe could be the ultimate way of speed solving the final layer with oriented edges. You can get there through the Petrus method, or other means.

## Background

Counting symmetries but not inversions as the same case there are in total 270 different positions for this case. The perfect solutions for all these are well known, thanks to Bernhard Helmstetter, and average 12.08 moves.

### Why not the "perfect method"?

It is tempting to assume that the best way to speed solve this would be to learn all these algorithms. But I seriously doubt it, because...
• Memorizing 270 sequences is an enormous task.
• Learning them so well that you can do them at full speed cubing speed, is a much bigger undertaking. And one that never stops - to keep this speed you have to practice all these alg more or less daily.
• Those algorithms are optimal for number of moves, not for finger friendliness.
• Opportunity cost. Even if this can all be done, you have to spend so much time and effort on it, that you will have to spend that much less time on other aspects of speed cubing.

### Why not the usual fast method?

Traditionally, last layer methods are done in 2 or more steps, where each step is independent of the other. After each algorithm you have to check the new position to determine what algorithm from the next step to apply to it. Each such check is called a "look", so the best of these methods are known as "two look" systems. The "perfect method described above would be this idea taken to its extreme as a "one look" system.

The most successful such system is the Friedrich 2 look system, as described here. The first "look" (OLL) orients all pieces, and requires memorization of 57 algs. The second (PLL) places all pieces, using 21 algs. The average length of each step is around 10 moves [anyone know the exact numbers?], resulting in a total move count of around 20 for this approach.

### The Combo system: One look, two algorithms, "perfect enough"

Think of this as taking the best and most practical aspects of the two systems rejected above. It is a one look system, that requires learning a few dozen algorithms (of your choice), and averages 14-15 moves.

The idea is to learn only a reasonably small number of algorithms - certainly less than the 78 needed for Friedrich, and for each of the 270 distinct positions, memorize the fastest combination of two of those algs. Or to be precise, if you have 40 base algs, you will only need a combo for 230 positions.

Learning all those is still a fairly big memorization undertaking, but much smaller than memorizing 270 individual algorithms. My gut feeling number is that it's 10% of the effort. And for "muscle memory", you only need to keep 40 known fast algs up to speed, which is much easier than 270.

I think that the 2-3 more moves used compared to the perfect 12.08 is more than compensated by these factors in terms of execution speed.

## Doing it in practice

I made a web site (http://birdflu.lar5.com/) where you can easily build your own 270 "combo" method from your favorite algs. You can also make sets for all 1200+ positions with edges not oriented.

I have made the alg set I use as a starting point.

• The base algs I use are here.
• Browse all positions with it here
• Create your own combo alg set here
• Ask me how to work with this here: cube@lar5.com