Talk:Generate Chess960 starting position

From Rosetta Code

clarifying wording

In the first rule, the wording states   ··· all eight pawns must be placed on the second rank.

There are sixteen pawns.

How about   A player's eight pawns must be ···   or something similar. -- Gerard Schildberger (talk) 04:53, 8 May 2014 (UTC)

random starting position

A trivial REXX program (of two statements): <lang rexx>if random(0,1) then say 'NBQRBKNR'

               else say 'QBNRBKNR'</lang>

would, in the strictest sense, fullfill a random Chess960 starting position   (albeit only two random positions).

However, I believe the spirit of the requirement of random be that the random position would produce any of the 960 possible starting positions. -- Gerard Schildberger (talk) 04:53, 8 May 2014 (UTC)

relevant :-) --Grondilu (talk) 05:49, 8 May 2014 (UTC)

To this end, I wrote a REXX program (2nd programming entry) that randomly generates all possible unique 960 Chess960 starting positions and it shows a log of the results (unique starting positions) after each one-thousand generations.

This would make a good extension to the requirements to verify that the programming examples being used to create a random Chess960 starting position do indeed produce all possible starting positions. -- Gerard Schildberger (talk) 05:42, 8 May 2014 (UTC)