Placate optimiser.

[originally from svn r6171]

diff --git a/slant.c b/slant.c
index 173040924f930025d265a33ddbc926951d8fcde0..908d0e6fb4333df46f18e94796b2d477e8d3f2cd 100644 (file)
--- a/slant.c
+++ b/slant.c
@@ -1908,6 +1908,7 @@ int main(int argc, char **argv)
      * user with Hard-level deductions. For this reason, we grade
      * the puzzle internally before doing anything else.
      */
+    ret = -1;                         /* placate optimiser */
     for (diff = 0; diff < DIFFCOUNT; diff++) {
        ret = slant_solve(p->w, p->h, s->clues->clues,
                          s->soln, sc, diff);