cubing/tnoodle — pull request #174 by cs0x7f (2014-08-30 14:33:07+00:00)
Title: Clock optimal solver

As there're only 18 moves in WCA notation, we can easily solve the clock by brute-force search + Gaussian Elimination.
The average length of the optimal solver is about 10.8 moves, which is 2 moves less than randomly generated moves (14 * (1 - 1/12) = 12.83).