Chess960 starting position
|This article needs additional citations for verification. (January 2013)|
A Chess960 starting position is one of 960 possible initial game positions in the chess variant Chess960. The special arrangement of pieces on the players' first ranks is selected randomly before play according to Chess960 rules, and can be generated either by a computer program, or using dice, coin, cards, etc.
|This article uses algebraic notation to describe chess moves.|
Starting position requirements
White pawns are placed on the second rank as in standard chess. All remaining white pieces are placed randomly on the first rank, with two restrictions:
- The bishops must be placed on opposite-color squares.
- The king must be placed on a square between the rooks.
Black's pieces are placed equal-and-opposite to White's pieces. For example, if the white king is randomly determined to start on f1, then the black king is placed on f8. (The king never starts on the a - or h -files, since this would leave no space for a rook.)
Methods for creating starting positions
There are several procedures for generating random starting positions with equal probability.
Single die method
- Roll the die and place a bishop on the black square indicated by the die, counting from the left, a through h.
- Thus, 1 indicates the first black square from the left (a1), 2 indicates the second black square (c1), 3 indicates the third (e1), and 4 the fourth (g1). Since there are no fifth or sixth positions, reroll a 5 or 6 until another number shows.
- Roll the die and place a bishop on the white square indicated.
- 1 indicates b1, 2 indicates d1, and so on. Reroll a 5 or 6.
- Roll the die and place the queen on the first empty position indicated, always skipping filled positions.
- Thus, 1 is the first (leftmost) empty square, while 6 is the sixth (rightmost) empty square.
- Roll the die and place a knight on the empty position indicated. Reroll a 6.
- Roll the die and place a knight on the empty position indicated. Reroll a 5 or 6.
This leaves three empty squares. Place the king on the middle empty square, and the rooks on the remaining two squares. Place the white and black pawns on their usual squares, and Black's first-row pieces to exactly mirror White's. (So, Black should have on a8 the same piece type White has on a1.)
The above procedure uses an average of 6.7 die rolls. Note that one of the random positions (rolled by 2–3–3–2–3 or 2–3–3–4–2) is the standard chess starting position, at which point a standard chess game ensues.
On average, the single die procedure uses 6.7 die rolls. An optimal procedure would use on average log(960)/log(6) = 3.83 die rolls. It is straightforward to reduce the average number of dice rolls to 6.2. Instead of rerolling 5s and 6s until something else comes up, reroll once and (4/36) use the following scheme:
- 5 followed by 5 subtract 4 → 1
- 5 followed by 6 subtract 4 → 2
- 6 followed by 5 subtract 2 → 3
- 6 followed by 6 subtract 2 → 4
Polyhedral dice method
Roll all the dice in one throw and place White's pieces as follows:
- Place a bishop on one of the eight squares (counting from the left, a through h ) as indicated by the octahedron (d8).
- Place the other bishop on one of the four squares of opposite color as indicated by the tetrahedron (d4).
- Place the queen on one of the remaining six squares as indicated by the cube (d6).
- Take the value of the icosahedron (d20), subtract one, divide by four, and let x = the quotient + 1, and y = the remainder + 1. Place a knight on the xth empty square. Then place the other knight on the yth remaining empty square. Or alternatively (using an additional die instead of calculations): Place the first knight according to the value of the d20 die, by counting the five empty squares and looping back to the left whenever reaching the rightmost empty square. Then with four empty squares remaining, do the same for the other knight using the dodecahedron (d12) die.
- Place the king between the rooks on the remaining three squares.
Place the white pawns and mirror the position for Black.
Coins (binary) method
Two coins (small and large) are used to randomly generate numbers with equal probability. Tails on the smaller coin counts as 0, tails on the larger coin counts as 1, and heads on either coin counts as 2. To create numbers in the range 1 through 4, toss both coins and add their values together. To create numbers in the range 1 through 3, do the same but retoss whenever 4 is the result. To create numbers in the range 1 through 2, just toss the larger coin (tails is 1, heads is 2).
There is a way of using coins and making all starting positions equally likely. It uses a third coin for which tails counts as 0, and heads counts as 4. Tossing all three coins generates the values 1 through 8 with equal probability. The method follows the piece placements used for a die. Two coins are used for the bishops as before. Then six squares are available for the queen. All three coins are tossed and retossed until a number in the range 1–6 comes up. Then five squares are available for the first knight. Now the three coins should be tossed and retossed until a number in the range 1–5 shows up. For the other knight, only a four-way choice is needed, so a single toss of two coins suffices. The average number of tosses needed for this method is 5 + 14/15.
A similar coin-tossing method uses one coin to generate all starting positions with equal probability. Toss the coin four times and record the results. If the four coin tosses are all tails, start again. Otherwise toss the coin an additional six times and record the results. Then convert the sequence into a binary number counting heads as 0, tails as 1. The resulting number is a number between 0 and 959 that can then be converted into a starting position using the Chess960 numbering scheme. For example, if the tosses are T, H, T, T, H, H, H, H, T, T this converts to the binary number 1011000011, or 707, which in the Chess960 numbering scheme is the starting position BRKQNNRB.
- Althöfer, Ingo (1998). Computerschach und Spiele (CSS) (in German) (Dieter Steinwender and Frederic Friedel). Missing or empty
- Althöfer, Ingo (March 1998). van den Herik, Jaap, ed. "LIST-3-HIRN vs. Grandmaster Yusupov". International Computer Chess Association (ICCA) (Universiteit Maastricht) 21 (1): pp. 52–60. ISSN 0920-234X.
- Hans Bodlaender (2002-05-10). "Fischer Random Chess: Manual Procedure for Generating Piece Placements". The Chess Variant Pages. Retrieved 2013-01-26.