Optimiser placation.

[originally from svn r6257]

diff --git a/lightup.c b/lightup.c
index 7af44e3fee633c849632cc482eabd32920073ed5..ad5d669456f7e3ee0be78ec9ae094743555f207c 100644 (file)
--- a/lightup.c
+++ b/lightup.c
@@ -2306,6 +2306,7 @@ int main(int argc, char **argv)
     /* Run the solvers easiest to hardest until we find one that
      * can solve our puzzle. If it's soluble we know that the
      * hardest (recursive) solver will always find the solution. */
+    nsol = sflags = 0;
     for (diff = 0; diff <= DIFFCOUNT; diff++) {
         printf("\nSolving with difficulty %d.\n", diff);
         sflags = flags_from_difficulty(diff);