FACTOID # 132: Central European men don’t teach. In Hungary, the Czech Republic, and Slovakia, over 75 percent of lower secondary teachers are female.
 
 Home   Encyclopedia   Statistics   Countries A-Z   Flags   Maps   Education   Forum   FAQ   About 
 
WHAT'S NEW
RECENT ARTICLES
More Recent Articles »
 

FACTS & STATISTICS    Simple view

  1. Select countries to view: (hold down Control key and click to select several)

     

     

    Compare:

     

     

  1. Select fact or statistic: (* = graphable)

     

     

     

  2. (OPTIONAL) Compare to statistic: (both need to be graphable)

     

     

     

  3. View result as:

     

       
(OR) SEARCH ALL encyclopedia, stats & forums:   

Encyclopedia > Fischer Random Chess

Fischer Random Chess (also called Chess960, Fischerandom chess, FR chess, or FRC) is a chess variant created by Grandmaster Bobby Fischer (who was world chess champion from 1972 until 1975). It was originally announced on June 19, 1996, in Buenos Aires, Argentina. Fischer's goal was to create a chess variant in which chess creativity and talent would be more important than memorization and analysis of opening moves. His approach was to create a randomized initial chess position, which would thus make memorizing chess opening move sequences far less helpful. Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Image File history File links This image is used in the standard chess diagram template. ... Listen to this article · (info) This audio file was created from the revision dated 2005-09-05, and does not reflect subsequent edits to the article. ... A chess variant is any game derived from, related to or similar to chess in at least one respect. ... Bobby Fischer. ... The 1984 World Chess Championship was between Anatoly Karpov (left) and Garry Kasparov (right). ... June 19 is the 170th day of the year (171st in leap years) in the Gregorian Calendar, with 195 days remaining. ... 1996 (MCMXCVI) is a leap year starting on Monday of the Gregorian calendar, and was designated the International Year for the Eradication of Poverty. ... Buenos Aires (BWEH-naus EYE-ress, literally Good Winds in Spanish, but more akin to Fair Winds, as in navigation) is the capital of Argentina and its largest city and port, as well as one of the largest in South America. ... The first moves of a chess game are the opening moves, collectively referred to as the opening. ...

Contents


Starting position

The starting position for Fischer random chess must meet the following rules:

  • White pawns are placed on their orthodox home squares.
  • All remaining white pieces are placed on the first rank.
  • The white king is placed somewhere between the two white rooks.
  • The white bishops are placed on opposite-colored squares.
  • The black pieces are placed equal-and-opposite to the white pieces. For example, if white's king is placed on b1, then black's king is placed on b8.

Note that the king never starts on file a or h, because there would be no room for a rook. The pawn (♙♟) is the weakest and most numerous piece in the game of chess, representing infantry, or more particularly pikemen. ... The king (♔♚) is the most important piece in the game of chess. ... A rook (borrowed from Persian رخ rokh) is a piece in the strategy board game of chess. ... A bishop (♗♝) is a piece in the board game of chess. ...


There are many procedures for creating this starting position. Hans L. Bodlaender has proposed the following procedure using one six-sided die to create an initial position; typically this is done just before the game commences:

  • Roll the die, and place a white bishop on the black square indicated by the die, counting from the left. Thus 1 indicates the first black square from the left (a1 in algebraic notation), 2 indicates the second black square from the left (c1), 3 indicates the third (e1), and 4 indicates the fourth (g1). Since there are no fifth or sixth positions, re-roll 5 or 6 until another number shows.
  • Roll the die, and place a white bishop on the white square indicated (1 indicates b1, 2 indicates d1, and so on). Re-roll 5 or 6.
  • Roll the die, and place a queen on the first empty position indicated (always skipping filled positions). Thus, a 1 places the queen on the first (leftmost) empty position, while a 6 places the queen on the sixth (rightmost) empty position.
  • Roll the die, and place a knight on the empty position indicated. Re-roll a 6.
  • Roll the die, and place a knight on the empty position indicated. Re-roll a 5 or 6.
  • Place a white rook on the 1st empty square of the first rank, the white king on the 2nd empty square of the first rank, and the remaining white rook on the 3rd empty square of the first rank.
  • Place all white and black pawns on their usual squares, and place Black's pieces to exactly mirror White's (so Black should have on a8 exactly the same type of piece that White has on a1).

This procedure generates any of the 960 possible initial positions of Fischer Random Chess with an equal chance; on average, this particular procedure uses 6.7 die rolls - an optimal procedure would use on average somewhere between 4 and 4.45 die rolls. Note that one of these initial positions is the standard chess position, at which point a standard chess game begins. Algebraic chess notation is the method used today by all competition chess organizations and most books, magazines, and newspapers to record and describe the play of chess games. ... The queen is the most powerful piece in the game of chess. ... The knight moves in an L shape. ...


It is also possible to use this procedure to see why there are exactly 960 possible initial positions. Each bishop can take one of 4 positions, the Queen one of 6, and the two knights can have 5 or 4 possible positions, respectively. This means that there are 4×4×6×5×4 = 1920 possible positions if the two knights were different in some way. However, the two knights are indistinguishable during play; if they were swapped, there would be no difference. This means that the number of distinguishable positions is half of 1920, or 1920/2 = 960 possible distinguishable positions.


