Английские шашки: правила и стратегия игры.

Board game

English draughts (British English) or checkers (American English), also called straight checkers or simply draughts,When this word is used in the UK, it is usually spelt chequers (as in Chinese chequers); see further at American and British spelling differences. is a form of the strategy board game checkers (or draughts). It is played on an 8×8 checkerboard with 12 pieces per side. The pieces move and capture diagonally forward, until they reach the opposite end of the board, when they are crowned and can thereafter move and capture both backward and forward. As in all forms of draughts, English draughts is played by two opponents, alternating turns on opposite sides of the board. The pieces are traditionally black, red, or white. Enemy pieces are captured by jumping over them. The 8×8 variant of draughts was weakly solved in 2007 by a team of Canadian computer scientists led by Jonathan Schaeffer. From the standard starting position, both players can guarantee a draw with perfect play.

Though pieces are traditionally made of wood, now many are made of plastic, though other materials may be used. Pieces are typically flat and cylindrical. They are invariably split into one darker and one lighter colour. Traditionally and in tournaments, these colours are red and white, but black and red are common in the United States, as well as dark and light stained wooden pieces. The darker coloured side is commonly referred to as "Black"; the lighter coloured side, "White". There are two classes of pieces: men and kings. Men are single pieces. Kings consist of two men of the same colour, stacked one on top of the other. The bottom piece is referred to as crowned. Some sets have pieces with a crown molded, engraved or painted on one side, allowing the player to simply turn the piece over or to place the crown side up on the crowned man, further differentiating kings from men. Pieces are often manufactured with indentations to aid stacking.

Each player starts with 12 men on the dark squares of the three rows closest to that player's side (see diagram). The row closest to each player is called the kings row or crownhead. The player with the darker coloured pieces moves first. Then alternate.

If a man moves into the kings row on the opponent's side of the board, it is crowned as a king and gains the ability to move both forward and backward. If a man moves into the kings row or if it jumps into the kings row, the current move terminates; the piece is crowned as a king but cannot jump back out as in a multi jump until the next move.

A player wins by capturing all of the opponent's pieces or by leaving the opponent with no legal move. The game is a draw if neither side can force a win, or by agreement (one side offering a draw, the other accepting).

The December 1977 issue of the English Draughts Association Journal published a letter from Alan Beckerson of London who had discovered a number of complete games of twenty moves in length. These were the shortest games ever discovered and gained Alan a place in the Guinness Book of Records. He offered a £100 prize to anybody who could discover a complete game in less than twenty moves. In February 2003, Martin Bryant (author of the Colossus draughts program) published a paper on his website presenting an exhaustive analysis showing that there exist 247 games of twenty moves in length (and confirmed that this is the shortest possible game) leading (by tranposition) to 32 distinct final positions.

There is a standardised notation for recording games. All 32 reachable board squares are numbered in sequence. The numbering starts in Black's double corner (where Black has two adjacent squares). Black's squares on the first rank are numbered 1 to 4; the next rank 5 to 8, and so on. Moves are recorded as "from to", so a move from 9 to 14 would be recorded 9 14. Captures are notated with an "x" connecting the start and end squares. The game result is often abbreviated as BW/RW (Black/Red wins) or WW (White wins).

White resigned after Black's 46th move. [Event "1981 World Championship Match, Game #37"] [Black "M. Tinsley"] [White "A. Long"] [Result "1–0"] 1. 9 14 23 18 2. 14x23 27x18 3. 5 9 26 23 4. 12 16 30 26 5. 16 19 24x15 6. 10x19 23x16 7. 11x20 22 17 8. 7 11 18 15 9. 11x18 28 24 10. 20x27 32x5 11. 8 11 26 23 12. 4 8 25 22 13. 11 15 17 13 14. 8 11 21 17 15. 11 16 23 18 16. 15 19 17 14 17. 19 24 14 10 18. 6x15 18x11 19. 24 28 22 17 20. 28 32 17 14 21. 32 28 31 27 22. 16 19 27 24 23. 19 23 24 20 24. 23 26 29 25 25. 26 30 25 21 26. 30 26 14 9 27. 26 23 20 16 28. 23 18 16 12 29. 18 14 11 8 30. 28 24 8 4 31. 24 19 4 8 32. 19 16 9 6 33. 1x10 5 1 34. 10 15 1 6 35. 2x9 13x6 36. 16 11 8 4 37. 15 18 6 1 38. 18 22 1 6 39. 22 26 6 1 40. 26 30 1 6 41. 30 26 6 1 42. 26 22 1 6 43. 22 18 6 1 44. 14 9 1 5 45. 9 6 21 17 46. 18 22 BW

The men's World Championship in English draughts dates to the 1840s, predating the men's Draughts World Championship, the championship for men in International draughts, by several decades. Noted world champions include Andrew Anderson, James Wyllie, Robert Martins, Robert D. Yates, James Ferrie, Alfred Jordan, Newell W. Banks, Robert Stewart, Asa Long, Walter Hellman, Marion Tinsley, Derek Oldbury, Ron King, Michele Borghetti, Alex Moiseyev, Lubablo Kondlo, Sergio Scarpetta, Patricia Breen, and Amangul Durdyyeva. Championships are held in GAYP (Go As You Please) and 3 Move versions. From 1840 to 1994, the men's winners were from Scotland, England, and the United States. From 1994 to 2023, the men's winners were from the United States, Barbados, South Africa and Italy. The woman's championship started in 1993. As of 2022, the women's winners have been from Ireland, Turkmenistan, and Ukraine. The European Cup has been held since 2013; the World Cup, since 2015.

The first English draughts computer program was written by Christopher Strachey, M. A. at the National Physical Laboratory (NPL), London. Strachey finished the programme, written in his spare time, in February 1951. It ran for the first time on the NPL's Pilot ACE computer on 30 July 1951. He soon modified the programme to run on the Manchester Mark 1 computer. 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. In November 1983, the Science Museum Oklahoma (then called the Omniplex) unveiled a new exhibit: Lefty the Checker Playing Robot. Programmed by Scott M Savage, Lefty used an Armdroid robotic arm by Colne Robotics and was powered by a 6502 processor with a combination of BASIC and Assembly code to interactively play a round of checkers with visitors. Originally, the program was deliberately simple so that the average visitor could potentially win, but over time was improved. The improvements proved to be frustrating for the visitors, so the original code was reimplemented. In the 1990s, the strongest program was Chinook, written in 1989 by a team from the University of Alberta led by Jonathan Schaeffer. Marion Tinsley, world champion from 1955–1962 and from 1975–1991, won a match against the machine in 1992. In 1994, Tinsley 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 thirty two game match. The final score was 1–0 with 31 draws for Chinook over Don Lafferty. In 1996 Chinook won in the U. S. National Tournament by the widest margin ever, and was retired from play after that event. The man machine title has not been contested since. In July 2007, in an article published in Science Magazine, Chinook's developers announced that the program had been improved to the point where it could not lose a game. If no mistakes were made by either player, the game would always end in a draw. After eighteen years, they have computationally proven a weak solution to the game of checkers. Using between two hundred desktop computers at the peak of the project and around fifty later on, the team made 1014 calculations to search from the initial position to a database of positions with at most ten pieces. However, the solution is only for the initial position rather than for all 156 accepted random 3 move openings of tournament play.

The number of possible positions in English draughts is 500,995,484,682,338,672,639 and it has a game tree complexity of approximately 1040. By comparison, chess is estimated to have between 1043 and 1050 legal positions. When draughts is generalized so that it can be played on an m×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. However, not all positions that could result from imperfect play have been analysed. Some top draughts programs are Chinook, and KingsRow.