As in, when it is finished viewing the possible positions, it will be able to force a checkmate from the first move?
2007-02-12 08:59:25 · 7 answers · asked by Bob 3 in Computers & Internet ➔ Programming & Design
The number of possible moves for chess is incredibly vast. The number has a compound exponent. It is like 10 to the power of 10 to the fiftieth power. In other words, a "1" with 10 to the fiftieth zeroes after it. So, scientists say that the amount of energy needed for a computer to calculate all these moves is more than all the energy in the known universe! So with current binary computer chips, it is just not possible. You would need a radically different type of computer technology that can calculate on a vast unimaginable scale. Maybe if you could create a quantum computer that uses millions of q-bits you could do it. But this is probably several hundred years away.
2007-02-12 09:10:48 · answer #1 · answered by martin h 6 · 2⤊ 0⤋
I think it is very possible to create a computer program that can see all possible moves no matter what happens (I don't want to create it though....) But I don't think it will be able to always force a checkmate from the first move. What the other player does will always affect it. The absolute best it can hope for is to never be beaten, but always at least obtain a stalemate in the end.
2007-02-12 09:03:09 · answer #2 · answered by gman1602 3 · 0⤊ 0⤋
Uhhhh... even a human mind can't force checkmate from the first move. Big Blue came close versus Kasparov in that it could analyze after EVERY move. Really, what's the point of calculating the final play from the first when each play between changes the outcome? Isn't that the beauty of chess?
2007-02-12 09:03:30 · answer #3 · answered by Nicnac 4 · 0⤊ 0⤋
Given enough time... The problem with chess engines is calculating ahead x number of moves is a problem that gets exponentially more complex the more moves you go out. There are so many possibilites, that the computational time is staggering. But eventually, computers or grids of computers will be able to do this in pretty short order.
2007-02-12 09:02:48 · answer #4 · answered by Amanda H 6 · 0⤊ 0⤋
Certainly this is possible, there are a finite amount of positions you can have on a chessboard. This will be a long way from now, so you need not worry. And who's to say what the next move will be, or that a given position is the "right" one to take.
2007-02-12 09:03:50 · answer #5 · answered by Anonymous · 0⤊ 0⤋
Chess has limited possibilities, so it's possible to program a very intelligent software to do so.
But even that limited possibilities are thousands so it needs to process them fast and making such program needs working on it so much.
2007-02-12 09:02:48 · answer #6 · answered by Ano 4 · 0⤊ 0⤋
my guess is that it is a tie game. and i guess that we will solve for it in ~75 years if we live that long.
2007-02-12 09:03:29 · answer #7 · answered by Anonymous · 0⤊ 0⤋