The Stack Overflow podcast is back! Listen to an interview with our new CEO.

We can think of the Rubik's cube Cayley graph $\Gamma=(V,E)$ with each (colored) edge $E$ being one of the Singmaster moves $\langle U,U^{2},U^{3}=U^{-1},D,D^{2},D^{3},\cdots\rangle$ and each vertex $V$ being one of the $43252003274489856000\approx 4.3e{19}$ different configurations of the $3\times 3\times 3$ cubes. The diameter of a graph is the longest ...

Only top voted, non community-wiki answers of a minimum length are eligible