Probabilistic estimates of the diameters of the Rubik's Cube groups

So Hirata

The diameter of the Cayley graph of the Rubik's Cube group is the fewest number of turns needed to solve the Cube from the hardest initial configuration. For the 2$\times$2$\times$…