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

Gary Wong points out that solosolver's verbose output is

Browse Source 
inconsistent in whether it numbers rows and columns from zero or
from one. Standardise on one.

[originally from svn r7385]
This commit is contained in:
Simon Tatham
2007-03-11 10:04:00 +00:00
parent d0a824540b
commit 4212ef4bd2
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
solo.c
View File

@ -1629,7 +1629,7 @@ static int solver(int c, int r, digit *grid, int maxdiff)
if (solver_show_working) { if (solver_show_working) {
char *sep = ""; char *sep = "";
printf("%*srecursing on (%d,%d) [", printf("%*srecursing on (%d,%d) [",
solver_recurse_depth*4, "", x, y); solver_recurse_depth*4, "", x + 1, y + 1);
for (i = 0; i < j; i++) { for (i = 0; i < j; i++) {
printf("%s%d", sep, list[i]); printf("%s%d", sep, list[i]);
sep = " or "; sep = " or ";
@ -1651,7 +1651,7 @@ static int solver(int c, int r, digit *grid, int maxdiff)
#ifdef STANDALONE_SOLVER #ifdef STANDALONE_SOLVER
if (solver_show_working) if (solver_show_working)
printf("%*sguessing %d at (%d,%d)\n", printf("%*sguessing %d at (%d,%d)\n",
solver_recurse_depth*4, "", list[i], x, y); solver_recurse_depth*4, "", list[i], x + 1, y + 1);
solver_recurse_depth++; solver_recurse_depth++;
#endif #endif
@ -1661,7 +1661,7 @@ static int solver(int c, int r, digit *grid, int maxdiff)
solver_recurse_depth--; solver_recurse_depth--;
if (solver_show_working) { if (solver_show_working) {
printf("%*sretracting %d at (%d,%d)\n", printf("%*sretracting %d at (%d,%d)\n",
solver_recurse_depth*4, "", list[i], x, y); solver_recurse_depth*4, "", list[i], x + 1, y + 1);
} }
#endif #endif