From bd5606ae74aa6b070d980230c56fe337a47bc4a7 Mon Sep 17 00:00:00 2001
From: Simon Tatham <anakin@pobox.com>
Date: Thu, 1 Sep 2005 12:17:14 +0000
Subject: [PATCH] Optimiser placation.

[originally from svn r6257]
---
 lightup.c | 1 +
 1 file changed, 1 insertion(+)

diff --git a/lightup.c b/lightup.c
index 7af44e3..ad5d669 100644
--- 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);