Generate random chess position: Difference between revisions
Content added Content deleted
No edit summary |
m (proper italics) |
||
| Line 7: | Line 7: | ||
* there can not be any pawn in the promotion square (no white pawn in the eighth rank, and no black pawn in the first rank); |
* there can not be any pawn in the promotion square (no white pawn in the eighth rank, and no black pawn in the first rank); |
||
* including the kings, up to 32 pieces of either color can be added. There is no requirement for material balance between sides; The picking of pieces does not have to comply to a regular chess set : there can be five knights, twenty rooks, whatever... as long as the total number of pieces do not exceed thirty-two. |
* including the kings, up to 32 pieces of either color can be added. There is no requirement for material balance between sides; The picking of pieces does not have to comply to a regular chess set : there can be five knights, twenty rooks, whatever... as long as the total number of pieces do not exceed thirty-two. |
||
* it is white's turn, it is assumed that both sides have lost castling rights and that there is no possibility for |
* it is white's turn, it is assumed that both sides have lost castling rights and that there is no possibility for ''en passant'' (the FEN should thus end in <tt>w - - 0 1</tt>); |
||
No requirement is made regarding the probability distribution of your method, but your program should be able to span a reasonably representative sample of all possible positions. For instance, programs that would always generate positions with say five pieces on the board, or with kings on a corner, would not be considered truly random. |
No requirement is made regarding the probability distribution of your method, but your program should be able to span a reasonably representative sample of all possible positions. For instance, programs that would always generate positions with say five pieces on the board, or with kings on a corner, would not be considered truly random. |
||