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...