zakarya/puzzles
1
0
Fork 0
mirror of git://git.tartarus.org/simon/puzzles.git synced 2025-04-21 16:05:44 -07:00
Code Issues Packages Projects Releases Wiki Activity

Optimiser placation.

Browse Source 
[originally from svn r6257]
This commit is contained in:
Simon Tatham
2005-09-01 12:17:14 +00:00
parent 643f468255
commit bd5606ae74
1 changed files with 1 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
lightup.c
View File

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