[phaemon]

From a quick Google there appear to be about 10^120 possible chess games. So if you could store each game as 1 bit then:

Landauer's principle says we need at least 10^-21 Joules to change a single bit. That means we need 10^99 Joules to run through all our games. The mass-energy of the observable universe is 10^69 Joules.

Therefore, if we could convert one million trillion trillion observable universes entirely into energy, then we'd have enough to run through all our chess games on our theoretically perfect computing machine.

I'm not sure we'll get that done in the next couple of decades.

[of course, there may well be shortcuts that we can take to cut down that number a bit!]

[V-2]

There's weak and strong level of solving chess.

You don't need to know the best move in every position of every possible chess game in order to play perfectly.

Eg. playing with White it is enough for you to always know what your best move is. And once you stick to it, then 99.9999... of these possible games will NEVER occur, because that would require White making at least one non-perfect move on the way.