Recent Articles



































Checkers



         


Cocker Spaniel after whom Richard Nixon's renowned Checkers speech was named. Checkers is also the name of an American fast-food restaurant chain; see Checkers Drive-In.

This article is also not to be confused with Chequers, the official country residence of the Prime Minister of the United Kingdom

Checkers (or draughts) is a group of board games which involve the "jumping" of enemy pieces.

[Top]

History

The game of draughts is thought to have originated in around 1100 AD, probably in southern France. It is thought the inventor created this board game by using a Chessboard, with the rules of Alquerque.

The pieces were originally called "ferses", the name that was given to chess queens at the time, and the draught ferses moved in the same way as the queen did in chess. Note however at this time, the queen was able only to move one square per turn. The one new move this game introduced was the ability to jump over opponent's pieces and take them. At this time the game was known as "Fierges".

In Philip Mouskat's "Chronique" (1243) is a reference to the use of "Kings" suggesting that the ability to promote a piece existed at this time.

When in Chess "ferses" were renamed to "Dame", the same occurred in Draughts, the games name also changed to "Dames". While it is thought that the original Fierges had a compulsory capture rule, there is no evidence that this rule existed in Dames. This rule was however reintroduced in France in the year 1535. Modern play includes this rule.

The name "Checkers" originated with European settlers in the United States.

[Top]

Rules

Checkers (also known as Draughts) is played by two people, on opposite sides of a playing board, alternating moves.

The rules are:

In tournament checkers, a variation called three-move restriction is preferred. The first three moves are drawn at random from a set of accepted openings. Two games are played with the chosen opening, each player having a turn at either side. This tends to reduce the number of draws and can make for more exciting matches. Three-move restriction has been played in the United States championship since 1934. A two-move restriction was used from 1900 until 1934 in the United States and in the British Isles until the 1950s. Before 1900, championships were played without restriction: this style is called go-as-you-please.

[Top]

Computer Players

The first computer player of checkers was written in 1956 by Arthur Samuel, a researcher from IBM. Other than it being one of the most complicated game playing programs written at the time, it is also well known for being one of the first adaptive programs. It learned by playing games against modified versions of itself, with the victorious versions surviving. Samuel's program was far from mastering the game, although one win against a blind checkers master gave the general public the impression that it was very good. Samuel didn't mention his opponent was blind!

In the 1990s, the strongest program was Chinook written by a team led by Jonathan Schaeffer. Marion Tinsley, world champion from 1955-1962 and 1975-1991, won a match against the machine in 1992. In 1994, he had to resign in the middle of an even match because of health reasons; he died shortly thereafter. Chinook defended its man-machine title against Don Lafferty, and won the US national tournament in 1996 with a big margin. Chinook was retired after that tournament. The man-machine title was never contested again.

The best PC programs of today are stronger than the best humans, and also stronger than Chinook was at the time when it won the man-machine title. Today's PC's are much faster than the hardware Chinook ran on at the time thanks to Moore's law.

[Top]

Computational complexity

It is a common misconception that checkers has been solved. The best computers can now beat all humans, but checkers is not yet completely solved. It is generally expected that checkers will be solved by 2010.

The number of legal positions in checkers is estimated to be 1018, and it has a game-tree complexity of approximately 1031.

When checkers is generalized so that it can be played on an n-by-n board, the problem of determining if the first player has a win in a given position is EXPTIME-complete.

Recently it was anounced that the tournament opening the White Doctor had been proved to be a draw.

[Top]

Variants

[Top]

Famous Checkers Players

[Top]

See also

[Top]




  View Live Article   This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License