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

Fix an inaccurate comment.

Browse Source 
[originally from svn r7702]
This commit is contained in:
Simon Tatham
2007-08-25 15:50:33 +00:00
parent cb0901306d
commit f228c5ef00
1 changed files with 4 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
unfinished/divvy.c
View File

@ -113,14 +113,13 @@
* *
* When adding a square to an omino, this is precisely the * When adding a square to an omino, this is precisely the
* criterion which tells us that adding the square won't leave a * criterion which tells us that adding the square won't leave a
* hole in the middle of the omino. (There's no explicit * hole in the middle of the omino. (If it did, then things get
* requirement in the statement of our problem that the ominoes be * more complicated; see above.)
* simply connected, but we do know they must be all of equal size
* and so it's clear that we must avoid leaving holes, since a
* hole would necessarily be smaller than the maximum omino size.)
* *
* When removing a square from an omino, the _same_ criterion * When removing a square from an omino, the _same_ criterion
* tells us that removing the square won't disconnect the omino. * tells us that removing the square won't disconnect the omino.
* (This only works _because_ we've ensured the omino is simply
* connected.)
*/ */
static int addremcommon(int w, int h, int x, int y, int *own, int val) static int addremcommon(int w, int h, int x, int y, int *own, int val)
{ {