2 * rect.c: Puzzle from nikoli.co.jp. You have a square grid with
3 * numbers in some squares; you must divide the square grid up into
4 * variously sized rectangles, such that every rectangle contains
5 * exactly one numbered square and the area of each rectangle is
6 * equal to the number contained in it.
12 * - Improve on singleton removal by making an aesthetic choice
13 * about which of the options to take.
15 * - When doing the 3x3 trick in singleton removal, limit the size
16 * of the generated rectangles in accordance with the max
19 * - If we start by sorting the rectlist in descending order
20 * of area, we might be able to bias our random number
21 * selection to produce a few large rectangles more often
22 * than oodles of small ones? Unsure, but might be worth a
51 #define INDEX(state, x, y) (((y) * (state)->w) + (x))
52 #define index(state, a, x, y) ((a) [ INDEX(state,x,y) ])
53 #define grid(state,x,y) index(state, (state)->grid, x, y)
54 #define vedge(state,x,y) index(state, (state)->vedge, x, y)
55 #define hedge(state,x,y) index(state, (state)->hedge, x, y)
57 #define CRANGE(state,x,y,dx,dy) ( (x) >= dx && (x) < (state)->w && \
58 (y) >= dy && (y) < (state)->h )
59 #define RANGE(state,x,y) CRANGE(state,x,y,0,0)
60 #define HRANGE(state,x,y) CRANGE(state,x,y,0,1)
61 #define VRANGE(state,x,y) CRANGE(state,x,y,1,0)
66 #define CORNER_TOLERANCE 0.15F
67 #define CENTRE_TOLERANCE 0.15F
69 #define FLASH_TIME 0.13F
71 #define COORD(x) ( (x) * TILE_SIZE + BORDER )
72 #define FROMCOORD(x) ( ((x) - BORDER) / TILE_SIZE )
76 int *grid
; /* contains the numbers */
77 unsigned char *vedge
; /* (w+1) x h */
78 unsigned char *hedge
; /* w x (h+1) */
79 int completed
, cheated
;
82 static game_params
*default_params(void)
84 game_params
*ret
= snew(game_params
);
87 ret
->expandfactor
= 0.0F
;
93 static int game_fetch_preset(int i
, char **name
, game_params
**params
)
100 case 0: w
= 7, h
= 7; break;
101 case 1: w
= 11, h
= 11; break;
102 case 2: w
= 15, h
= 15; break;
103 case 3: w
= 19, h
= 19; break;
104 default: return FALSE
;
107 sprintf(buf
, "%dx%d", w
, h
);
109 *params
= ret
= snew(game_params
);
112 ret
->expandfactor
= 0.0F
;
117 static void free_params(game_params
*params
)
122 static game_params
*dup_params(game_params
*params
)
124 game_params
*ret
= snew(game_params
);
125 *ret
= *params
; /* structure copy */
129 static void decode_params(game_params
*ret
, char const *string
)
131 ret
->w
= ret
->h
= atoi(string
);
132 while (*string
&& isdigit((unsigned char)*string
)) string
++;
133 if (*string
== 'x') {
135 ret
->h
= atoi(string
);
136 while (*string
&& isdigit((unsigned char)*string
)) string
++;
138 if (*string
== 'e') {
140 ret
->expandfactor
= atof(string
);
142 (*string
== '.' || isdigit((unsigned char)*string
))) string
++;
144 if (*string
== 'a') {
150 static char *encode_params(game_params
*params
, int full
)
154 sprintf(data
, "%dx%d", params
->w
, params
->h
);
155 if (full
&& params
->expandfactor
)
156 sprintf(data
+ strlen(data
), "e%g", params
->expandfactor
);
157 if (full
&& !params
->unique
)
163 static config_item
*game_configure(game_params
*params
)
168 ret
= snewn(5, config_item
);
170 ret
[0].name
= "Width";
171 ret
[0].type
= C_STRING
;
172 sprintf(buf
, "%d", params
->w
);
173 ret
[0].sval
= dupstr(buf
);
176 ret
[1].name
= "Height";
177 ret
[1].type
= C_STRING
;
178 sprintf(buf
, "%d", params
->h
);
179 ret
[1].sval
= dupstr(buf
);
182 ret
[2].name
= "Expansion factor";
183 ret
[2].type
= C_STRING
;
184 sprintf(buf
, "%g", params
->expandfactor
);
185 ret
[2].sval
= dupstr(buf
);
188 ret
[3].name
= "Ensure unique solution";
189 ret
[3].type
= C_BOOLEAN
;
191 ret
[3].ival
= params
->unique
;
201 static game_params
*custom_params(config_item
*cfg
)
203 game_params
*ret
= snew(game_params
);
205 ret
->w
= atoi(cfg
[0].sval
);
206 ret
->h
= atoi(cfg
[1].sval
);
207 ret
->expandfactor
= atof(cfg
[2].sval
);
208 ret
->unique
= cfg
[3].ival
;
213 static char *validate_params(game_params
*params
)
215 if (params
->w
<= 0 && params
->h
<= 0)
216 return "Width and height must both be greater than zero";
217 if (params
->w
< 2 && params
->h
< 2)
218 return "Grid area must be greater than one";
219 if (params
->expandfactor
< 0.0F
)
220 return "Expansion factor may not be negative";
241 struct point
*points
;
244 /* ----------------------------------------------------------------------
245 * Solver for Rectangles games.
247 * This solver is souped up beyond the needs of actually _solving_
248 * a puzzle. It is also designed to cope with uncertainty about
249 * where the numbers have been placed. This is because I run it on
250 * my generated grids _before_ placing the numbers, and have it
251 * tell me where I need to place the numbers to ensure a unique
255 static void remove_rect_placement(int w
, int h
,
256 struct rectlist
*rectpositions
,
258 int rectnum
, int placement
)
262 #ifdef SOLVER_DIAGNOSTICS
263 printf("ruling out rect %d placement at %d,%d w=%d h=%d\n", rectnum
,
264 rectpositions
[rectnum
].rects
[placement
].x
,
265 rectpositions
[rectnum
].rects
[placement
].y
,
266 rectpositions
[rectnum
].rects
[placement
].w
,
267 rectpositions
[rectnum
].rects
[placement
].h
);
271 * Decrement each entry in the overlaps array to reflect the
272 * removal of this rectangle placement.
274 for (yy
= 0; yy
< rectpositions
[rectnum
].rects
[placement
].h
; yy
++) {
275 y
= yy
+ rectpositions
[rectnum
].rects
[placement
].y
;
276 for (xx
= 0; xx
< rectpositions
[rectnum
].rects
[placement
].w
; xx
++) {
277 x
= xx
+ rectpositions
[rectnum
].rects
[placement
].x
;
279 assert(overlaps
[(rectnum
* h
+ y
) * w
+ x
] != 0);
281 if (overlaps
[(rectnum
* h
+ y
) * w
+ x
] > 0)
282 overlaps
[(rectnum
* h
+ y
) * w
+ x
]--;
287 * Remove the placement from the list of positions for that
288 * rectangle, by interchanging it with the one on the end.
290 if (placement
< rectpositions
[rectnum
].n
- 1) {
293 t
= rectpositions
[rectnum
].rects
[rectpositions
[rectnum
].n
- 1];
294 rectpositions
[rectnum
].rects
[rectpositions
[rectnum
].n
- 1] =
295 rectpositions
[rectnum
].rects
[placement
];
296 rectpositions
[rectnum
].rects
[placement
] = t
;
298 rectpositions
[rectnum
].n
--;
301 static void remove_number_placement(int w
, int h
, struct numberdata
*number
,
302 int index
, int *rectbyplace
)
305 * Remove the entry from the rectbyplace array.
307 rectbyplace
[number
->points
[index
].y
* w
+ number
->points
[index
].x
] = -1;
310 * Remove the placement from the list of candidates for that
311 * number, by interchanging it with the one on the end.
313 if (index
< number
->npoints
- 1) {
316 t
= number
->points
[number
->npoints
- 1];
317 number
->points
[number
->npoints
- 1] = number
->points
[index
];
318 number
->points
[index
] = t
;
323 static int rect_solver(int w
, int h
, int nrects
, struct numberdata
*numbers
,
326 struct rectlist
*rectpositions
;
327 int *overlaps
, *rectbyplace
, *workspace
;
331 * Start by setting up a list of candidate positions for each
334 rectpositions
= snewn(nrects
, struct rectlist
);
335 for (i
= 0; i
< nrects
; i
++) {
336 int rw
, rh
, area
= numbers
[i
].area
;
337 int j
, minx
, miny
, maxx
, maxy
;
339 int rlistn
, rlistsize
;
342 * For each rectangle, begin by finding the bounding
343 * rectangle of its candidate number placements.
348 for (j
= 0; j
< numbers
[i
].npoints
; j
++) {
349 if (minx
> numbers
[i
].points
[j
].x
) minx
= numbers
[i
].points
[j
].x
;
350 if (miny
> numbers
[i
].points
[j
].y
) miny
= numbers
[i
].points
[j
].y
;
351 if (maxx
< numbers
[i
].points
[j
].x
) maxx
= numbers
[i
].points
[j
].x
;
352 if (maxy
< numbers
[i
].points
[j
].y
) maxy
= numbers
[i
].points
[j
].y
;
356 * Now loop over all possible rectangle placements
357 * overlapping a point within that bounding rectangle;
358 * ensure each one actually contains a candidate number
359 * placement, and add it to the list.
362 rlistn
= rlistsize
= 0;
364 for (rw
= 1; rw
<= area
&& rw
<= w
; rw
++) {
373 for (y
= miny
- rh
+ 1; y
<= maxy
; y
++) {
374 if (y
< 0 || y
+rh
> h
)
377 for (x
= minx
- rw
+ 1; x
<= maxx
; x
++) {
378 if (x
< 0 || x
+rw
> w
)
382 * See if we can find a candidate number
383 * placement within this rectangle.
385 for (j
= 0; j
< numbers
[i
].npoints
; j
++)
386 if (numbers
[i
].points
[j
].x
>= x
&&
387 numbers
[i
].points
[j
].x
< x
+rw
&&
388 numbers
[i
].points
[j
].y
>= y
&&
389 numbers
[i
].points
[j
].y
< y
+rh
)
392 if (j
< numbers
[i
].npoints
) {
394 * Add this to the list of candidate
395 * placements for this rectangle.
397 if (rlistn
>= rlistsize
) {
398 rlistsize
= rlistn
+ 32;
399 rlist
= sresize(rlist
, rlistsize
, struct rect
);
403 rlist
[rlistn
].w
= rw
;
404 rlist
[rlistn
].h
= rh
;
405 #ifdef SOLVER_DIAGNOSTICS
406 printf("rect %d [area %d]: candidate position at"
407 " %d,%d w=%d h=%d\n",
408 i
, area
, x
, y
, rw
, rh
);
416 rectpositions
[i
].rects
= rlist
;
417 rectpositions
[i
].n
= rlistn
;
421 * Next, construct a multidimensional array tracking how many
422 * candidate positions for each rectangle overlap each square.
424 * Indexing of this array is by the formula
426 * overlaps[(rectindex * h + y) * w + x]
428 overlaps
= snewn(nrects
* w
* h
, int);
429 memset(overlaps
, 0, nrects
* w
* h
* sizeof(int));
430 for (i
= 0; i
< nrects
; i
++) {
433 for (j
= 0; j
< rectpositions
[i
].n
; j
++) {
436 for (yy
= 0; yy
< rectpositions
[i
].rects
[j
].h
; yy
++)
437 for (xx
= 0; xx
< rectpositions
[i
].rects
[j
].w
; xx
++)
438 overlaps
[(i
* h
+ yy
+rectpositions
[i
].rects
[j
].y
) * w
+
439 xx
+rectpositions
[i
].rects
[j
].x
]++;
444 * Also we want an array covering the grid once, to make it
445 * easy to figure out which squares are candidate number
446 * placements for which rectangles. (The existence of this
447 * single array assumes that no square starts off as a
448 * candidate number placement for more than one rectangle. This
449 * assumption is justified, because this solver is _either_
450 * used to solve real problems - in which case there is a
451 * single placement for every number - _or_ used to decide on
452 * number placements for a new puzzle, in which case each
453 * number's placements are confined to the intended position of
454 * the rectangle containing that number.)
456 rectbyplace
= snewn(w
* h
, int);
457 for (i
= 0; i
< w
*h
; i
++)
460 for (i
= 0; i
< nrects
; i
++) {
463 for (j
= 0; j
< numbers
[i
].npoints
; j
++) {
464 int x
= numbers
[i
].points
[j
].x
;
465 int y
= numbers
[i
].points
[j
].y
;
467 assert(rectbyplace
[y
* w
+ x
] == -1);
468 rectbyplace
[y
* w
+ x
] = i
;
472 workspace
= snewn(nrects
, int);
475 * Now run the actual deduction loop.
478 int done_something
= FALSE
;
480 #ifdef SOLVER_DIAGNOSTICS
481 printf("starting deduction loop\n");
483 for (i
= 0; i
< nrects
; i
++) {
484 printf("rect %d overlaps:\n", i
);
487 for (y
= 0; y
< h
; y
++) {
488 for (x
= 0; x
< w
; x
++) {
489 printf("%3d", overlaps
[(i
* h
+ y
) * w
+ x
]);
495 printf("rectbyplace:\n");
498 for (y
= 0; y
< h
; y
++) {
499 for (x
= 0; x
< w
; x
++) {
500 printf("%3d", rectbyplace
[y
* w
+ x
]);
508 * Housekeeping. Look for rectangles whose number has only
509 * one candidate position left, and mark that square as
510 * known if it isn't already.
512 for (i
= 0; i
< nrects
; i
++) {
513 if (numbers
[i
].npoints
== 1) {
514 int x
= numbers
[i
].points
[0].x
;
515 int y
= numbers
[i
].points
[0].y
;
516 if (overlaps
[(i
* h
+ y
) * w
+ x
] >= -1) {
519 assert(overlaps
[(i
* h
+ y
) * w
+ x
] > 0);
520 #ifdef SOLVER_DIAGNOSTICS
521 printf("marking %d,%d as known for rect %d"
522 " (sole remaining number position)\n", x
, y
, i
);
525 for (j
= 0; j
< nrects
; j
++)
526 overlaps
[(j
* h
+ y
) * w
+ x
] = -1;
528 overlaps
[(i
* h
+ y
) * w
+ x
] = -2;
534 * Now look at the intersection of all possible placements
535 * for each rectangle, and mark all squares in that
536 * intersection as known for that rectangle if they aren't
539 for (i
= 0; i
< nrects
; i
++) {
540 int minx
, miny
, maxx
, maxy
, xx
, yy
, j
;
546 for (j
= 0; j
< rectpositions
[i
].n
; j
++) {
547 int x
= rectpositions
[i
].rects
[j
].x
;
548 int y
= rectpositions
[i
].rects
[j
].y
;
549 int w
= rectpositions
[i
].rects
[j
].w
;
550 int h
= rectpositions
[i
].rects
[j
].h
;
552 if (minx
< x
) minx
= x
;
553 if (miny
< y
) miny
= y
;
554 if (maxx
> x
+w
) maxx
= x
+w
;
555 if (maxy
> y
+h
) maxy
= y
+h
;
558 for (yy
= miny
; yy
< maxy
; yy
++)
559 for (xx
= minx
; xx
< maxx
; xx
++)
560 if (overlaps
[(i
* h
+ yy
) * w
+ xx
] >= -1) {
561 assert(overlaps
[(i
* h
+ yy
) * w
+ xx
] > 0);
562 #ifdef SOLVER_DIAGNOSTICS
563 printf("marking %d,%d as known for rect %d"
564 " (intersection of all placements)\n",
568 for (j
= 0; j
< nrects
; j
++)
569 overlaps
[(j
* h
+ yy
) * w
+ xx
] = -1;
571 overlaps
[(i
* h
+ yy
) * w
+ xx
] = -2;
576 * Rectangle-focused deduction. Look at each rectangle in
577 * turn and try to rule out some of its candidate
580 for (i
= 0; i
< nrects
; i
++) {
583 for (j
= 0; j
< rectpositions
[i
].n
; j
++) {
587 for (k
= 0; k
< nrects
; k
++)
590 for (yy
= 0; yy
< rectpositions
[i
].rects
[j
].h
; yy
++) {
591 int y
= yy
+ rectpositions
[i
].rects
[j
].y
;
592 for (xx
= 0; xx
< rectpositions
[i
].rects
[j
].w
; xx
++) {
593 int x
= xx
+ rectpositions
[i
].rects
[j
].x
;
595 if (overlaps
[(i
* h
+ y
) * w
+ x
] == -1) {
597 * This placement overlaps a square
598 * which is _known_ to be part of
599 * another rectangle. Therefore we must
602 #ifdef SOLVER_DIAGNOSTICS
603 printf("rect %d placement at %d,%d w=%d h=%d "
604 "contains %d,%d which is known-other\n", i
,
605 rectpositions
[i
].rects
[j
].x
,
606 rectpositions
[i
].rects
[j
].y
,
607 rectpositions
[i
].rects
[j
].w
,
608 rectpositions
[i
].rects
[j
].h
,
614 if (rectbyplace
[y
* w
+ x
] != -1) {
616 * This placement overlaps one of the
617 * candidate number placements for some
618 * rectangle. Count it.
620 workspace
[rectbyplace
[y
* w
+ x
]]++;
627 * If we haven't ruled this placement out
628 * already, see if it overlaps _all_ of the
629 * candidate number placements for any
630 * rectangle. If so, we can rule it out.
632 for (k
= 0; k
< nrects
; k
++)
633 if (k
!= i
&& workspace
[k
] == numbers
[k
].npoints
) {
634 #ifdef SOLVER_DIAGNOSTICS
635 printf("rect %d placement at %d,%d w=%d h=%d "
636 "contains all number points for rect %d\n",
638 rectpositions
[i
].rects
[j
].x
,
639 rectpositions
[i
].rects
[j
].y
,
640 rectpositions
[i
].rects
[j
].w
,
641 rectpositions
[i
].rects
[j
].h
,
649 * Failing that, see if it overlaps at least
650 * one of the candidate number placements for
651 * itself! (This might not be the case if one
652 * of those number placements has been removed
655 if (!del
&& workspace
[i
] == 0) {
656 #ifdef SOLVER_DIAGNOSTICS
657 printf("rect %d placement at %d,%d w=%d h=%d "
658 "contains none of its own number points\n",
660 rectpositions
[i
].rects
[j
].x
,
661 rectpositions
[i
].rects
[j
].y
,
662 rectpositions
[i
].rects
[j
].w
,
663 rectpositions
[i
].rects
[j
].h
);
670 remove_rect_placement(w
, h
, rectpositions
, overlaps
, i
, j
);
672 j
--; /* don't skip over next placement */
674 done_something
= TRUE
;
680 * Square-focused deduction. Look at each square not marked
681 * as known, and see if there are any which can only be
682 * part of a single rectangle.
686 for (y
= 0; y
< h
; y
++) for (x
= 0; x
< w
; x
++) {
687 /* Known squares are marked as <0 everywhere, so we only need
688 * to check the overlaps entry for rect 0. */
689 if (overlaps
[y
* w
+ x
] < 0)
690 continue; /* known already */
694 for (i
= 0; i
< nrects
; i
++)
695 if (overlaps
[(i
* h
+ y
) * w
+ x
] > 0)
702 * Now we can rule out all placements for
703 * rectangle `index' which _don't_ contain
706 #ifdef SOLVER_DIAGNOSTICS
707 printf("square %d,%d can only be in rectangle %d\n",
710 for (j
= 0; j
< rectpositions
[index
].n
; j
++) {
711 struct rect
*r
= &rectpositions
[index
].rects
[j
];
712 if (x
>= r
->x
&& x
< r
->x
+ r
->w
&&
713 y
>= r
->y
&& y
< r
->y
+ r
->h
)
714 continue; /* this one is OK */
715 remove_rect_placement(w
, h
, rectpositions
, overlaps
,
717 j
--; /* don't skip over next placement */
718 done_something
= TRUE
;
725 * If we've managed to deduce anything by normal means,
726 * loop round again and see if there's more to be done.
727 * Only if normal deduction has completely failed us should
728 * we now move on to narrowing down the possible number
735 * Now we have done everything we can with the current set
736 * of number placements. So we need to winnow the number
737 * placements so as to narrow down the possibilities. We do
738 * this by searching for a candidate placement (of _any_
739 * rectangle) which overlaps a candidate placement of the
740 * number for some other rectangle.
748 int nrpns
= 0, rpnsize
= 0;
751 for (i
= 0; i
< nrects
; i
++) {
752 for (j
= 0; j
< rectpositions
[i
].n
; j
++) {
755 for (yy
= 0; yy
< rectpositions
[i
].rects
[j
].h
; yy
++) {
756 int y
= yy
+ rectpositions
[i
].rects
[j
].y
;
757 for (xx
= 0; xx
< rectpositions
[i
].rects
[j
].w
; xx
++) {
758 int x
= xx
+ rectpositions
[i
].rects
[j
].x
;
760 if (rectbyplace
[y
* w
+ x
] >= 0 &&
761 rectbyplace
[y
* w
+ x
] != i
) {
763 * Add this to the list of
764 * winnowing possibilities.
766 if (nrpns
>= rpnsize
) {
767 rpnsize
= rpnsize
* 3 / 2 + 32;
768 rpns
= sresize(rpns
, rpnsize
, struct rpn
);
770 rpns
[nrpns
].rect
= i
;
771 rpns
[nrpns
].placement
= j
;
772 rpns
[nrpns
].number
= rectbyplace
[y
* w
+ x
];
781 #ifdef SOLVER_DIAGNOSTICS
782 printf("%d candidate rect placements we could eliminate\n", nrpns
);
786 * Now choose one of these unwanted rectangle
787 * placements, and eliminate it.
789 int index
= random_upto(rs
, nrpns
);
791 struct rpn rpn
= rpns
[index
];
798 r
= rectpositions
[i
].rects
[j
];
801 * We rule out placement j of rectangle i by means
802 * of removing all of rectangle k's candidate
803 * number placements which do _not_ overlap it.
804 * This will ensure that it is eliminated during
805 * the next pass of rectangle-focused deduction.
807 #ifdef SOLVER_DIAGNOSTICS
808 printf("ensuring number for rect %d is within"
809 " rect %d's placement at %d,%d w=%d h=%d\n",
810 k
, i
, r
.x
, r
.y
, r
.w
, r
.h
);
813 for (m
= 0; m
< numbers
[k
].npoints
; m
++) {
814 int x
= numbers
[k
].points
[m
].x
;
815 int y
= numbers
[k
].points
[m
].y
;
817 if (x
< r
.x
|| x
>= r
.x
+ r
.w
||
818 y
< r
.y
|| y
>= r
.y
+ r
.h
) {
819 #ifdef SOLVER_DIAGNOSTICS
820 printf("eliminating number for rect %d at %d,%d\n",
823 remove_number_placement(w
, h
, &numbers
[k
],
825 m
--; /* don't skip the next one */
826 done_something
= TRUE
;
832 if (!done_something
) {
833 #ifdef SOLVER_DIAGNOSTICS
834 printf("terminating deduction loop\n");
841 for (i
= 0; i
< nrects
; i
++) {
842 #ifdef SOLVER_DIAGNOSTICS
843 printf("rect %d has %d possible placements\n",
844 i
, rectpositions
[i
].n
);
846 assert(rectpositions
[i
].n
> 0);
847 if (rectpositions
[i
].n
> 1)
852 * Free up all allocated storage.
857 for (i
= 0; i
< nrects
; i
++)
858 sfree(rectpositions
[i
].rects
);
859 sfree(rectpositions
);
864 /* ----------------------------------------------------------------------
865 * Grid generation code.
868 static struct rectlist
*get_rectlist(game_params
*params
, int *grid
)
873 struct rect
*rects
= NULL
;
874 int nrects
= 0, rectsize
= 0;
877 * Maximum rectangle area is 1/6 of total grid size, unless
878 * this means we can't place any rectangles at all in which
879 * case we set it to 2 at minimum.
881 maxarea
= params
->w
* params
->h
/ 6;
885 for (rw
= 1; rw
<= params
->w
; rw
++)
886 for (rh
= 1; rh
<= params
->h
; rh
++) {
887 if (rw
* rh
> maxarea
)
891 for (x
= 0; x
<= params
->w
- rw
; x
++)
892 for (y
= 0; y
<= params
->h
- rh
; y
++) {
893 if (nrects
>= rectsize
) {
894 rectsize
= nrects
+ 256;
895 rects
= sresize(rects
, rectsize
, struct rect
);
900 rects
[nrects
].w
= rw
;
901 rects
[nrects
].h
= rh
;
907 struct rectlist
*ret
;
908 ret
= snew(struct rectlist
);
913 assert(rects
== NULL
); /* hence no need to free */
918 static void free_rectlist(struct rectlist
*list
)
924 static void place_rect(game_params
*params
, int *grid
, struct rect r
)
926 int idx
= INDEX(params
, r
.x
, r
.y
);
929 for (x
= r
.x
; x
< r
.x
+r
.w
; x
++)
930 for (y
= r
.y
; y
< r
.y
+r
.h
; y
++) {
931 index(params
, grid
, x
, y
) = idx
;
933 #ifdef GENERATION_DIAGNOSTICS
934 printf(" placing rectangle at (%d,%d) size %d x %d\n",
939 static struct rect
find_rect(game_params
*params
, int *grid
, int x
, int y
)
945 * Find the top left of the rectangle.
947 idx
= index(params
, grid
, x
, y
);
953 return r
; /* 1x1 singleton here */
960 * Find the width and height of the rectangle.
963 (x
+w
< params
->w
&& index(params
,grid
,x
+w
,y
)==idx
);
966 (y
+h
< params
->h
&& index(params
,grid
,x
,y
+h
)==idx
);
977 #ifdef GENERATION_DIAGNOSTICS
978 static void display_grid(game_params
*params
, int *grid
, int *numbers
, int all
)
980 unsigned char *egrid
= snewn((params
->w
*2+3) * (params
->h
*2+3),
983 int r
= (params
->w
*2+3);
985 memset(egrid
, 0, (params
->w
*2+3) * (params
->h
*2+3));
987 for (x
= 0; x
< params
->w
; x
++)
988 for (y
= 0; y
< params
->h
; y
++) {
989 int i
= index(params
, grid
, x
, y
);
990 if (x
== 0 || index(params
, grid
, x
-1, y
) != i
)
991 egrid
[(2*y
+2) * r
+ (2*x
+1)] = 1;
992 if (x
== params
->w
-1 || index(params
, grid
, x
+1, y
) != i
)
993 egrid
[(2*y
+2) * r
+ (2*x
+3)] = 1;
994 if (y
== 0 || index(params
, grid
, x
, y
-1) != i
)
995 egrid
[(2*y
+1) * r
+ (2*x
+2)] = 1;
996 if (y
== params
->h
-1 || index(params
, grid
, x
, y
+1) != i
)
997 egrid
[(2*y
+3) * r
+ (2*x
+2)] = 1;
1000 for (y
= 1; y
< 2*params
->h
+2; y
++) {
1001 for (x
= 1; x
< 2*params
->w
+2; x
++) {
1003 int k
= numbers ?
index(params
, numbers
, x
/2-1, y
/2-1) : 0;
1004 if (k
|| (all
&& numbers
)) printf("%2d", k
); else printf(" ");
1005 } else if (!((y
&x
)&1)) {
1006 int v
= egrid
[y
*r
+x
];
1007 if ((y
&1) && v
) v
= '-';
1008 if ((x
&1) && v
) v
= '|';
1011 if (!(x
&1)) putchar(v
);
1014 if (egrid
[y
*r
+(x
+1)]) d
|= 1;
1015 if (egrid
[(y
-1)*r
+x
]) d
|= 2;
1016 if (egrid
[y
*r
+(x
-1)]) d
|= 4;
1017 if (egrid
[(y
+1)*r
+x
]) d
|= 8;
1018 c
= " ??+?-++?+|+++++"[d
];
1020 if (!(x
&1)) putchar(c
);
1030 struct game_aux_info
{
1032 unsigned char *vedge
; /* (w+1) x h */
1033 unsigned char *hedge
; /* w x (h+1) */
1036 static char *new_game_desc(game_params
*params
, random_state
*rs
,
1037 game_aux_info
**aux
)
1039 int *grid
, *numbers
= NULL
;
1040 struct rectlist
*list
;
1041 int x
, y
, y2
, y2last
, yx
, run
, i
;
1043 game_params params2real
, *params2
= ¶ms2real
;
1047 * Set up the smaller width and height which we will use to
1048 * generate the base grid.
1050 params2
->w
= params
->w
/ (1.0F
+ params
->expandfactor
);
1051 if (params2
->w
< 2 && params
->w
>= 2) params2
->w
= 2;
1052 params2
->h
= params
->h
/ (1.0F
+ params
->expandfactor
);
1053 if (params2
->h
< 2 && params
->h
>= 2) params2
->h
= 2;
1055 grid
= snewn(params2
->w
* params2
->h
, int);
1057 for (y
= 0; y
< params2
->h
; y
++)
1058 for (x
= 0; x
< params2
->w
; x
++) {
1059 index(params2
, grid
, x
, y
) = -1;
1062 list
= get_rectlist(params2
, grid
);
1063 assert(list
!= NULL
);
1066 * Place rectangles until we can't any more.
1068 while (list
->n
> 0) {
1073 * Pick a random rectangle.
1075 i
= random_upto(rs
, list
->n
);
1081 place_rect(params2
, grid
, r
);
1084 * Winnow the list by removing any rectangles which
1088 for (i
= 0; i
< list
->n
; i
++) {
1089 struct rect s
= list
->rects
[i
];
1090 if (s
.x
+s
.w
<= r
.x
|| r
.x
+r
.w
<= s
.x
||
1091 s
.y
+s
.h
<= r
.y
|| r
.y
+r
.h
<= s
.y
)
1092 list
->rects
[m
++] = s
;
1097 free_rectlist(list
);
1100 * Deal with singleton spaces remaining in the grid, one by
1103 * We do this by making a local change to the layout. There are
1104 * several possibilities:
1106 * +-----+-----+ Here, we can remove the singleton by
1107 * | | | extending the 1x2 rectangle below it
1108 * +--+--+-----+ into a 1x3.
1116 * +--+--+--+ Here, that trick doesn't work: there's no
1117 * | | | 1 x n rectangle with the singleton at one
1118 * | | | end. Instead, we extend a 1 x n rectangle
1119 * | | | _out_ from the singleton, shaving a layer
1120 * +--+--+ | off the end of another rectangle. So if we
1121 * | | | | extended up, we'd make our singleton part
1122 * | +--+--+ of a 1x3 and generate a 1x2 where the 2x2
1123 * | | | used to be; or we could extend right into
1124 * +--+-----+ a 2x1, turning the 1x3 into a 1x2.
1126 * +-----+--+ Here, we can't even do _that_, since any
1127 * | | | direction we choose to extend the singleton
1128 * +--+--+ | will produce a new singleton as a result of
1129 * | | | | truncating one of the size-2 rectangles.
1130 * | +--+--+ Fortunately, this case can _only_ occur when
1131 * | | | a singleton is surrounded by four size-2s
1132 * +--+-----+ in this fashion; so instead we can simply
1133 * replace the whole section with a single 3x3.
1135 for (x
= 0; x
< params2
->w
; x
++) {
1136 for (y
= 0; y
< params2
->h
; y
++) {
1137 if (index(params2
, grid
, x
, y
) < 0) {
1140 #ifdef GENERATION_DIAGNOSTICS
1141 display_grid(params2
, grid
, NULL
, FALSE
);
1142 printf("singleton at %d,%d\n", x
, y
);
1146 * Check in which directions we can feasibly extend
1147 * the singleton. We can extend in a particular
1148 * direction iff either:
1150 * - the rectangle on that side of the singleton
1151 * is not 2x1, and we are at one end of the edge
1152 * of it we are touching
1154 * - it is 2x1 but we are on its short side.
1156 * FIXME: we could plausibly choose between these
1157 * based on the sizes of the rectangles they would
1161 if (x
< params2
->w
-1) {
1162 struct rect r
= find_rect(params2
, grid
, x
+1, y
);
1163 if ((r
.w
* r
.h
> 2 && (r
.y
==y
|| r
.y
+r
.h
-1==y
)) || r
.h
==1)
1164 dirs
[ndirs
++] = 1; /* right */
1167 struct rect r
= find_rect(params2
, grid
, x
, y
-1);
1168 if ((r
.w
* r
.h
> 2 && (r
.x
==x
|| r
.x
+r
.w
-1==x
)) || r
.w
==1)
1169 dirs
[ndirs
++] = 2; /* up */
1172 struct rect r
= find_rect(params2
, grid
, x
-1, y
);
1173 if ((r
.w
* r
.h
> 2 && (r
.y
==y
|| r
.y
+r
.h
-1==y
)) || r
.h
==1)
1174 dirs
[ndirs
++] = 4; /* left */
1176 if (y
< params2
->h
-1) {
1177 struct rect r
= find_rect(params2
, grid
, x
, y
+1);
1178 if ((r
.w
* r
.h
> 2 && (r
.x
==x
|| r
.x
+r
.w
-1==x
)) || r
.w
==1)
1179 dirs
[ndirs
++] = 8; /* down */
1186 which
= random_upto(rs
, ndirs
);
1191 assert(x
< params2
->w
+1);
1192 #ifdef GENERATION_DIAGNOSTICS
1193 printf("extending right\n");
1195 r1
= find_rect(params2
, grid
, x
+1, y
);
1206 #ifdef GENERATION_DIAGNOSTICS
1207 printf("extending up\n");
1209 r1
= find_rect(params2
, grid
, x
, y
-1);
1220 #ifdef GENERATION_DIAGNOSTICS
1221 printf("extending left\n");
1223 r1
= find_rect(params2
, grid
, x
-1, y
);
1233 assert(y
< params2
->h
+1);
1234 #ifdef GENERATION_DIAGNOSTICS
1235 printf("extending down\n");
1237 r1
= find_rect(params2
, grid
, x
, y
+1);
1247 if (r1
.h
> 0 && r1
.w
> 0)
1248 place_rect(params2
, grid
, r1
);
1249 place_rect(params2
, grid
, r2
);
1253 * Sanity-check that there really is a 3x3
1254 * rectangle surrounding this singleton and it
1255 * contains absolutely everything we could
1260 assert(x
> 0 && x
< params2
->w
-1);
1261 assert(y
> 0 && y
< params2
->h
-1);
1263 for (xx
= x
-1; xx
<= x
+1; xx
++)
1264 for (yy
= y
-1; yy
<= y
+1; yy
++) {
1265 struct rect r
= find_rect(params2
,grid
,xx
,yy
);
1268 assert(r
.x
+r
.w
-1 <= x
+1);
1269 assert(r
.y
+r
.h
-1 <= y
+1);
1274 #ifdef GENERATION_DIAGNOSTICS
1275 printf("need the 3x3 trick\n");
1279 * FIXME: If the maximum rectangle area for
1280 * this grid is less than 9, we ought to
1281 * subdivide the 3x3 in some fashion. There are
1282 * five other possibilities:
1285 * - a 4, a 3 and a 2
1287 * - a 3 and three 2s (two different arrangements).
1295 place_rect(params2
, grid
, r
);
1303 * We have now constructed a grid of the size specified in
1304 * params2. Now we extend it into a grid of the size specified
1305 * in params. We do this in two passes: we extend it vertically
1306 * until it's the right height, then we transpose it, then
1307 * extend it vertically again (getting it effectively the right
1308 * width), then finally transpose again.
1310 for (i
= 0; i
< 2; i
++) {
1311 int *grid2
, *expand
, *where
;
1312 game_params params3real
, *params3
= ¶ms3real
;
1314 #ifdef GENERATION_DIAGNOSTICS
1315 printf("before expansion:\n");
1316 display_grid(params2
, grid
, NULL
, TRUE
);
1320 * Set up the new grid.
1322 grid2
= snewn(params2
->w
* params
->h
, int);
1323 expand
= snewn(params2
->h
-1, int);
1324 where
= snewn(params2
->w
, int);
1325 params3
->w
= params2
->w
;
1326 params3
->h
= params
->h
;
1329 * Decide which horizontal edges are going to get expanded,
1332 for (y
= 0; y
< params2
->h
-1; y
++)
1334 for (y
= params2
->h
; y
< params
->h
; y
++) {
1335 x
= random_upto(rs
, params2
->h
-1);
1339 #ifdef GENERATION_DIAGNOSTICS
1340 printf("expand[] = {");
1341 for (y
= 0; y
< params2
->h
-1; y
++)
1342 printf(" %d", expand
[y
]);
1347 * Perform the expansion. The way this works is that we
1350 * - copy a row from grid into grid2
1352 * - invent some number of additional rows in grid2 where
1353 * there was previously only a horizontal line between
1354 * rows in grid, and make random decisions about where
1355 * among these to place each rectangle edge that ran
1358 for (y
= y2
= y2last
= 0; y
< params2
->h
; y
++) {
1360 * Copy a single line from row y of grid into row y2 of
1363 for (x
= 0; x
< params2
->w
; x
++) {
1364 int val
= index(params2
, grid
, x
, y
);
1365 if (val
/ params2
->w
== y
&& /* rect starts on this line */
1366 (y2
== 0 || /* we're at the very top, or... */
1367 index(params3
, grid2
, x
, y2
-1) / params3
->w
< y2last
1368 /* this rect isn't already started */))
1369 index(params3
, grid2
, x
, y2
) =
1370 INDEX(params3
, val
% params2
->w
, y2
);
1372 index(params3
, grid2
, x
, y2
) =
1373 index(params3
, grid2
, x
, y2
-1);
1377 * If that was the last line, terminate the loop early.
1379 if (++y2
== params3
->h
)
1385 * Invent some number of additional lines. First walk
1386 * along this line working out where to put all the
1387 * edges that coincide with it.
1390 for (x
= 0; x
< params2
->w
; x
++) {
1391 if (index(params2
, grid
, x
, y
) !=
1392 index(params2
, grid
, x
, y
+1)) {
1394 * This is a horizontal edge, so it needs
1398 (index(params2
, grid
, x
-1, y
) !=
1399 index(params2
, grid
, x
, y
) &&
1400 index(params2
, grid
, x
-1, y
+1) !=
1401 index(params2
, grid
, x
, y
+1))) {
1403 * Here we have the chance to make a new
1406 yx
= random_upto(rs
, expand
[y
]+1);
1409 * Here we just reuse the previous value of
1418 for (yx
= 0; yx
< expand
[y
]; yx
++) {
1420 * Invent a single row. For each square in the row,
1421 * we copy the grid entry from the square above it,
1422 * unless we're starting the new rectangle here.
1424 for (x
= 0; x
< params2
->w
; x
++) {
1425 if (yx
== where
[x
]) {
1426 int val
= index(params2
, grid
, x
, y
+1);
1428 val
= INDEX(params3
, val
, y2
);
1429 index(params3
, grid2
, x
, y2
) = val
;
1431 index(params3
, grid2
, x
, y2
) =
1432 index(params3
, grid2
, x
, y2
-1);
1442 #ifdef GENERATION_DIAGNOSTICS
1443 printf("after expansion:\n");
1444 display_grid(params3
, grid2
, NULL
, TRUE
);
1449 params2
->w
= params3
->h
;
1450 params2
->h
= params3
->w
;
1452 grid
= snewn(params2
->w
* params2
->h
, int);
1453 for (x
= 0; x
< params2
->w
; x
++)
1454 for (y
= 0; y
< params2
->h
; y
++) {
1455 int idx1
= INDEX(params2
, x
, y
);
1456 int idx2
= INDEX(params3
, y
, x
);
1460 tmp
= (tmp
% params3
->w
) * params2
->w
+ (tmp
/ params3
->w
);
1469 params
->w
= params
->h
;
1473 #ifdef GENERATION_DIAGNOSTICS
1474 printf("after transposition:\n");
1475 display_grid(params2
, grid
, NULL
, TRUE
);
1480 * Run the solver to narrow down the possible number
1484 struct numberdata
*nd
;
1485 int nnumbers
, i
, ret
;
1487 /* Count the rectangles. */
1489 for (y
= 0; y
< params
->h
; y
++) {
1490 for (x
= 0; x
< params
->w
; x
++) {
1491 int idx
= INDEX(params
, x
, y
);
1492 if (index(params
, grid
, x
, y
) == idx
)
1497 nd
= snewn(nnumbers
, struct numberdata
);
1499 /* Now set up each number's candidate position list. */
1501 for (y
= 0; y
< params
->h
; y
++) {
1502 for (x
= 0; x
< params
->w
; x
++) {
1503 int idx
= INDEX(params
, x
, y
);
1504 if (index(params
, grid
, x
, y
) == idx
) {
1505 struct rect r
= find_rect(params
, grid
, x
, y
);
1508 nd
[i
].area
= r
.w
* r
.h
;
1509 nd
[i
].npoints
= nd
[i
].area
;
1510 nd
[i
].points
= snewn(nd
[i
].npoints
, struct point
);
1512 for (j
= 0; j
< r
.h
; j
++)
1513 for (k
= 0; k
< r
.w
; k
++) {
1514 nd
[i
].points
[m
].x
= k
+ r
.x
;
1515 nd
[i
].points
[m
].y
= j
+ r
.y
;
1518 assert(m
== nd
[i
].npoints
);
1526 ret
= rect_solver(params
->w
, params
->h
, nnumbers
, nd
, rs
);
1528 ret
= TRUE
; /* allow any number placement at all */
1532 * Now place the numbers according to the solver's
1535 numbers
= snewn(params
->w
* params
->h
, int);
1537 for (y
= 0; y
< params
->h
; y
++)
1538 for (x
= 0; x
< params
->w
; x
++) {
1539 index(params
, numbers
, x
, y
) = 0;
1542 for (i
= 0; i
< nnumbers
; i
++) {
1543 int idx
= random_upto(rs
, nd
[i
].npoints
);
1544 int x
= nd
[i
].points
[idx
].x
;
1545 int y
= nd
[i
].points
[idx
].y
;
1546 index(params
,numbers
,x
,y
) = nd
[i
].area
;
1553 for (i
= 0; i
< nnumbers
; i
++)
1554 sfree(nd
[i
].points
);
1558 * If we've succeeded, then terminate the loop.
1565 * Give up and go round again.
1571 * Store the rectangle data in the game_aux_info.
1574 game_aux_info
*ai
= snew(game_aux_info
);
1578 ai
->vedge
= snewn(ai
->w
* ai
->h
, unsigned char);
1579 ai
->hedge
= snewn(ai
->w
* ai
->h
, unsigned char);
1581 for (y
= 0; y
< params
->h
; y
++)
1582 for (x
= 1; x
< params
->w
; x
++) {
1584 index(params
, grid
, x
, y
) != index(params
, grid
, x
-1, y
);
1586 for (y
= 1; y
< params
->h
; y
++)
1587 for (x
= 0; x
< params
->w
; x
++) {
1589 index(params
, grid
, x
, y
) != index(params
, grid
, x
, y
-1);
1595 #ifdef GENERATION_DIAGNOSTICS
1596 display_grid(params
, grid
, numbers
, FALSE
);
1599 desc
= snewn(11 * params
->w
* params
->h
, char);
1602 for (i
= 0; i
<= params
->w
* params
->h
; i
++) {
1603 int n
= (i
< params
->w
* params
->h ? numbers
[i
] : -1);
1610 int c
= 'a' - 1 + run
;
1614 run
-= c
- ('a' - 1);
1618 * If there's a number in the very top left or
1619 * bottom right, there's no point putting an
1620 * unnecessary _ before or after it.
1622 if (p
> desc
&& n
> 0)
1626 p
+= sprintf(p
, "%d", n
);
1638 static void game_free_aux_info(game_aux_info
*ai
)
1645 static char *validate_desc(game_params
*params
, char *desc
)
1647 int area
= params
->w
* params
->h
;
1652 if (n
>= 'a' && n
<= 'z') {
1653 squares
+= n
- 'a' + 1;
1654 } else if (n
== '_') {
1656 } else if (n
> '0' && n
<= '9') {
1658 while (*desc
>= '0' && *desc
<= '9')
1661 return "Invalid character in game description";
1665 return "Not enough data to fill grid";
1668 return "Too much data to fit in grid";
1673 static game_state
*new_game(game_params
*params
, char *desc
)
1675 game_state
*state
= snew(game_state
);
1678 state
->w
= params
->w
;
1679 state
->h
= params
->h
;
1681 area
= state
->w
* state
->h
;
1683 state
->grid
= snewn(area
, int);
1684 state
->vedge
= snewn(area
, unsigned char);
1685 state
->hedge
= snewn(area
, unsigned char);
1686 state
->completed
= state
->cheated
= FALSE
;
1691 if (n
>= 'a' && n
<= 'z') {
1692 int run
= n
- 'a' + 1;
1693 assert(i
+ run
<= area
);
1695 state
->grid
[i
++] = 0;
1696 } else if (n
== '_') {
1698 } else if (n
> '0' && n
<= '9') {
1700 state
->grid
[i
++] = atoi(desc
-1);
1701 while (*desc
>= '0' && *desc
<= '9')
1704 assert(!"We can't get here");
1709 for (y
= 0; y
< state
->h
; y
++)
1710 for (x
= 0; x
< state
->w
; x
++)
1711 vedge(state
,x
,y
) = hedge(state
,x
,y
) = 0;
1716 static game_state
*dup_game(game_state
*state
)
1718 game_state
*ret
= snew(game_state
);
1723 ret
->vedge
= snewn(state
->w
* state
->h
, unsigned char);
1724 ret
->hedge
= snewn(state
->w
* state
->h
, unsigned char);
1725 ret
->grid
= snewn(state
->w
* state
->h
, int);
1727 ret
->completed
= state
->completed
;
1728 ret
->cheated
= state
->cheated
;
1730 memcpy(ret
->grid
, state
->grid
, state
->w
* state
->h
* sizeof(int));
1731 memcpy(ret
->vedge
, state
->vedge
, state
->w
*state
->h
*sizeof(unsigned char));
1732 memcpy(ret
->hedge
, state
->hedge
, state
->w
*state
->h
*sizeof(unsigned char));
1737 static void free_game(game_state
*state
)
1740 sfree(state
->vedge
);
1741 sfree(state
->hedge
);
1745 static game_state
*solve_game(game_state
*state
, game_aux_info
*ai
,
1751 *error
= "Solution not known for this puzzle";
1755 assert(state
->w
== ai
->w
);
1756 assert(state
->h
== ai
->h
);
1758 ret
= dup_game(state
);
1759 memcpy(ret
->vedge
, ai
->vedge
, ai
->w
* ai
->h
* sizeof(unsigned char));
1760 memcpy(ret
->hedge
, ai
->hedge
, ai
->w
* ai
->h
* sizeof(unsigned char));
1761 ret
->cheated
= TRUE
;
1766 static char *game_text_format(game_state
*state
)
1768 char *ret
, *p
, buf
[80];
1769 int i
, x
, y
, col
, maxlen
;
1772 * First determine the number of spaces required to display a
1773 * number. We'll use at least two, because one looks a bit
1777 for (i
= 0; i
< state
->w
* state
->h
; i
++) {
1778 x
= sprintf(buf
, "%d", state
->grid
[i
]);
1779 if (col
< x
) col
= x
;
1783 * Now we know the exact total size of the grid we're going to
1784 * produce: it's got 2*h+1 rows, each containing w lots of col,
1785 * w+1 boundary characters and a trailing newline.
1787 maxlen
= (2*state
->h
+1) * (state
->w
* (col
+1) + 2);
1789 ret
= snewn(maxlen
+1, char);
1792 for (y
= 0; y
<= 2*state
->h
; y
++) {
1793 for (x
= 0; x
<= 2*state
->w
; x
++) {
1798 int v
= grid(state
, x
/2, y
/2);
1800 sprintf(buf
, "%*d", col
, v
);
1802 sprintf(buf
, "%*s", col
, "");
1803 memcpy(p
, buf
, col
);
1807 * Display a horizontal edge or nothing.
1809 int h
= (y
==0 || y
==2*state
->h ?
1 :
1810 HRANGE(state
, x
/2, y
/2) && hedge(state
, x
/2, y
/2));
1816 for (i
= 0; i
< col
; i
++)
1820 * Display a vertical edge or nothing.
1822 int v
= (x
==0 || x
==2*state
->w ?
1 :
1823 VRANGE(state
, x
/2, y
/2) && vedge(state
, x
/2, y
/2));
1830 * Display a corner, or a vertical edge, or a
1831 * horizontal edge, or nothing.
1833 int hl
= (y
==0 || y
==2*state
->h ?
1 :
1834 HRANGE(state
, (x
-1)/2, y
/2) && hedge(state
, (x
-1)/2, y
/2));
1835 int hr
= (y
==0 || y
==2*state
->h ?
1 :
1836 HRANGE(state
, (x
+1)/2, y
/2) && hedge(state
, (x
+1)/2, y
/2));
1837 int vu
= (x
==0 || x
==2*state
->w ?
1 :
1838 VRANGE(state
, x
/2, (y
-1)/2) && vedge(state
, x
/2, (y
-1)/2));
1839 int vd
= (x
==0 || x
==2*state
->w ?
1 :
1840 VRANGE(state
, x
/2, (y
+1)/2) && vedge(state
, x
/2, (y
+1)/2));
1841 if (!hl
&& !hr
&& !vu
&& !vd
)
1843 else if (hl
&& hr
&& !vu
&& !vd
)
1845 else if (!hl
&& !hr
&& vu
&& vd
)
1854 assert(p
- ret
== maxlen
);
1859 static unsigned char *get_correct(game_state
*state
)
1864 ret
= snewn(state
->w
* state
->h
, unsigned char);
1865 memset(ret
, 0xFF, state
->w
* state
->h
);
1867 for (x
= 0; x
< state
->w
; x
++)
1868 for (y
= 0; y
< state
->h
; y
++)
1869 if (index(state
,ret
,x
,y
) == 0xFF) {
1872 int num
, area
, valid
;
1875 * Find a rectangle starting at this point.
1878 while (x
+rw
< state
->w
&& !vedge(state
,x
+rw
,y
))
1881 while (y
+rh
< state
->h
&& !hedge(state
,x
,y
+rh
))
1885 * We know what the dimensions of the rectangle
1886 * should be if it's there at all. Find out if we
1887 * really have a valid rectangle.
1890 /* Check the horizontal edges. */
1891 for (xx
= x
; xx
< x
+rw
; xx
++) {
1892 for (yy
= y
; yy
<= y
+rh
; yy
++) {
1893 int e
= !HRANGE(state
,xx
,yy
) || hedge(state
,xx
,yy
);
1894 int ec
= (yy
== y
|| yy
== y
+rh
);
1899 /* Check the vertical edges. */
1900 for (yy
= y
; yy
< y
+rh
; yy
++) {
1901 for (xx
= x
; xx
<= x
+rw
; xx
++) {
1902 int e
= !VRANGE(state
,xx
,yy
) || vedge(state
,xx
,yy
);
1903 int ec
= (xx
== x
|| xx
== x
+rw
);
1910 * If this is not a valid rectangle with no other
1911 * edges inside it, we just mark this square as not
1912 * complete and proceed to the next square.
1915 index(state
, ret
, x
, y
) = 0;
1920 * We have a rectangle. Now see what its area is,
1921 * and how many numbers are in it.
1925 for (xx
= x
; xx
< x
+rw
; xx
++) {
1926 for (yy
= y
; yy
< y
+rh
; yy
++) {
1928 if (grid(state
,xx
,yy
)) {
1930 valid
= FALSE
; /* two numbers */
1931 num
= grid(state
,xx
,yy
);
1939 * Now fill in the whole rectangle based on the
1942 for (xx
= x
; xx
< x
+rw
; xx
++) {
1943 for (yy
= y
; yy
< y
+rh
; yy
++) {
1944 index(state
, ret
, xx
, yy
) = valid
;
1954 * These coordinates are 2 times the obvious grid coordinates.
1955 * Hence, the top left of the grid is (0,0), the grid point to
1956 * the right of that is (2,0), the one _below that_ is (2,2)
1957 * and so on. This is so that we can specify a drag start point
1958 * on an edge (one odd coordinate) or in the middle of a square
1959 * (two odd coordinates) rather than always at a corner.
1961 * -1,-1 means no drag is in progress.
1968 * This flag is set as soon as a dragging action moves the
1969 * mouse pointer away from its starting point, so that even if
1970 * the pointer _returns_ to its starting point the action is
1971 * treated as a small drag rather than a click.
1976 static game_ui
*new_ui(game_state
*state
)
1978 game_ui
*ui
= snew(game_ui
);
1979 ui
->drag_start_x
= -1;
1980 ui
->drag_start_y
= -1;
1981 ui
->drag_end_x
= -1;
1982 ui
->drag_end_y
= -1;
1983 ui
->dragged
= FALSE
;
1987 static void free_ui(game_ui
*ui
)
1992 static void coord_round(float x
, float y
, int *xr
, int *yr
)
1994 float xs
, ys
, xv
, yv
, dx
, dy
, dist
;
1997 * Find the nearest square-centre.
1999 xs
= (float)floor(x
) + 0.5F
;
2000 ys
= (float)floor(y
) + 0.5F
;
2003 * And find the nearest grid vertex.
2005 xv
= (float)floor(x
+ 0.5F
);
2006 yv
= (float)floor(y
+ 0.5F
);
2009 * We allocate clicks in parts of the grid square to either
2010 * corners, edges or square centres, as follows:
2026 * In other words: we measure the square distance (i.e.
2027 * max(dx,dy)) from the click to the nearest corner, and if
2028 * it's within CORNER_TOLERANCE then we return a corner click.
2029 * We measure the square distance from the click to the nearest
2030 * centre, and if that's within CENTRE_TOLERANCE we return a
2031 * centre click. Failing that, we find which of the two edge
2032 * centres is nearer to the click and return that edge.
2036 * Check for corner click.
2038 dx
= (float)fabs(x
- xv
);
2039 dy
= (float)fabs(y
- yv
);
2040 dist
= (dx
> dy ? dx
: dy
);
2041 if (dist
< CORNER_TOLERANCE
) {
2046 * Check for centre click.
2048 dx
= (float)fabs(x
- xs
);
2049 dy
= (float)fabs(y
- ys
);
2050 dist
= (dx
> dy ? dx
: dy
);
2051 if (dist
< CENTRE_TOLERANCE
) {
2052 *xr
= 1 + 2 * (int)xs
;
2053 *yr
= 1 + 2 * (int)ys
;
2056 * Failing both of those, see which edge we're closer to.
2057 * Conveniently, this is simply done by testing the relative
2058 * magnitude of dx and dy (which are currently distances from
2059 * the square centre).
2062 /* Vertical edge: x-coord of corner,
2063 * y-coord of square centre. */
2065 *yr
= 1 + 2 * (int)ys
;
2067 /* Horizontal edge: x-coord of square centre,
2068 * y-coord of corner. */
2069 *xr
= 1 + 2 * (int)xs
;
2076 static void ui_draw_rect(game_state
*state
, game_ui
*ui
,
2077 unsigned char *hedge
, unsigned char *vedge
, int c
)
2079 int x1
, x2
, y1
, y2
, x
, y
, t
;
2081 x1
= ui
->drag_start_x
;
2082 x2
= ui
->drag_end_x
;
2083 if (x2
< x1
) { t
= x1
; x1
= x2
; x2
= t
; }
2085 y1
= ui
->drag_start_y
;
2086 y2
= ui
->drag_end_y
;
2087 if (y2
< y1
) { t
= y1
; y1
= y2
; y2
= t
; }
2089 x1
= x1
/ 2; /* rounds down */
2090 x2
= (x2
+1) / 2; /* rounds up */
2091 y1
= y1
/ 2; /* rounds down */
2092 y2
= (y2
+1) / 2; /* rounds up */
2095 * Draw horizontal edges of rectangles.
2097 for (x
= x1
; x
< x2
; x
++)
2098 for (y
= y1
; y
<= y2
; y
++)
2099 if (HRANGE(state
,x
,y
)) {
2100 int val
= index(state
,hedge
,x
,y
);
2101 if (y
== y1
|| y
== y2
)
2105 index(state
,hedge
,x
,y
) = val
;
2109 * Draw vertical edges of rectangles.
2111 for (y
= y1
; y
< y2
; y
++)
2112 for (x
= x1
; x
<= x2
; x
++)
2113 if (VRANGE(state
,x
,y
)) {
2114 int val
= index(state
,vedge
,x
,y
);
2115 if (x
== x1
|| x
== x2
)
2119 index(state
,vedge
,x
,y
) = val
;
2123 static game_state
*make_move(game_state
*from
, game_ui
*ui
,
2124 int x
, int y
, int button
)
2127 int startdrag
= FALSE
, enddrag
= FALSE
, active
= FALSE
;
2130 button
&= ~MOD_MASK
;
2132 if (button
== LEFT_BUTTON
) {
2134 } else if (button
== LEFT_RELEASE
) {
2136 } else if (button
!= LEFT_DRAG
) {
2140 coord_round(FROMCOORD((float)x
), FROMCOORD((float)y
), &xc
, &yc
);
2143 ui
->drag_start_x
= xc
;
2144 ui
->drag_start_y
= yc
;
2145 ui
->drag_end_x
= xc
;
2146 ui
->drag_end_y
= yc
;
2147 ui
->dragged
= FALSE
;
2151 if (xc
!= ui
->drag_end_x
|| yc
!= ui
->drag_end_y
) {
2152 ui
->drag_end_x
= xc
;
2153 ui
->drag_end_y
= yc
;
2161 if (xc
>= 0 && xc
<= 2*from
->w
&&
2162 yc
>= 0 && yc
<= 2*from
->h
) {
2163 ret
= dup_game(from
);
2166 ui_draw_rect(ret
, ui
, ret
->hedge
, ret
->vedge
, 1);
2168 if ((xc
& 1) && !(yc
& 1) && HRANGE(from
,xc
/2,yc
/2)) {
2169 hedge(ret
,xc
/2,yc
/2) = !hedge(ret
,xc
/2,yc
/2);
2171 if ((yc
& 1) && !(xc
& 1) && VRANGE(from
,xc
/2,yc
/2)) {
2172 vedge(ret
,xc
/2,yc
/2) = !vedge(ret
,xc
/2,yc
/2);
2176 if (!memcmp(ret
->hedge
, from
->hedge
, from
->w
*from
->h
) &&
2177 !memcmp(ret
->vedge
, from
->vedge
, from
->w
*from
->h
)) {
2183 * We've made a real change to the grid. Check to see
2184 * if the game has been completed.
2186 if (ret
&& !ret
->completed
) {
2188 unsigned char *correct
= get_correct(ret
);
2191 for (x
= 0; x
< ret
->w
; x
++)
2192 for (y
= 0; y
< ret
->h
; y
++)
2193 if (!index(ret
, correct
, x
, y
))
2199 ret
->completed
= TRUE
;
2203 ui
->drag_start_x
= -1;
2204 ui
->drag_start_y
= -1;
2205 ui
->drag_end_x
= -1;
2206 ui
->drag_end_y
= -1;
2207 ui
->dragged
= FALSE
;
2212 return ret
; /* a move has been made */
2214 return from
; /* UI activity has occurred */
2219 /* ----------------------------------------------------------------------
2223 #define CORRECT 65536
2225 #define COLOUR(k) ( (k)==1 ? COL_LINE : COL_DRAG )
2226 #define MAX(x,y) ( (x)>(y) ? (x) : (y) )
2227 #define MAX4(x,y,z,w) ( MAX(MAX(x,y),MAX(z,w)) )
2229 struct game_drawstate
{
2232 unsigned int *visible
;
2235 static void game_size(game_params
*params
, int *x
, int *y
)
2237 *x
= params
->w
* TILE_SIZE
+ 2*BORDER
+ 1;
2238 *y
= params
->h
* TILE_SIZE
+ 2*BORDER
+ 1;
2241 static float *game_colours(frontend
*fe
, game_state
*state
, int *ncolours
)
2243 float *ret
= snewn(3 * NCOLOURS
, float);
2245 frontend_default_colour(fe
, &ret
[COL_BACKGROUND
* 3]);
2247 ret
[COL_GRID
* 3 + 0] = 0.5F
* ret
[COL_BACKGROUND
* 3 + 0];
2248 ret
[COL_GRID
* 3 + 1] = 0.5F
* ret
[COL_BACKGROUND
* 3 + 1];
2249 ret
[COL_GRID
* 3 + 2] = 0.5F
* ret
[COL_BACKGROUND
* 3 + 2];
2251 ret
[COL_DRAG
* 3 + 0] = 1.0F
;
2252 ret
[COL_DRAG
* 3 + 1] = 0.0F
;
2253 ret
[COL_DRAG
* 3 + 2] = 0.0F
;
2255 ret
[COL_CORRECT
* 3 + 0] = 0.75F
* ret
[COL_BACKGROUND
* 3 + 0];
2256 ret
[COL_CORRECT
* 3 + 1] = 0.75F
* ret
[COL_BACKGROUND
* 3 + 1];
2257 ret
[COL_CORRECT
* 3 + 2] = 0.75F
* ret
[COL_BACKGROUND
* 3 + 2];
2259 ret
[COL_LINE
* 3 + 0] = 0.0F
;
2260 ret
[COL_LINE
* 3 + 1] = 0.0F
;
2261 ret
[COL_LINE
* 3 + 2] = 0.0F
;
2263 ret
[COL_TEXT
* 3 + 0] = 0.0F
;
2264 ret
[COL_TEXT
* 3 + 1] = 0.0F
;
2265 ret
[COL_TEXT
* 3 + 2] = 0.0F
;
2267 *ncolours
= NCOLOURS
;
2271 static game_drawstate
*game_new_drawstate(game_state
*state
)
2273 struct game_drawstate
*ds
= snew(struct game_drawstate
);
2276 ds
->started
= FALSE
;
2279 ds
->visible
= snewn(ds
->w
* ds
->h
, unsigned int);
2280 for (i
= 0; i
< ds
->w
* ds
->h
; i
++)
2281 ds
->visible
[i
] = 0xFFFF;
2286 static void game_free_drawstate(game_drawstate
*ds
)
2292 static void draw_tile(frontend
*fe
, game_state
*state
, int x
, int y
,
2293 unsigned char *hedge
, unsigned char *vedge
,
2294 unsigned char *corners
, int correct
)
2296 int cx
= COORD(x
), cy
= COORD(y
);
2299 draw_rect(fe
, cx
, cy
, TILE_SIZE
+1, TILE_SIZE
+1, COL_GRID
);
2300 draw_rect(fe
, cx
+1, cy
+1, TILE_SIZE
-1, TILE_SIZE
-1,
2301 correct ? COL_CORRECT
: COL_BACKGROUND
);
2303 if (grid(state
,x
,y
)) {
2304 sprintf(str
, "%d", grid(state
,x
,y
));
2305 draw_text(fe
, cx
+TILE_SIZE
/2, cy
+TILE_SIZE
/2, FONT_VARIABLE
,
2306 TILE_SIZE
/2, ALIGN_HCENTRE
| ALIGN_VCENTRE
, COL_TEXT
, str
);
2312 if (!HRANGE(state
,x
,y
) || index(state
,hedge
,x
,y
))
2313 draw_rect(fe
, cx
, cy
, TILE_SIZE
+1, 2,
2314 HRANGE(state
,x
,y
) ?
COLOUR(index(state
,hedge
,x
,y
)) :
2316 if (!HRANGE(state
,x
,y
+1) || index(state
,hedge
,x
,y
+1))
2317 draw_rect(fe
, cx
, cy
+TILE_SIZE
-1, TILE_SIZE
+1, 2,
2318 HRANGE(state
,x
,y
+1) ?
COLOUR(index(state
,hedge
,x
,y
+1)) :
2320 if (!VRANGE(state
,x
,y
) || index(state
,vedge
,x
,y
))
2321 draw_rect(fe
, cx
, cy
, 2, TILE_SIZE
+1,
2322 VRANGE(state
,x
,y
) ?
COLOUR(index(state
,vedge
,x
,y
)) :
2324 if (!VRANGE(state
,x
+1,y
) || index(state
,vedge
,x
+1,y
))
2325 draw_rect(fe
, cx
+TILE_SIZE
-1, cy
, 2, TILE_SIZE
+1,
2326 VRANGE(state
,x
+1,y
) ?
COLOUR(index(state
,vedge
,x
+1,y
)) :
2332 if (index(state
,corners
,x
,y
))
2333 draw_rect(fe
, cx
, cy
, 2, 2,
2334 COLOUR(index(state
,corners
,x
,y
)));
2335 if (x
+1 < state
->w
&& index(state
,corners
,x
+1,y
))
2336 draw_rect(fe
, cx
+TILE_SIZE
-1, cy
, 2, 2,
2337 COLOUR(index(state
,corners
,x
+1,y
)));
2338 if (y
+1 < state
->h
&& index(state
,corners
,x
,y
+1))
2339 draw_rect(fe
, cx
, cy
+TILE_SIZE
-1, 2, 2,
2340 COLOUR(index(state
,corners
,x
,y
+1)));
2341 if (x
+1 < state
->w
&& y
+1 < state
->h
&& index(state
,corners
,x
+1,y
+1))
2342 draw_rect(fe
, cx
+TILE_SIZE
-1, cy
+TILE_SIZE
-1, 2, 2,
2343 COLOUR(index(state
,corners
,x
+1,y
+1)));
2345 draw_update(fe
, cx
, cy
, TILE_SIZE
+1, TILE_SIZE
+1);
2348 static void game_redraw(frontend
*fe
, game_drawstate
*ds
, game_state
*oldstate
,
2349 game_state
*state
, int dir
, game_ui
*ui
,
2350 float animtime
, float flashtime
)
2353 unsigned char *correct
;
2354 unsigned char *hedge
, *vedge
, *corners
;
2356 correct
= get_correct(state
);
2359 hedge
= snewn(state
->w
*state
->h
, unsigned char);
2360 vedge
= snewn(state
->w
*state
->h
, unsigned char);
2361 memcpy(hedge
, state
->hedge
, state
->w
*state
->h
);
2362 memcpy(vedge
, state
->vedge
, state
->w
*state
->h
);
2363 ui_draw_rect(state
, ui
, hedge
, vedge
, 2);
2365 hedge
= state
->hedge
;
2366 vedge
= state
->vedge
;
2369 corners
= snewn(state
->w
* state
->h
, unsigned char);
2370 memset(corners
, 0, state
->w
* state
->h
);
2371 for (x
= 0; x
< state
->w
; x
++)
2372 for (y
= 0; y
< state
->h
; y
++) {
2374 int e
= index(state
, vedge
, x
, y
);
2375 if (index(state
,corners
,x
,y
) < e
)
2376 index(state
,corners
,x
,y
) = e
;
2377 if (y
+1 < state
->h
&&
2378 index(state
,corners
,x
,y
+1) < e
)
2379 index(state
,corners
,x
,y
+1) = e
;
2382 int e
= index(state
, hedge
, x
, y
);
2383 if (index(state
,corners
,x
,y
) < e
)
2384 index(state
,corners
,x
,y
) = e
;
2385 if (x
+1 < state
->w
&&
2386 index(state
,corners
,x
+1,y
) < e
)
2387 index(state
,corners
,x
+1,y
) = e
;
2393 state
->w
* TILE_SIZE
+ 2*BORDER
+ 1,
2394 state
->h
* TILE_SIZE
+ 2*BORDER
+ 1, COL_BACKGROUND
);
2395 draw_rect(fe
, COORD(0)-1, COORD(0)-1,
2396 ds
->w
*TILE_SIZE
+3, ds
->h
*TILE_SIZE
+3, COL_LINE
);
2398 draw_update(fe
, 0, 0,
2399 state
->w
* TILE_SIZE
+ 2*BORDER
+ 1,
2400 state
->h
* TILE_SIZE
+ 2*BORDER
+ 1);
2403 for (x
= 0; x
< state
->w
; x
++)
2404 for (y
= 0; y
< state
->h
; y
++) {
2407 if (HRANGE(state
,x
,y
))
2408 c
|= index(state
,hedge
,x
,y
);
2409 if (HRANGE(state
,x
,y
+1))
2410 c
|= index(state
,hedge
,x
,y
+1) << 2;
2411 if (VRANGE(state
,x
,y
))
2412 c
|= index(state
,vedge
,x
,y
) << 4;
2413 if (VRANGE(state
,x
+1,y
))
2414 c
|= index(state
,vedge
,x
+1,y
) << 6;
2415 c
|= index(state
,corners
,x
,y
) << 8;
2417 c
|= index(state
,corners
,x
+1,y
) << 10;
2419 c
|= index(state
,corners
,x
,y
+1) << 12;
2420 if (x
+1 < state
->w
&& y
+1 < state
->h
)
2421 c
|= index(state
,corners
,x
+1,y
+1) << 14;
2422 if (index(state
, correct
, x
, y
) && !flashtime
)
2425 if (index(ds
,ds
->visible
,x
,y
) != c
) {
2426 draw_tile(fe
, state
, x
, y
, hedge
, vedge
, corners
, c
& CORRECT
);
2427 index(ds
,ds
->visible
,x
,y
) = c
;
2431 if (hedge
!= state
->hedge
) {
2440 static float game_anim_length(game_state
*oldstate
,
2441 game_state
*newstate
, int dir
)
2446 static float game_flash_length(game_state
*oldstate
,
2447 game_state
*newstate
, int dir
)
2449 if (!oldstate
->completed
&& newstate
->completed
&&
2450 !oldstate
->cheated
&& !newstate
->cheated
)
2455 static int game_wants_statusbar(void)
2461 #define thegame rect
2464 const struct game thegame
= {
2465 "Rectangles", "games.rectangles",
2472 TRUE
, game_configure
, custom_params
,
2481 TRUE
, game_text_format
,
2488 game_free_drawstate
,
2492 game_wants_statusbar
,