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

Remove some legacy debugging code which was breaking the MinGW

Browse Source 
build, and which is redundant given the new standalone solver
functionality.

[originally from svn r5672]
This commit is contained in:
Simon Tatham
2005-04-25 14:37:33 +00:00
parent 0fffbf32db
commit 80129693bb
1 changed files with 0 additions and 51 deletions
Download Patch File Download Diff File Expand all files Collapse all files

51
solo.c
View File

@ -966,44 +966,6 @@ static char *new_game_seed(game_params *params, random_state *rs)
assert(ret == 1);
assert(check_valid(c, r, grid));
#ifdef DEBUG
memcpy(grid,
"\x0\x1\x0\x0\x6\x0\x0\x0\x0"
"\x5\x0\x0\x7\x0\x4\x0\x2\x0"
"\x0\x0\x6\x1\x0\x0\x0\x0\x0"
"\x8\x9\x7\x0\x0\x0\x0\x0\x0"
"\x0\x0\x3\x0\x4\x0\x9\x0\x0"
"\x0\x0\x0\x0\x0\x0\x8\x7\x6"
"\x0\x0\x0\x0\x0\x9\x1\x0\x0"
"\x0\x3\x0\x6\x0\x5\x0\x0\x7"
"\x0\x0\x0\x0\x8\x0\x0\x5\x0"
, area);
{
int y, x;
for (y = 0; y < cr; y++) {
for (x = 0; x < cr; x++) {
printf("%2.0d", grid[y*cr+x]);
}
printf("\n");
}
printf("\n");
}
nsolve(c, r, grid);
{
int y, x;
for (y = 0; y < cr; y++) {
for (x = 0; x < cr; x++) {
printf("%2.0d", grid[y*cr+x]);
}
printf("\n");
}
printf("\n");
}
#endif
/*
* Now we have a solved grid, start removing things from it
* while preserving solubility.
@ -1073,19 +1035,6 @@ static char *new_game_seed(game_params *params, random_state *rs)
sfree(grid2);
sfree(locs);
#ifdef DEBUG
{
int y, x;
for (y = 0; y < cr; y++) {
for (x = 0; x < cr; x++) {
printf("%2.0d", grid[y*cr+x]);
}
printf("\n");
}
printf("\n");
}
#endif
/*
* Now we have the grid as it will be presented to the user.
* Encode it in a game seed.