A "perfect" chess game (perfect by both players, or else it's not really perfect) would have to be a draw, and I don't see how you could argue otherwise. White having an extra move wouldn't matter; that extra move isn't enough to force a win, even with perfect play
dark_j3sus, Not really, there's nothing magic about chess. If it was solved then you'd be able to make perfect moves just as you can make perfect moves now when there are 6 pieces (thanks Loomis) or less on the board by using a endgame table base.
1315checkm8, this is likely but not necesarilly true.
Then, it's not perfect game if one side doesn't play a bad game. A perfect tic-tac-toe game, always end in draw. It just does. If you knew how to play a perfect game, the fact is you probably stop playing chess because there is nothing that you can do to get better (like tic-tac-toe, it's very hollow ending). The end result is the same and it will be forever.
Chess is all about the journey, not the destination (which is a perfect game).
dark_j3sus, The only way I can think of is generating 32-men endgame tables (and all lesser ones) wich of course isn't practically possible but when we're talking about a perfect game we're talking about (or at least I am) this as a theoretical game. As loomis mentioned generating these would probably take more time than the universe has existed (not to speak of where to store this data). So this perfect game is of course only theoretical.
In Go, its techically impossible. But some do end in ties because the judge of the game draw because he believes the two player played at the same level. Rare yes, but it happens.
I bet you write bad poetry in your spare time.
In Go, its techically impossible. But some do end in ties because the judge of the game draw because he believes the two player played at the same level. Rare yes, but it happens.
in go white have point compensation for move second wich its a value X.5 due that ".5" there is no draw
More memory is not going to cut it, because the amount of chessboards that are possible is more than the number of atoms matter that is currently thought to be in the universe (and we can't make it smaller by compresstion). To do some thing like this we need a way to like board to a close mathical function (The proof would be ugly).
AS for math geeks who love pi replace Chess player, it is possible if there was a mathical function.
In Go, its techically impossible. But some do end in ties because the judge of the game draw because he believes the two player played at the same level. Rare yes, but it happens.
in go white have point compensation for move second wich its a value X.5 due that ".5" there is no draw
yes that is why it techically impossible. But at high tournament level they have people who judge the game, and they can say its a draw. It's very rare. (plus you can offer and accept draws but I don't think I ever seen someone do that)
yes that is why it techically impossible. But at high tournament level they have people who judge the game, and they can say its a draw. It's very rare. (plus you can offer and accept draws but I don't think I ever seen someone do that)
if you say so i belive you heh i have never seen any high rated players in go.
i would bet that the secret of chess will be discovered in the next 50 years.
when i say that, i mean that the best possible move will be found for every situation.
It is also more than likely that this position is a draw.
If the average game takes around 30 turns, and there are a given 1-10 good moves a turn, that's a big number. approximately 5^30. Just wait, computers will get there. It might take a while, as my computer has trouble with 10 moves forced mate, yet alone an entire game.
I'm pretty sure that someone could play the perfect game right now. Whip out their supercomputer and have it run fritz or shredder for days on end.
i would bet that the secret of chess will be discovered in the next 50 years.
when i say that, i mean that the best possible move will be found for every situation.
It is also more than likely that this position is a draw.
If the average game takes around 30 turns, and there are a given 1-10 good moves a turn, that's a big number. approximately 5^30. Just wait, computers will get there. It might take a while, as my computer has trouble with 10 moves forced mate, yet alone an entire game.
I'm pretty sure that someone could play the perfect game right now. Whip out their supercomputer and have it run fritz or shredder for days on end.
You greattly underestimate the problem. Here a site show in number of chess games vs the matter we currently think is in the universe .
http://en.wikipedia.org/wiki/Shannon_number
If we ever want to solve this problem, we need stronger software, because there no way to build a supercomputer strong enough to brute force it.
Can't happen....you can't have a perfect offense and defense too. There has to be a flaw in one side in order for the other side to accomplish anything. It wouldn't draw, it would stalemate.
Neither side could win because while one side would always have the *perfect* attacks, the other side would have the *perfect* defenses to counter all of the *perfect* attacks, thus making those *perfect* attack, imperfect.