aboutsummaryrefslogtreecommitdiff
path: root/unequal.c
diff options
context:
space:
mode:
authorSimon Tatham <anakin@pobox.com>2011-05-04 18:22:14 +0000
committerSimon Tatham <anakin@pobox.com>2011-05-04 18:22:14 +0000
commit2efc77d2fde7e53604f8490b57f18a36eec5c4fb (patch)
tree46b5441958cc8525ccd09f43c36dea9d0ea57d4c /unequal.c
parent4bab5e531b4b49c9b41d2140dd570d05947e7c40 (diff)
downloadpuzzles-2efc77d2fde7e53604f8490b57f18a36eec5c4fb.zip
puzzles-2efc77d2fde7e53604f8490b57f18a36eec5c4fb.tar.gz
puzzles-2efc77d2fde7e53604f8490b57f18a36eec5c4fb.tar.bz2
puzzles-2efc77d2fde7e53604f8490b57f18a36eec5c4fb.tar.xz
Fix warnings generated by gcc 4.6.0 about variables set but not
thereafter read. Most of these changes are just removal of pointless stuff or trivial reorganisations; one change is actually substantive, and fixes a bug in Keen's clue selection (the variable 'bad' was unreferenced not because I shouldn't have set it, but because I _should_ have referenced it!). [originally from svn r9164]
Diffstat (limited to 'unequal.c')
-rw-r--r--unequal.c7
1 files changed, 4 insertions, 3 deletions
diff --git a/unequal.c b/unequal.c
index 099f0f8..1c272da 100644
--- a/unequal.c
+++ b/unequal.c
@@ -951,7 +951,7 @@ static int gg_best_clue(game_state *state, int *scratch, digit *latin)
{
int ls = state->order * state->order * 5;
int maxposs = 0, minclues = 5, best = -1, i, j;
- int nposs, nclues, loc, x, y;
+ int nposs, nclues, loc;
#ifdef STANDALONE_SOLVER
if (solver_show_working) {
@@ -964,7 +964,6 @@ static int gg_best_clue(game_state *state, int *scratch, digit *latin)
if (!gg_place_clue(state, scratch[i], latin, 1)) continue;
loc = scratch[i] / 5;
- x = loc % state->order; y = loc / state->order;
for (j = nposs = 0; j < state->order; j++) {
if (state->hints[loc*state->order + j]) nposs++;
}
@@ -975,9 +974,11 @@ static int gg_best_clue(game_state *state, int *scratch, digit *latin)
(nposs == maxposs && nclues < minclues)) {
best = i; maxposs = nposs; minclues = nclues;
#ifdef STANDALONE_SOLVER
- if (solver_show_working)
+ if (solver_show_working) {
+ int x = loc % state->order, y = loc / state->order;
printf("gg_best_clue: b%d (%d,%d) new best [%d poss, %d clues].\n",
best, x+1, y+1, nposs, nclues);
+ }
#endif
}
}