Rules

Once the starting position is set up, the rules for play are the same as standard chess. In particular, pieces and pawns have their normal moves, and each player's objective is to checkmate the opponent's king.


Rules for castling

Fischer random chess allows each player to castle once per game, moving both the king and a rook in a single move. However, a few interpretations of standard chess games rules are needed for castling, because the standard rules presume initial locations of the rook and king that are often untrue in Fischer Random Chess games. Initial position Kingside castling (0-0) Queenside castling (0-0-0) Castling is a special move in the game of chess involving the king and either rook. ...


After castling, the rook and king's final positions are exactly the same positions as they would be in standard chess. Thus, after a-side castling, also known in some places as c-castling, (notated as O-O-O and known as queen-side castling in orthodox chess), the King is on c (c1 for White and c8 for Black) and the a-side Rook is on d (d1 for White and d8 for Black). After h-side castling, also known in some places as g-castling, (notated as O-O and known as king-side castling in orthodox chess), the King is on g and the h-side Rook is on f. It is recommended that a player state "I am about to castle" before castling, to eliminate potential misunderstanding.


However, castling may only occur under the following conditions, which are extensions of the standard rules for castling:

  1. Unmoved: The king and the castling rook must not have moved before in the game, including castling.
  2. Unattacked: No square between the king's initial and final squares (including the initial and final squares) may be under attack by any opposing piece.
  3. Vacant: All the squares between the king's initial and final squares (including the final square), and all of the squares between the rook's initial and final squares (including the final square), must be vacant except for the king and castling rook. An equivalent way of stating this is that the smallest back rank interval containing the king, the castling rook, and their destination squares contains no pieces other than the king and castling rook.

These rules have the following consequences:

  • If the initial position happens to be the standard chess initial position, these castling rules have exactly the same effect as the standard chess castling rules.
  • All the squares between the king and castling rook must be vacant.
  • Castling cannot capture any pieces.
  • The king and castling rook cannot "jump" over any pieces other than each other.
  • A player may castle at most once in a game.
  • If a player moves his king or both of his initial rooks without castling, he may not castle during the rest of the game.
  • In some starting positions, some squares can stay filled during castling that would have to be vacant in standard chess. For example, after a-side castling (O-O-O), it's possible to have a, b, and/or e still filled, and after h-side castling (O-O), it's possible to have e and/or h filled.
  • In some starting positions, the king or rook (but not both) do not move during castling.
  • The king may not be in check before or after castling.
  • The king cannot move through check.

How to castle

When castling on a physical board with a human player, it is recommended that the king be moved outside the playing surface next to his final position, the rook then be moved from its starting to ending position, and then the king be placed on his final square. This is always unambiguous, and is a simple rule to follow.


Eric van Reem suggests that there are other acceptable ways to castle:

  • If only the rook needs to move (jumping over the king), you can simply move only the rook.
  • If only the king needs to move (jumping over the castling rook), you can simply move the king.
  • One can pick up both the king and rook (in either order), then place them on their final squares (this is called "transposition" castling).
  • One can move the king to its final square and move the rook to its final square as two separate moves, in either order (this is called "double-move" castling). Obviously, if the rook is on the square the king will occupy, the player needs to move the rook first, and if the king is on the square the rook will occupy, the player needs to move the king first.

In the meantime there has been an adjustment setting of the WNCA that when performing a castling move it is irrelevant in which sequence involved pieces were touched. All pieces involved in a move may be touched arbitrarily. When castling those pieces are the King and Rook, and in capturing moves they are the capturing and the captured piece. Especially with players new to Fischer Random Chess it might make sense also to announce a castling to avoid misunderstandings. When a chess clock will be used, pressing the button could be taken as a sign that a castling move has been completed.


When castling using a computer interface, programs should have separate a-side (O-O-O) and h-side (O-O) castling actions (e.g., as a button or menu item). Ideally, programs should also be able to detect a king or rook move that cannot be anything other than a castling move and consider that a castling move. Recommended gestures are: the King is moving to his at least two steps distant castling target square or else upon the involved Rook, to avoid by this a possible confusion with normal King's moves.


When using an electronic board, to castle one should remove the king, remove the castling rook, place the castling rook on its new position, and then place the king on its new position. This will create an unambiguous move for electronic boards, which often only have sensors that can detect the presence or absence of an object on each square (and cannot tell what object is on the square). Ideally, electronic boards should detect a king or rook move that can only be a castling move as well, but users should not count on this.


Castling rule ambiguities

Many published castling rules are unfortunately ambiguous. For example, the rules first published by Eric van Reem and chessvariants.org, as literally stated, did not specifically state that there must be vacant squares between the king and his destination except for the participating rook. As a result, those rules appeared to some to allow the king to "leap" over other pieces.


In 2003 David A. Wheeler contacted many active in Fischer Random Chess to determine the exact castling rules, including Eric van Reem, Hans-Walter Schmitt, and R. Scharnagl. All agreed that there must be vacant squares between the king and his destination except for the participating rook, clarifying the castling rules.


Playing Fischer Random Chess

Examining openings for Fischer Random Chess is in its infancy, but opening fundamentals still apply. These include: protect the King, control the center squares (directly or indirectly), and develop your pieces rapidly starting with the less valuable pieces. Some starting positions have unprotected pawns that may need to be dealt with quickly.


