user3093: Mathematicians have categorized chess as a trans-computational problem.  A transcomputational problem is one in which a computer would need to exceed the size of the earth in order to have the processing power to complete the theoretical problem through brute force.  Also, to solve the game of chess means that everything would have to be decided on the first move and any subsequent deviation from the 'correct line' would result in a guaranteed loss.  It is categorically different than having an engine who can win every game. Other games have been 'solved' like checkers, where the national championship has seen the exact line of play for numerous years in a row.
Also worth noting, the expression 'transcomputational' comes from Bremermann's limit - http://en.wikipedia.org/wiki/Bremermann%27s_limit - read up if you are unfamiliar.
My question is whether or not this is an accurate diagnosis?  Does the math take into account the growing sophistication of chess engines, or even computers for that matter?  Will we ever have a chess engine that can 'solve' the game of chess without exceeding the size of the earth.  I guess to simplify my question; what is the context of this mathematical limit?

user291: 
Also, to solve the game of chess means that everything would have to
  be decided on the first move and any subsequent deviation from the
  'correct line' would result in a guaranteed loss.

Then this will never happen, even theoretically. Chess does not have that much instability. In many positions multiple moves are equally good. This is both obvious and has been proven (see tablebases).
Assuming now that you are just talking about "playing theoretically optimally" (if it is possible to win it wins, otherwise if it is possible to draw it draws), then it is certainly possible that a computer merely the size of the earth could play perfect chess, but it is exceedingly unlikely that a computer the size of the earth could prove that it was playing perfect chess. No one has been able to prove things about the state of a chess position except by, effectively, brute force (except for special cases where the situation is simple enough that you can reason logically about it, such as bishop and wrong rook pawn).
(The context of the mathematical limit is the number of possible chess positions, which has been estimated to be on the order of 10^43.)

3093: <p>Mathematicians have categorized chess as a trans-computational problem.  A transcomputational problem is one in which a computer would need to exceed the size of the earth in order to have the processing power to complete the theoretical problem through brute force.  Also, to solve the game of chess means that everything would have to be decided on the first move and any subsequent deviation from the 'correct line' would result in a guaranteed loss.  It is categorically different than having an engine who can win every game. Other games have been 'solved' like checkers, where the national championship has seen the exact line of play for numerous years in a row.</p>

<p>Also worth noting, the expression 'transcomputational' comes from Bremermann's limit - <a href="http://en.wikipedia.org/wiki/Bremermann%27s_limit" rel="nofollow">http://en.wikipedia.org/wiki/Bremermann%27s_limit</a> - read up if you are unfamiliar.</p>

<p>My question is whether or not this is an accurate diagnosis?  Does the math take into account the growing sophistication of chess engines, or even computers for that matter?  Will we ever have a chess engine that can 'solve' the game of chess without exceeding the size of the earth.  I guess to simplify my question; what is the context of this mathematical limit?</p>
 291: <blockquote>
  <p>Also, to solve the game of chess means that everything would have to
  be decided on the first move and any subsequent deviation from the
  'correct line' would result in a guaranteed loss.</p>
</blockquote>

<p>Then this will never happen, even theoretically. Chess does not have that much instability. In many positions multiple moves are equally good. This is both obvious and has been proven (see tablebases).</p>

<p>Assuming now that you are just talking about "playing theoretically optimally" (if it is possible to win it wins, otherwise if it is possible to draw it draws), then it is certainly possible that a computer merely the size of the earth could play perfect chess, but it is exceedingly unlikely that a computer the size of the earth could <em>prove</em> that it was playing perfect chess. No one has been able to prove things about the state of a chess position except by, effectively, brute force (except for special cases where the situation is simple enough that you can reason logically about it, such as bishop and wrong rook pawn).</p>

<p>(The context of the mathematical limit is the number of possible chess positions, which has been estimated to be on the order of 10^43.)</p>
