| American Checker Federation |
Website Links For English |
Information AboutAmerican Checker Federation |
| CATEGORIES ABOUT ENGLISH DRAUGHTS | |
| draughts | |
| national toy hall of fame | |
|
RULES As in all draughts variants, English draughts is played by two people, on opposite sides of a playing board, alternating moves. One player has dark pieces, and the other has light pieces. Pieces move diagonally and pieces of the opponent are captured by jumping over them. The rules of this variant of draughts are:
In tournament English draughts, 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 the1950s. Before 1900, championships were played without restriction: this style is called go-as-you-please (GAYP). One rule of long standing that has fallen out of favor is the " Huffing " rule. In this variation, jumping is not mandatory, but a piece that could have jumped, but failed to do so, may be taken — or "huffed" — by the opposing player at the beginning of his or her next turn. After huffing the offending piece, the opponent then takes his or her turn as normal. Huffing has been abolished by both the American Checker Federation and the English Draughts Association. Three common misinterpretations of the rules are,
COMPUTER PLAYERS The first Computer English draughts program was written by C. S. Strachey M.A., National Research Development Corporation, London, in the early 1950s. See the Proceedings of the Association for Computing Machinery Meeting, Toronto , 1952 . The second computer program 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 in 1989 by a team from University Of Alberta 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 for health reasons; he died shortly thereafter. In 1995, Chinook defended its man-machine title against Don Lafferty in a 32 game match where each had 1 win and 1 loss, and a record setting 30 draws. In 1996 Chinook won in the USA National Tournament by the widest margin ever, and was retired from play after that event. The man-machine title has not been contested since. The best computer 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. On July 2007, in an article published in at the peak of the project down to around 50 later on, the team made just 1014 calculations to search from the initial position to a database of positions with at most 10 pieces.http://www.newscientisttech.com/article/dn12296-checkers-solved-after COMPUTATIONAL COMPLEXITY The number of legal positions in English draughts is estimated to be 1020, and it has a Game-tree Complexity of approximately 1031. By comparison, chess is estimated to have 1040 legal positions. When draughts 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 . The July 2007 announcement by Chinook 's team stating that the game had been Solved must be understood in the sense that, with perfect play on both sides, the game will always finish with a draw. Yet, not all positions that could result from imperfect play have been analyzed. http://www.sciencemag.org/cgi/content/abstract/1144079 REFERENCES SEE ALSO EXTERNAL LINKS |
|
|