Some have argued that two games should be played with each initial position, with players alternating as white and black, since some initial positions may turn out to give white a much bigger advantage than standard chess. However, there is no evidence that any position gives either side a significant advantage.


Recording games and positions

Since the initial position is usually not the orthodox chess initial position, recorded games must also record the initial position. Games recorded using the Portable Game Notation (PGN) can record the initial position using Forsyth-Edwards Notation (FEN), as the value of the "FEN" tag. Castling is marked as O-O or O-O-O, just as in standard chess. Note that not all chess programs can handle castling correctly in Fischer Random Chess games (except if the initial position is the standard chess initial position). To correctly record a Fischer Random Chess game in PGN, an additional "Variant" tag must be used to identify the rules; the rule named "Fischerandom" is accepted by many chess programs as identifying Fischer Random Chess. Be careful to use "Variant" and not "Variation", which has a different meaning. This means that in a PGN-recorded game, one of the PGN tags (after the initial 7 tags) would look like this: Portable Game Notation (.PGN) is a computer-processable format for recording chess games (both the moves and related data); many chess programs recognize this extremely popular format due to its accessibility by ordinary ascii editors, including word processors capable of importing and exporting plain ascii. ... Forsyth-Edwards Notation (FEN) is a standard notation for describing a particular board position of a Chess game. ...

 [Variant "Fischerandom"] 

R. Scharnagl does not agree. There is no need for distinguishing its so called variants "normal", "nocastle" and "fischerandom", because the different or skipped castling rights could be completely encoded in an appropriate FEN string. It would be a bad solution to inflate a PGN file with superfluous tags only to cover weaknesses of some protocols. FRC-aware engine will always play FRC. Loaded with a Shuffle Chess FEN string it would play correctly, just like it would handle a traditional chess starting array without error. A game of traditional Chess could easily be recognized via the missing SetUp and FEN tags.


FEN is capable of expressing all possible starting positions of Fischer Random Chess. However, unmodified FEN cannot express all possible positions of a Fischer Random Chess game. In a game, a rook may move into the back row on the same side of the king as the other rook, or pawn(s) may be underpromoted into rook(s) and moved into the back row. If a rook is unmoved and can still castle, yet there is more than one rook on that side, FEN notation as traditionally interpreted is ambiguous. This is because FEN records that castling is possible on that side, but not which rook is still allowed to castle. A fen is a sere, a phase in the natural ecological succession from the open water of a lake to (for example) woodland. ...


A modification of FEN, X-FEN, has been devised by Reinhard Scharnagl to remove this ambiguity. In X-FEN, the castling markings "KQkq" have their expected meanings: "Q" and "q" mean a-side castling is still legal (for white and black respectively), and "K" and "k" mean h-side castling is still legal (for white and black respectively). However, if there is more than one rook on the baseline on the same side of the king, and the rook that can castle is not the outermost rook on that side, then the file letter (uppercase for white) of the rook that can castle is used instead of "K", "k", "Q", or "q"; in X-FEN notation, castling potentials belong to the outermost rooks by default. The maximum length of the castling value is still four characters. X-FEN is upwardly compatible with FEN, that is, a program supporting X-FEN will automatically use the normal FEN codes for a traditional chess starting position without requiring any special programming. As a benefit all 18 pseudo FRC positions (positions with traditional placements of rooks and king) still remain uniquely encoded. A fen is a sere, a phase in the natural ecological succession from the open water of a lake to (for example) woodland. ... To represent all imaginable positions in 8x8 Chess960 or 10x8 Capablanca Random Chess (CRC) the traditional FEN (Forsyth Edwards Notation) unfortunately is not sufficient. ... Reinhard Scharnagl, born in 1953, is the author of the book Fischer-Random-Schach (FRC / Chess960)- Die revolutionäre Zukunft des Schachspiels (inkl. ... To represent all imaginable positions in 8x8 Chess960 or 10x8 Capablanca Random Chess (CRC) the traditional FEN (Forsyth Edwards Notation) unfortunately is not sufficient. ... To represent all imaginable positions in 8x8 Chess960 or 10x8 Capablanca Random Chess (CRC) the traditional FEN (Forsyth Edwards Notation) unfortunately is not sufficient. ... To represent all imaginable positions in 8x8 Chess960 or 10x8 Capablanca Random Chess (CRC) the traditional FEN (Forsyth Edwards Notation) unfortunately is not sufficient. ...


Starting position IDs in Fischer Random Chess / Chess960

For years, Reinhard Scharnagl has championed the desirability of giving each of the Chess960 starting positions (SP) a unique indentification number (idn) in the range 0-959 or, perhaps, 1-960. He has presented his methods on the internet and in books. See the external references. As an application, a random number generator could make one probe into the range at hand for a random number, and produce a random SP. Late in 2005, the program Fritz9 became available. It has a Chess960 option, but, for some unexplained reason, it assigns idns to SPs in a different way. Rather than requiring a giant table with 960 entries, both methods can use some smaller tables and some arithmetic.


Preliminaries

Both methods take account of the positions of the Bishops first, and ignore the distinction between the King and Rooks. Once the positions of the Bishops, Knights and Queen are known, there is only one possibility for the remaining 3 squares. In the places where division of whole numbers is done, it is always done giving a quotient (designated q1,q2,..) and a remainder (designated r1,r2 ..).


There are 16 ways to put 2 Bishops on opposite colored squares. These are shown and numbered in the small table below. The entries actually can be calculated using simple arithmetic, but the table method seems less error prone. For the standard SP the Bishop's code is 6.

 Scharnagl's Bishop's Table - 0 BB------ 4 -BB----- 8 -B--B--- 12 -B----B- 1 B--B---- 5 --BB---- 9 ---BB--- 13 ---B--B- 2 B----B-- 6 --B--B-- 10 ----BB-- 14 -----BB- 3 B------B 7 --B----B 11 ----B--B 15 ------BB 

In any SP, when looking at the arrangement of the other pieces around the Bishops, it is helpful to write down the NQ-skeleton for that SP. This is done by ignoring the Bishops and replacing the "K" and "R" by a common symbol, say "-". The NQ-skeleton for the standard SP is -NQ-N-. The sections below showing Scharnagl's Methods and the Fritz9 Methods are independent, and may be read in any order.


Scharnagl's Methods

The methods described below are appropriate for the idn range 0-959. For the idn range 1-960, he recommends conversion by dividing by 960 and working with the remainder. This has the effect of assigning to idn 0 the SP that was at idn 960, and leaving the other idn SP matchups unchanged. If this calculation is applied in the idn range 0-959, nothing is changed.


For any SP, after skipping over the Bishop's, the Queen may occupy any one of 6 possible squares, and they are numbered from left to right (from White's perspective) 0,1,2,3,4,5. The two Knights, then, can appear in any of the remaining 5 squares (skipping over Bishops and Queen) in 10 ways. These are shown and numbered in the N5N table below.

 Scharnagl's N5N Table - 0 NN--- 2 N--N- 4 -NN-- 6 -N--N 8 --N-N 1 N-N-- 3 N---N 5 -N-N- 7 --NN- 9 ---NN 

