Speedcubing kid can skip last layer by learning 3915 algorithms for every case
I knew someone who had a ton of algorithms for very specific cases. So if he needed say an edge 3 cycle that did not disturb anything else he knew a ton of different edge 3 cycle for all kinds of different 3 edge combinations.<p>One day several of us were sitting around playing with our cubes, and he hit some position where none of his algorithms worked and was stuck while he tried to find a new algorithm for that position. We asked why he didn&#x27;t just use a conjugate of one of his other algorithms.<p>That was how the rest of us did it. I for example knew one edge 3 cycle that didn&#x27;t disturb anything else. Call it T. If I needed any other edge 3 cycle I&#x27;d just find some transformation g such that gTg&#x27; did what I wanted, where g&#x27; is the inverse of g. gTg&#x27; is called a conjugate of T, and the set of all gTg&#x27; is called the conjugacy class of T.<p>It&#x27;s easy to find g, because it doesn&#x27;t matter how much g messes up the rest of the cube. All that matters is that it moves the 3 edges I want to permute into the position they need to be for T. Whatever else g messes up will be restored by g&#x27;.<p>He was astounded when we showed him that approach. It had never even occurred to him that such a thing was possible.<p>The funny thing is he was a math major, and had taken (and passed with a good grade) an abstract algebra course. He definitely knew about conjugates of group elements. He had just never noticed that group theory was applicable to Rubik&#x27;s Cube.