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

Tidy up comments.

Browse Source 
[originally from svn r6601]
This commit is contained in:
Simon Tatham
2006-03-12 09:06:27 +00:00
parent 27160f7ad2
commit 3575c3df79
1 changed files with 5 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
slant.c
View File

@ -287,7 +287,10 @@ struct solver_scratch {
* below it might form a <-shape between them * below it might form a <-shape between them
* *
* Any starting 1 or 3 clue rules out four bits in this array * Any starting 1 or 3 clue rules out four bits in this array
* immediately; we can rule out further bits during play using * immediately; a 2 clue propagates any ruled-out bit past it
* (if the two squares on one side of a 2 cannot be a v-shape,
* then neither can the two on the other side be the same
* v-shape); we can rule out further bits during play using
* partially filled 2 clues; whenever a pair of squares is * partially filled 2 clues; whenever a pair of squares is
* known not to be _either_ kind of v-shape, we can mark them * known not to be _either_ kind of v-shape, we can mark them
* as equivalent. * as equivalent.
@ -486,7 +489,7 @@ static int slant_solve(int w, int h, const signed char *clues,
memset(sc->vbitmap, 0xF, w*h); memset(sc->vbitmap, 0xF, w*h);
/* /*
* Initialise the `exits' and `border' arrays. Theses is used * Initialise the `exits' and `border' arrays. These are used
* to do second-order loop avoidance: the dual of the no loops * to do second-order loop avoidance: the dual of the no loops
* constraint is that every point must be somehow connected to * constraint is that every point must be somehow connected to
* the border of the grid (otherwise there would be a solid * the border of the grid (otherwise there would be a solid