For any SP, both the Queens position and the N5N configuration are immediately available from the NQ-skeleton. The Queen's position is the number of characters to the left of the "Q" , giving 2 for the standard SP. The N5N configuration is obtained by omitting the "Q", giving -N-N- for the standard SP, so its N5N code is 5. In general

 idn = (Bishop's code) + 16*(Queen's position) + 96*(N5N code) 
 For the standard SP, idn = 6 + 16*2 + 96*5 = 518 

Going the other way, starting with an idn, divide it by 16 and get


idn = q1*16 + r1. r1 gives the Bishop's code, so put the Bishops on the board. Then divide q1 by 6.


q1 = q2*6 + r2. r2 gives the Queen's position, so put it on the board.


q2 gives the N5N code, so put the Knights on the board (of course skipping over the Bishops and Queen).


Starting with id = 518, we get 518 = 32*16 + 6, and 32 = 5*6 + 2 so the Bishops code is 6, the Queens position is 2 and the N5N code is 5 with configuration -N-N-. If asterisks denote blank squares, the first rank fills up as: **B**B** **BQ*B** *NBQ*BN*


All of the multiplication and division can be eliminated by using the NQ-skeleton table below. It contains all of the 60 possible NQ-skeletons, and directly refers to all of the SPs with Bishop's code 0, ie. with Bishops on a1 and b1.

 Scharnagl's NQ-skeleton Table - 0 QNN--- 192 QN--N- 384 Q-NN-- 576 Q-N--N 768 Q--N-N 16 NQN--- 208 NQ--N- 400 -QNN-- 592 -QN--N 784 -Q-N-N 32 NNQ--- 224 N-Q-N- 416 -NQN-- 608 -NQ--N 800 --QN-N 48 NN-Q-- 240 N--QN- 432 -NNQ-- 624 -N-Q-N 816 --NQ-N 64 NN--Q- 256 N--NQ- 448 -NN-Q- 640 -N--QN 832 --N-QN 80 NN---Q 272 N--N-Q 464 -NN--Q 656 -N--NQ 848 --N-NQ - 96 QN-N-- 286 QN---N 480 Q-N-N- 672 Q--NN- 864 Q---NN 112 NQ-N-- 304 NQ---N 496 -QN-N- 688 -Q-NN- 880 -Q--NN 128 N-QN-- 320 N-Q--N 512 -NQ-N- 704 --QNN- 896 --Q-NN 144 N-NQ-- 336 N--Q-N 528 -N-QN- 720 --NQN- 912 ---QNN 160 N-N-Q- 352 N---QN 544 -N-NQ- 736 --NNQ- 928 ---NQN 176 N-N--Q 368 N---NQ 560 -N-N-Q 752 --NN-Q 944 ---NNQ 

Given an SP, extract the Bishop's code, the NQ-skeleton and its N5N configuration. The 6 skeletons in each of the 10 blocks in the table all have the same N5N configuration, and the blocks are arranged according to the N5N table above. It is easy, then, to find the appropriate block, and look inside for the entry with the "Q" in the desired place, say at No. M. Then idn = (Bishop's code) + M. For the standard SP, we extract 6 -NQ-N- and -N-N-. The desired block is the middle one in the second row, and the desired skeleton is at No. 512. We get idn = 6 + 512 = 518.


