The Great Game of Checkers
In Combinatorial Games
1. What is checkers?
The very earliest form of checkers comes from the Chinese around the 15th century. Within the development of technology, computers were being programmed to play games, such as checkers.
A bit of focus is going to be placed on
the history of computer game simulations and programs.
First of all, state-space complexity refers to the different possible positions in one game. For example, all the possible positions in checkers would be called their state-space complexity. Checkers has a state-space complexity of exactly 1018.
Secondly, game tree complexity refers to all the possible winning-losing games and the sequence that they are played. On one of the previous pages we had a game tree, which explained all the possible games of Nim. If you wanted to understand a little more about the game tree and how it is used you could, read a bit about game tree complexity and what it is. Checkers has a a maximum of 1031, possible games.
Third, there is computational complexity, which refers to the limit of the complexity, and whether a game has a solution. Checkers it is a finite game, and not infinite. Therefore checkers has a limit and is solvable.
Even though checkers is solvable, it hasn't been solved. The computer program, Chinook, is the International Checkers Champion, which makes the game of checkers appear to be solved. Yet, even to this day scientists have not yet arrived at an algorithm of specific strategy to guarantee a win in the game of checkers. Chinook was only able to learn how to play by reinforced learning, or waited decisions - an advance in artificial intelligence.
Basic guidelines that might help a someone play checkers would be, to make sure you have pieces defending the back row where your opponent can become a king. Also don't give up a piece unless you can take one in return, and if possible maybe pieces. For more information on Checkers strategies you can refer to this website: http://usacheckers.com/babysteps.php