[b0z0]

I was looking forward to a mathematical proof of how symmetrical cases can be solved, but I was surprised to find that they basically brute-forced it with a computer. I'd learned about how much controversy that approach generated with the Four Color Theorem, but I'm impressed with how much proofs have moved forward since then.

[gamegoblin]

There are mathematical proofs which can get the bound to 22 moves, so it's just a matter of time. But now that the proof is bruteforced, there isn't too much motivation.

http://en.wikipedia.org/wiki/Optimal_solutions_for_Rubik%27s...