How to use dice to determine starting position in Fischer Random? Using a set of Platonic dice (tetrahedron, cube, octahedron, dodecahedron, and icosahedron), what way of choosing the initial position in a game of Fischer Random Chess (Chess 960) uses the fewest dice throws?

I am looking for a way that


does not simply yield a number between 1 and 960 which you then look up on an ordered list of starting positions
allows pieces to be placed in sequence - for example, first the rooks, then the bishops, then the king, or in some other order
yields each of the 960 positions with equal probability


The rules state that for each player bishops must be on squares of opposite colour and the king must be between the rooks.

You do not have to use every die. If only, say, the octahedron needs to be used, that is fine!
Several methods to do so are described on Wikipedia. For example:

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), divide by four  (round up), and let 'x' = the quotient, and 'y' = the remainder + 1. Place a knight on the 'x'-th empty square. Then place the other knight on the 'y'-th remaining empty square. In other words, see the d20 as a d5 for the first knight: 1-4, 5-8, 9-12, 13-16 and 17-20. Then for the second knight, look within the group to get a d4. For example, a 20 is in the fifth group and the fourth spot in that group, so place the knights on the fifth square and the fourth square. An 11 is in the third group and the third spot.


You can also use just a d10 since there are only ten unique placements of the knights once the bishops and queen has been placed. Hold one knight on the leftmost square and count one, two, three, four with the other knight on the empty square, then when it loops, move the leftmost knight one square to the right, five, six, seven, then it loops again, eight, nine, and finally with ten both knights are as far right as they go. For example, with a six the knight would be placed on the second of the five empty squares, then the second knight would be place on the second of the three squares that are empty to the right of the knight. Using a d10 in this way after two different colored d4:s and a d6 is a minimal one-roll way since 4×4×6×10 is exactly 960. (And, by subtracting one from each die and multipying with 1, 4, 16 and 96 respectively, then adding those numbers together, you find the number in the Chess960 numbering scheme.) The d8, d4, d6, d20 still give equal chance for all 960 positions, but with every position being represented in four different ways.
Or alternatively (using an additional die and different 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. With this method, every position is represented in 48 different ways.

Place the king between the rooks on the remaining three squares.


It is stated (but not proven) that this method (and the others) &quot;generat[e] random starting positions with equal probability&quot;.