Going the other way, given an idn, locate, in the table, the largest number, say M, that is less than or equal to idn. Then idn - M gives the Bishop's code, and the skeleton at M shows how to fill in the rest of the pieces. Given idn = 518 we locate 512, with NQ-skeleton -NQ-N-, in the table, and get Bishops code = 518 - 512 = 6.


Fritz9 Methods

Upon entry to Chess960, Fritz9 prompts the user to enter a position idn or to "Draw Lots". If the user wishes to choose the first rank configuration of pieces, he/she must know how to get at the idn, but, unfortunatly, Fritz9 does not use the standard method described above. The table below shows a quick way to get the Fritz9 idn for any SP.


For any SP, after ignoring the Bishops, attention is given first to the Knights (rather than to the Queen). After taking account of the arrangement of the two Knights in 6 squares (skipping over Bishops), the Queen is left with 4 possibilities: 0,1,2,3 (counting from the a-side of the board and skipping over Bishops and Knights). The Queen's position is the number of hyphens to the left of the "Q" in the NQ-skeleton for the SP.


In the table below, the columns correspond to the Queen's position, and, in each column, the ordering is alphabetic with "-" last.


Given an SP, extract the Bishop's code, the NQ-skeleton and its Queen's position. Then, locate, in the appropriate column, the NQ-skeleton at hand, say at No. M. The Fritz9 idn = (Bishop's code) + M. For the standard SP, we extract 6 -NQ-N- and 1 and get Fritz9 idn = 6 + 353 = 359.

 Fritz9 NQ-skeleton Table - 1 NNQ--- 241 NN-Q-- 481 NN--Q- 721 NN---Q 17 NQN--- 257 N-NQ-- 497 N-N-Q- 737 N-N--Q 33 NQ-N-- 273 N-QN-- 513 N--NQ- 753 N--N-Q 49 NQ--N- 289 N-Q-N- 529 N--QN- 769 N---NQ 65 NQ---N 305 N-Q--N 545 N--Q-N 785 N---QN 81 QNN--- 321 -NNQ-- 561 -NN-Q- 801 -NN--Q 97 QN-N-- 337 -NQN-- 577 -N-NQ- 817 -N-N-Q 113 QN--N- 353 -NQ-N- 593 -N-QN- 833 -N--NQ 129 QN---N 369 -NQ--N 609 -N-Q-N 849 -N--QN 145 Q-NN-- 385 -QNN-- 625 --NNQ- 865 --NN-Q 161 Q-N-N- 401 -QN-N- 641 --NQN- 881 --N-NQ 177 Q-N--N 417 -QN--N 657 --NQ-N 897 --N-QN 193 Q--NN- 433 -Q-NN- 673 --QNN- 913 ---NNQ 209 Q--N-N 449 -Q-N-N 689 --QN-N 929 ---NQN 225 Q---NN 465 -Q--NN 705 --Q-NN 945 ---QNN 

Anyone with Fritz9 can verify this table by entering in the idns. It directly refers to just those SPs with Bishop's code 0 ie. with the Bishops on a1 and b1.


Other ways to create initial positions

There are several other methods that can create initial positions. Keep in mind that some of these, as noted, do not produce all legal arrangements of pieces with equal probability, and in that sense are less than random.


Coin-tossing method

This method does not produce all legal starting positions with equal probability. The positions that arise when the King occupies the center two of the four possibilities are two thirds as likely as the others.


Edward Northam has developed the following approach for creating initial positions using only two distinguishable coins.


First, two coins (small and large) are used to randomly generate numbers with equal probability. He suggests doing this by declaring that 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).


Any other technique that randomly generates numbers from 1 to 4 (or at least 1-2) will work as well, such as as the selection of a closed hand that may hold a white or black Pawn.


As with a die, the coin tosses can build a starting position one piece at a time. Before each toss there will be at most 4 vacant squares available to the piece at hand, and they can be numbered counting from the a-side (as with the die procedure described above). Place the white pieces on white's back rank as follows:

  1. Place a Bishop on one of the 4 light squares.
  2. Place a Bishop on one of the 4 dark squares.
  3. Place the King. There 6 vacant squares, but only the middle 4 are available to the King, since there must be room for a Rook on each side of the King.
  4. Place a Rook on the a-side of the King.
  5. Place a Rook on the h-side of the King.
  6. Place the Queen on one of the 3 vacant squares that remain.
  7. Place Knights on the two squares that are left.

The average number of tosses needed to complete the process is 6. If a die and coins are at hand, no tosses need be repeated. The coins are used unless a number 1,2,3 is needed. Then the die is rolled, and 4,5,6 is counted as 1,2,3.


Both the die and coins methods can be speeded up by introducing parallelism. Several dice of different colors can be rolled, so long as there is a prior agreement about the ordering of the colors (which color is counted as the first roll, the second etc.). Using US coins, if each player tosses a penny, nickel, dime, and quarter (penny goes with nickel, dime goes with quarter), this single action gives four outcomes. Again, there must be a prior agreement about the order of these outcomes. Two such actions will place all of the pieces more than 97% of the time.


The ultimate parallelism of this type would have each player toss four different coins and a die. If a die is used only when 1,2,3 is needed, this single action will place all eight pieces. Again, there must be a prior agreement about the ordering of these outcomes.


