View Single Post
  #7  
Old 11-21-2007, 06:57 AM
sixhigh sixhigh is offline
Senior Member
 
Join Date: Oct 2005
Location: Highway 61
Posts: 1,778
Default Re: Inevitable mathematical solving of chess, and Limit / NL hold\'em

[ QUOTE ]
They have the formulas, just not the processing power.

[/ QUOTE ]

I guess you underestimate the complexity of chess. There are at least 10^120 possible games that can be played and there are roughly 10^50 possible positions. Even if we assume that by applying algorithms we can reduce those numbers to 10^60 and 10^25 it will remain unsolvable for a pretty long time.
Let's assume a computer this day can solve 10^8 different possible games within one second. I guess this number is way too big, but let's stick with it. Now we can apply Moore's law which states that the performance of computers doubles every 18 months. Then after 219 years a computer will be able to solve 10^52 different possible games within a second, meaning it will take 3 years to solve all 10^60 possibilities.

Those are rough numbers, underestimating the complexity of chess and overestimating the capabilities of computers - but we get the picture: At least two centuries until a complete solution for chess.
Reply With Quote