This is probably more of a mathematical question than a Go question.
I want to experiment with playing a game from a semi-random starting position. To be more specific, each player gets a few (say 3) randomly-placed stones with the following tentative rules:
- no 1st or 2nd lines (making the initial placement space 15 x 15)
- no non-diagonal neighbors (if a stone is to be placed next to another one, we could “push” it away from the existing one? If it exactly coincides, i don’t know what to do.)
To play such a game in OGS requires an algorithm to generate a starting position from unique data, so each player can independently generate the same position and place the stones to start the game. Each game in OGS seems to have a unique 8-digit ID in URL. What are some ways to generate the starting position from the ID or with other data (such as GMT?)? Is such a thing even reasonable mathematically?
In short, I guess I need an algorithm that calculates a certain number (say 3 stones * 2 players = 6) of pairs (coordinates on Go board) of base-15 numbers from base-10 numbers (possibly also with alphabets, using some topical keyword?), with a method to resolve collision.