It's possible we never will. Although we take Moore's law for granted, eventually we'll hit the natural limits of computation and storage per m^3, and solving c

It's possible we never will. Although we take Moore's law for granted, eventually we'll hit the natural limits of computation and storage per m^3, and solving chess completely may well be beyond that (but maybe not, as well). From Wikipedia (http://en.wikipedia.org/wiki/Shannon_number http://en.wikipedia.org/wiki/Shannon_number): "Allis also estimated the game-tree complexity to be at least 10^123, "based on an average branching factor of 35 and an average game length of 80". As a comparison, the number of atoms in the observable universe, to which it is often compared, is estimated to be between 4×10^79 and 10^81."