chiark
/
gitweb
/
~ian
/
sgt-puzzles.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
The Windows RNG turns out to only give about 16 bits at a time. This
[sgt-puzzles.git]
/
cube.c
diff --git
a/cube.c
b/cube.c
index 6c2658f520431704947e3187b17ef41f9db90fc6..ccc8689322849f3ec3c1d30083a45c2c7d9cee55 100644
(file)
--- a/
cube.c
+++ b/
cube.c
@@
-560,7
+560,7
@@
static void classify_grid_square_callback(void *ctx, struct grid_square *sq)
data->squareindex++;
}
data->squareindex++;
}
-char *new_game_seed(game_params *params)
+char *new_game_seed(game_params *params
, random_state *rs
)
{
struct grid_data data;
int i, j, k, m, area, facesperclass;
{
struct grid_data data;
int i, j, k, m, area, facesperclass;
@@
-605,7
+605,7
@@
char *new_game_seed(game_params *params)
for (i = 0; i < data.nclasses; i++) {
for (j = 0; j < facesperclass; j++) {
for (i = 0; i < data.nclasses; i++) {
for (j = 0; j < facesperclass; j++) {
- int n = rand
_upto(
data.nsquares[i]);
+ int n = rand
om_upto(rs,
data.nsquares[i]);
assert(!flags[data.gridptrs[i][n]]);
flags[data.gridptrs[i][n]] = TRUE;
assert(!flags[data.gridptrs[i][n]]);
flags[data.gridptrs[i][n]] = TRUE;
@@
-653,7
+653,7
@@
char *new_game_seed(game_params *params)
/*
* Choose a non-blue square for the polyhedron.
*/
/*
* Choose a non-blue square for the polyhedron.
*/
- sprintf(p, ":%d", data.gridptrs[0][rand
_upto(
m)]);
+ sprintf(p, ":%d", data.gridptrs[0][rand
om_upto(rs,
m)]);
sfree(data.gridptrs[0]);
sfree(flags);
sfree(data.gridptrs[0]);
sfree(flags);