Drawing methods

These methods all start with a random arrangement of pieces on White's back rank. There are 5040 such arrangements, of which 2880 have the Bishops on opposite colored squares, but only 2160 have the Bishops on same colored squares. Thus, no attempt to correct the latter Bishop positions by linking each of the latter arrangements to one of the former arrangements can produce results with equal probabilities. Usually one fourth of the opposite color Bisop positions will be half as likely as the others. (2880-2160)/2880 = 0.25.


David J. Coffin suggests the following procedure, which has the advantage of not requiring computers, dice, or lookup tables:

  1. Place the eight white pieces in a bag. Draw them one by one and place them on squares a1, b1, ... h1.
  2. If the bishops are on the same color, look at the following pairs: a1-b1, c1-d1, and e1-f1. Swap the leftmost pair that contains a bishop.
  3. If the king is not between his rooks, swap the king with the closer rook.

However, while all positions can be generated this way, not all positions have the same probability to be generated. Mathematical analysis shows that positions with the bishops on a pair a1-b1, c1-d1, e1-f1, or g1-h1 actually have half the probability to be generated than the other positions.


R. Scharnagl also has a method for correcting same color Bishop positions when the pieces are drawn from a bag. He acknowledges that it does not produce all positions with equal probability, but makes the point that this is not necessary to achieve the main objective of Fischer Random Chess. See the external reference.


One way of proceeding when the Bishops start on squares of the same color would have a randomly selected Bishop move to a randomly selected square of the opposite color. This idea is due to David Wheeler, and it produces all opposite color Bishop positions with equal probability. A choice involving a white Pawn and a black Pawn could be used to select the a-side or h-side Bishop, which would be removed from the board. Then the black pieces could be put in the bag and mixed up. One would be drawn out, and the numbering of the square of opposite color could, for example, be given by R=1, N=2, B=3, K,Q=4.


A much quicker method is to simply gather the 8 pieces into a circle on the table, then squash the circle flat into a line. If the bishops would be on the same colour, gather the pieces and try again. Once the bishops are right, swap the king and rook (as above), and start the game.


Eight cards method

This method produces all legal starting positions with equal probability.


This method makes use of eight home made cards, perhaps about the size of ordinary business cards. The cards should be marked, respectively, with the names of the eight pieces, R,N,B,Q,K,B,N,R, and, additionally, should be marked, respectively, with the eight labels a-1, a-2, a-3, a-4, h-1, h-2, h-3, h-4.


After the cards are shuffled and dealt in a row, the white pieces should be placed on the back rank as designated by the piece labels. If the Bishops are on squares of the same color, the cards should be put face down, mixed up, and one selected at random. The second label designates whether the a-side or h-side Bishop is to be moved, and which square of the opposite color it moves to. It trades places with the piece that is there. The idea behind this, a randomly selected Bishop moves to a randomly selected square of the opposite color, is due to David Wheeler.


After the Bishops are on squares of different colors, attention is given to the King and Rooks. If the King is not between the Rooks, it must trade places with the nearest Rook.


The German version of this article shows that a much simpler deck of cards will suffice. They need only carry the numbers 1 through 8. On the first deal pieces are assigned to the numbers following the starting position in standard chess. ie. 1,8=R, 2,7=N, 3,6=B, 4=Q, 5=K. If a Bishop move is needed, The numbers 1-4 designate that the a-side Bishop is to move, and the numbers 5-8 designate that the h-side Bishop is to move. In the latter case, 4 should be subtracted form the number to get the square of opposite color for the h-side Bishop to move to.


-OR-


This method does not produce all legal starting positions with equal probabilities. The problem is discussed at the top of the "Drawing methods" section.


Using a deck of playing cards, you can select the King, Queen, 2 Jacks, 2 Aces, and 2 Tens. You can seperate these out in seconds, and decide on which minor pieces are represented by which cards (as the King & Queen are obvious.) Shuffle. Cut the deck. Deal. You have to take care as to keep the Bishops on opposite colors, and the King between the Rooks. To deal with a card that would be illegal, just hold that piece to the side until it is legal to place. When a legal square opens, place the held piece. Sometimes, two pieces are held but it is not confusing and quite a speedy and random method.


Platonic solid dice

This method produces all starting positions with equal probability.


If one has polyhedral dice shaped like each of the Platonic solids, one never needs to reroll any dice. Rolling dice Dice (the plural of the word die, probably from the Latin dare: to give) are, in general, small polyhedral objects with the faces marked with numbers or other symbols, thrown in order to choose one of the faces randomly. ... In solid geometry and some ancient physical theories, a Platonic solid is a convex polyhedron with all its faces being congruent regular polygons, and the same number of faces meeting at each of its vertices. ...

  • Roll the dice.
  • Place a white bishop on the square indicated by the octahedron (d8).
  • Place the other white bishop on the square of opposite colour indicated by the tetrahedron (d4).
  • Place the white queen on the square indicated by the cube (d6).
  • Take the number of the icosahedron (d20). Subtract one, divide by four, and add one to quotient and remainder. These determine positions of the first and second knight.
  • Place the white rooks and the white king between the rooks. If desired, use the dodecahedron to decide who plays white (even numbers for one player, odd for the other).
  • Place the white pawns and mirror the position for black.
