I agree, but wanted to add some numbers: The guys proving that the most needed moves are 20 (cube20.org, I think linked already here in the thread) crunched through all possible combinations - their program solved the solution for 19 billionen start positions in about 20 seconds, calculating one solution is negligible in terms of processor time.
(solving all positions took still some 35 CPU years…)
