zakarya/puzzles
1
0
Fork 0
mirror of git://git.tartarus.org/simon/puzzles.git synced 2025-04-22 08:25:45 -07:00
Code Issues Packages Projects Releases Wiki Activity

The Windows RNG turns out to only give about 16 bits at a time. This

Browse Source 
is (a) pretty feeble, and (b) means that although Net seeds transfer
between platforms and still generate the same game, there's a
suspicious discrepancy in the typical seed _generated_ by each
platform.
I have a better RNG kicking around in this code base already, so
I'll just use it. Each midend has its own random_state, which it
passes to new_game_seed() as required. A handy consequence of this
is that initial seed data is now passed to midend_new(), which means
that new platform implementors are unlikely to forget to seed the
RNG because failure to do so causes a compile error!

[originally from svn r4187]
This commit is contained in:
Simon Tatham
2004-05-03 09:10:52 +00:00
parent 6e42ddd31b
commit aa9a8e8c7e
12 changed files with 39 additions and 45 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
fifteen.c
View File

@ -131,7 +131,7 @@ int perm_parity(int *perm, int n)
return ret;
}
char *new_game_seed(game_params *params)
char *new_game_seed(game_params *params, random_state *rs)
{
int gap, n, i, x;
int x1, x2, p1, p2, parity;
@ -149,7 +149,7 @@ char *new_game_seed(game_params *params)
used[i] = FALSE;
}
gap = rand_upto(n);
gap = random_upto(rs, n);
tiles[gap] = 0;
used[0] = TRUE;
@ -157,7 +157,7 @@ char *new_game_seed(game_params *params)
* Place everything else except the last two tiles.
*/
for (x = 0, i = n-1; i > 2; i--) {
int k = rand_upto(i);
int k = random_upto(rs, i);
int j;
for (j = 0; j < n; j++)