A matched Platonic-solids set of five dice, (from left) tetrahedron (d4), cube (d6), octahedron (d8), dodecahedron (d12) and icosahedron (d20).
A matched Platonic-solids set of five dice, (from left) tetrahedron (d4), cube (d6), octahedron (d8), dodecahedron (d12) and icosahedron (d20).

An octahedron (plural: octahedra) is a polyhedron with eight faces. ... For academic journal, see Tetrahedron A tetrahedron (plural: tetrahedra) is a polyhedron composed of four triangular faces, three of which meet at each vertex. ... Three dimensions A cube (or hexahedron) is a Platonic solid composed of six square faces, with three meeting at each vertex. ... An icosahedron [ˌaıkəsəhiːdrən] noun (plural: -drons, -dra [-drə]) is a polyhedron having 20 faces, but usually a regular icosahedron is meant. ... Dice sold in sets are often identically colored, with matching die and marking colors. ...

Non-random setups

The initial setup need not necessarily be random. The players or a tournament setting may decide on a specific position in advance, for example. Tournament Directors prefer that all boards in a single round play the same random position, as to maintain order and abbreviate the setup time for each round.


Edward Northam suggests the following approach for allowing players to jointly create a position without randomizing tools. First, the back ranks are cleared of pieces, and the white Bishops, Knights, and Queen are gathered together. Starting with Black, the players, in turn, place one of these pieces on White's back rank, where it must stay. The only restriction is that the Bishops must go on opposite colored squares. There will be a vacant square of the required color for the second Bishop, no matter where the previous pieces have been placed. After all five pieces have been put on the board, the King must be placed on the middle of the three vacant back rank squares that remain. Rooks go on the other two.


This approach to the opening setup has much in common with Pre-Chess, the variant in which White and Black, alternately and independently, fill in their respective back ranks. If Pre-Chess were to be played with the requirement of ending up with a legal Fischer Random Chess opening position, something similar to the above might well be the way to go.


Without some limitation on which pieces go on the board first, it is possible to reach impasse positions, which cannot be completed to legal Fischer Random Chess starting positions. Example: Q.RB..NN If the players want to work with all eight pieces, they must have a prior agreement about how to correct illegal opening positions that may arise. If the Bishops end up on same color squares, a simple action, such as moving the a-side Bishop one square toward the h-file, might be agreeable, since there is no question of preserving randomness. Once the Bishops are on opposite colored squares, if the King is not between the Rooks, it should trade places with the nearest Rook.


History

A variant of random chess defined by former World Champion Bobby Fischer and introduced formally to the chess public on June 19, 1996, in Buenos Aires, Argentina. Bobby Fischer must have been shocked to see how opening theory had developed since his last game in 1972. It is said that friends from throughout the world sent him masses of analysis, which he ignored during the match against Spassky in 1992.


Fischer's goal was to eliminate what he considers the complete dominance of openings preparation in chess today, and to replace it with creativity and talent. Since the opening book for each possible opening position would be too difficult to devote to memory (959 "book opening" systems), therefore, each player must create every move originally. From move 1 on both players have to come up with original strategies and can not use well-known thinking patterns. By eliminating memorized book moves, Fischer believes that it will level the playing field; and as an accidental consequence, it makes computer chess programs much weaker, as they depend on the opening book to beat humans.


