I believe that chess is solvable. But we're nowhere near figuring it out. The thing that stops our computers is the fact that a pawn can promote to any piece, which makes the possible board positions increase hugely. Most people believe chess is drawn with very best play.
Is Chess Solvable?
Sort:
When chess becomes solved, then you'l know if it's a draw or not.
In theory, yes
In practice, no
I solved tictactoe in like 2 minutes so you never loose
khpa21 wrote:
In theory, yes
In practice, no
This
Feb 25, 2015
0
#8
Chess is definitely solvable. It is a finite puzzle. There are PhD level math papers discussing in pretty complete detail how complex it is. To find the solution with standard computers we are talking a "life of the universe" amount of time. However, it is an almost perfect problem for the particular strengths of quantum computers, if we ever get one of those really working. Due to the nature of a quantum computer, if you can set one up to solve chess, it will do so instantly. That might happen in about 40 years, or never.
Tic-tac-toe you can solve on your own within 45 min. Checkers has been solved by checkers wizes, but is chess "solvable"? by solvable, I mean, once you get to the highest, HIGHEST level that man and computer can play( i dont know, maybe 5000 or something), will there always be a draw, will white always win, or will black always win?
*btw, tic-tac-toe and checkers are always draws at best play. The strange thing though is that O has no tactical possibilities, O can only defend what X's dishing out.