♡ 35 ( +1 | -1 ) Just wonderingI was just wondering since there is a limit to the amount of unique games (grant it that it is a very big number) if you could memorize a possible gameplay to always give you a win. If you could then chess would be changed forever. It would take a lot to memorize the layout but then you could beat even the best GM if you were to go first.
♡ 75 ( +1 | -1 ) I would say no...If you study opening theory, you will discover many positions where one side or the other has a large advantage but that with accurate play the game is a draw. It takes a huge advantage to win a game against accurate play, so I doubt there is a forced win from the first move. - Even if you get a huge advantage. There is no gurantee of a win. There are numerous stalemate tricks and perpetual check combinations. Also, there are positions where white to move wins and black to move draws. a 2 pawn advantage is not enough to win in bishops of opposite color endings. Two knights against a lone king is not enough to win. How is one going to calculate a variation that avoids all these tricks. Heck, a computer can't even do it.
♡ 46 ( +1 | -1 ) I seem to recall reading…that the total number of possible unique chess games was greater than the number of atoms in the universe. While I'm inclined to never say never, it's a safe bet that the game of chess will not be "solved" for a very long time.
On another note—I believe it is possible that, due to the proliferation of computer analysis and the use of databases in the opening, the game may evolve towards something like Fischer Random to breathe new life into the game.
♡ 81 ( +1 | -1 ) And even if"I was just wondering since there is a limit to the amount of unique games (grant it that it is a very big number) if you could memorize a possible gameplay to always give you a win."
Or draw :-)
"If you could then chess would be changed forever. It would take a lot to memorize the layout but then you could beat even the best GM if you were to go first."
Can you name a human being who can memorize chess positions faster than current supercomputers (MUCH faster, actually)? Like Honolulu pointed out, the amount of positions you'd have to memorize is greater than the amount of atoms in the universe. Let's imagine Microsoft Chess Solver 2020 manages to pull it off - poor Bill Gates can't even read the solution because he doesn't have enough money to buy the required A4s for his printer.