The first Fischer Random Chess tourney was held in Yugoslavia in the spring of 1996, and was won by Grandmaster Péter Lékó. The five original grandmasters of chess, from left to right: Lasker (seated), Alekhine, Capablanca, Marshall, Tarrasch (seated) The title International Grandmaster is awarded to world-class chess masters by the world chess organization FIDE. Apart from World Champion, Grandmaster is the highest title a chess player can attain. ... Péter Lékó Péter Lékó (b. ...


In 2001, Lékó became the first Fischer Random Chess world champion, defeating GM Michael Adams in an eight game match played as part of the Mainz Chess Classic. There were no qualifying matches (also true of the first orthodox world chess champion titleholders), but both players were in the top five in the January 2001 world rankings for orthodox chess. Lékó was chosen because of the many novelties he has introduced to known chess theories, as well as his previous tournament win; in addition, Lékó has played Fischer Random Chess games with Fischer himself. Adams was chosen because he was the world number one in blitz (rapid) chess and is regarded as an extremely strong player in unfamiliar positions. The match was won by a narrow margin, 4.5 to 3.5. Michael Adams who was born on October 17, 1971 in Truro, Cornwall, England is an International Grandmaster of chess. ... Mainz (French: Mayence) is a city in Germany and the capital of the German federal state of Rhineland-Palatinate. ...


In 2002 at Mainz, an open Fischer Random tournament was held which attracted 131 players. Peter Svidler won the event. Other interesting events happened in 2002. The website ChessVariants.org selected Fischer Random chess as its "Recognized Variant of the Month" for April 2002. Yugoslavian Grandmaster Svetozar Gligoric published in 2002 the book Shall We Play Fischerandom Chess?, popularizing this variant further. Peter Svidler Peter Svidler (Пётр Свидлер; Pyotr Svidler, born June 17, 1976 in Leningrad) is a Russian chess grandmaster. ... Svetozar Gligorić (born February 2, 1923) is a chess grandmaster. ...


At the 2003 Mainz Chess Classic, Svidler beat Lékó in an eight game match for the World Championship title by a score of 4.5 - 3.5. The Chess960 (Fischer Random Chess) open tournament attracted 179 players, including 50 GMs. It was won by Levon Aronian, the 2002 World Junior Champion. He played Svidler for the title at the 2004 Mainz Chess Classic, losing 4.5-3.5. At the same tournament in 2004, Aronian played two Chess960 games against the Dutch computer chess program The Baron, developed by Richard Pijl. Both games ended in a draw. It was the first ever man against machine match in Chess960. In 2005 The Baron played two Chess960 games against Chess960 World Champion Peter Svidler; Svidler won 1.5-0.5. The chess program Shredder, developed by Stefan Meyer-Kahlen from Düsseldorf, Germany, played two games against Zoltan Almasi from Hungary; Shredder won 2-0. Almasi and Svidler played an eight-game match at the 2005 Mainz Chess Classic. Once again, Svidler defended his title, winning 5-3. Levon Aronian (born October 6, 1982) is an Armenian chess player. ... Shredder is a very strong chess program developed by Stefan Meyer-Kahlen. ... Zoltan Almasi is a Grandmaster chess player from Hungary. ...


Computer Chess960 (Fischer Random Chess) world championship

During the Chess Classic 2005 in Mainz, initiated by Mark Vogelgesang and Eric van Reem, the first-ever Chess960 computer chess world championship was played.[1] Nineteen programs, including the powerful Shredder, played in this tournament. As a result of this tournament, Spike became the first Chess960 computer world champion. Shredder is a very strong chess program developed by Stefan Meyer-Kahlen. ...


Naming

This particular chess variant has a number of different names. The first names applied to it include "Fischer Random Chess" and "Fischerandom Chess". However, this has become as unfashionable as Fischer himself. It is his invention, and he put his own name to it.


Hans-Walter Schmitt (chairman of the Frankfurt Chess Tigers e.V.) is an advocate of this chess variant, and he started a brainstorming process to choose a new name for it. The new name had to obey the following requirements on the parts of some leading grandmasters:

  1. It should not use parts of the name of any Grandmaster colleague
  2. It should not include negatively biased or "spongy" elements like "random" or "freestyle"
  3. It should be understood worldwide.

This effort culminated in the name "Chess960," deriving from the number of different initial positions.


R. Scharnagl, another proponent of this variant, had used the term FullChess instead. But today he uses "FullChess" to address chess variants consistently embedding the traditional chess game, e.g. Chess960 and some new variants based on the extended 10x8 Capablanca piece set. He actually recommends the use of the term "Chess960" instead of Fischer Random Chess.


At this time the terms "Fischer Random Chess" or "Fischerandom chess" are more common. It is not yet clear if these other, newer terms, or yet another one will replace it.


Similar Chess Variants

There are other chess variants with rules similar to Fischer Random Chess. These include:

  • King's Corner chess: like Fischer Random Chess, the placement of the pieces on the 1st and 8th row are randomized, but with the king in the right hand corner. Black's starting position is obtained by rotating white's position 180 degrees around the board's center.
  • Randomly opened chess: similar to Fischer Random Chess, except players take turns placing pieces on the board (pawns may go anywhere in the 2nd, 3rd, or 4th ranks, while other pieces may go anywhere)
  • Transcendental chess: similar to Fischer Random Chess, but the opening white and black positions do not mirror each other. (Also called Double Fischer Random Chess or Wild Chess)

John Kipling Lewis's "Castling in Chess960: An appeal for simplicity" proposes the same rules for the initial position as Fischer Random Chess, but proposes an alternative set of castling rules. In this variation, the preconditions for castling are the same, but when castling "the King is transferred from its original square two squares towards (or over) the Rook, then that Rook is transferred to the square the King has just crossed (if it is not already there). If the King and Rook are adjacent in a corner and the King can not move two spaces over the Rook, then the King and Rook exchange squares." Note that these rules are different from the Fischer Random Chess rules, since the final position after castling will usually not be the same as the final position of a castling move in traditional chess. Lewis argues that this alternative better conforms to how the castling move was historically developed. Lewis has named this chess varation "Chess480"; this variation follows the rules of Fischer Random Chess with the exception of the castling rules which Lewis has named "Orthodoxed Castling". Randomly opened chess is based on classical chess, but the major difference is in the starting positions. ... Transcendental chess is a variant of chess invented in 1981 by Maxwell Lawrence. ...


External links

Descriptions and commentary

Play via internet Reinhard Scharnagl, born in 1953, is the author of the book Fischer-Random-Schach (FRC / Chess960)- Die revolutionäre Zukunft des Schachspiels (inkl. ...

In other languages

  • Rules (in Spanish) of Fischer Random Chess
  • Rules (in French) of Fischer Random Chess (Canadian server)


 

COMMENTARY     


Share your thoughts, questions and commentary here
Your name
Your comments
Please enter the 5-letter protection code

Want to know more?
Search encyclopedia, statistics and forums:

 


Lesson Plans | Student Area | Student FAQ | Reviews | Press Releases |  Feeds | Contact
The Wikipedia article included on this page is licensed under the GFDL.
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms.