قالب وردپرس درنا توس
Home / Tips and Tricks / Which classic board game has been solved for all possible results?

Which classic board game has been solved for all possible results?



  Schaefer vs. Tinsley in a 1990s checker match
Afflictor

Answer: Checkers

When it comes to classic board games like Chess, Go, Backgammon and Checkers, there are a number of potential moves the game has. For example, on a standard standard size go-board, there are 1

0 ^ 48 moves, which makes the game's solution out of range of our current computer capabilities.

Only one of these cerebral and classic games has been completely solved: Checkers. In 2007, computer scientist Jonathan Schaeffer completed his 18-year quest to solve all sorts of movements in the controllers' game – 500 billion billion or 5 * 10 ^ 20 possible legal positions. Unlike IBM's Deep Blue computer system, which uses enormous amounts of computational power to analyze future moves (since the chessboard can be completely solved, it is still unattainable), the Chinook Shaeffer system has been slowly evolving through the positions and potential over the years Endgames until it had learned almost every possible move in the game.

Originally, the goal was simply to design a computer that's very well designed for Checkers. Chinook was doing quite well for that purpose. In the 1990s, it was constantly beating top players, and eventually it came up against Marion Tinsley (not just the then world champion, but an absolutely legendary player who dominated the checker game for forty years in a row). Chinook was pretty good against Tinsley, but the series of seven games ended in a draw. Shortly thereafter, Tinsely became ill and passed, leaving a huge gap in the lady's world and in Schaeffer's plans to develop a computer that could beat the best player in the world.

Without conquering a suitable Megamaster The only thing left to do was Schaeffer: to solve the game and effectively defeat the queen herself. In an interview with The Atlantic in 2017, he said:

From the end of the Tinsley saga in '94-'95 to 2007, I obsessively worked on building a perfect Checker program. The reason was simple: I wanted to get rid of the ghost of Marion Tinsley. People said to me, "You could never beat Tinsley because he was perfect." Yes, we beat Tinsley because he was almost perfect. But my computer program is perfect.

Schaeffer's program is indeed perfect. When played against itself, both sides play perfectly and each game ends in a draw.


Source link