No code this week. I went on a hike instead.
When learning the fast method to solve the first two layers (f2l) of the Rubik’s cube, I started out with a list of all the beginning positions of the corner and edge piece and the algorithms needed to put them in position. I saw that a lot of the algorithms were related. Midway through one algorithm, I would find myself in the starting position of a different algorithm. Or multiple algorithms would have the same ending. I created a diagram to show how all the initial positions could move through the various permutations to get to the solved position so that I could see how they were all related and to help myself visualize the solutions. In the hopes that my diagram might help others, I’m posting it here.