2 * solo.c: the number-placing puzzle most popularly known as `Sudoku'.
6 * - reports from users are that `Trivial'-mode puzzles are still
7 * rather hard compared to newspapers' easy ones, so some better
8 * low-end difficulty grading would be nice
9 * + it's possible that really easy puzzles always have
10 * _several_ things you can do, so don't make you hunt too
11 * hard for the one deduction you can currently make
12 * + it's also possible that easy puzzles require fewer
13 * cross-eliminations: perhaps there's a higher incidence of
14 * things you can deduce by looking only at (say) rows,
15 * rather than things you have to check both rows and columns
17 * + but really, what I need to do is find some really easy
18 * puzzles and _play_ them, to see what's actually easy about
20 * + while I'm revamping this area, filling in the _last_
21 * number in a nearly-full row or column should certainly be
22 * permitted even at the lowest difficulty level.
23 * + also Owen noticed that `Basic' grids requiring numeric
24 * elimination are actually very hard, so I wonder if a
25 * difficulty gradation between that and positional-
26 * elimination-only might be in order
27 * + but it's not good to have _too_ many difficulty levels, or
28 * it'll take too long to randomly generate a given level.
30 * - it might still be nice to do some prioritisation on the
31 * removal of numbers from the grid
32 * + one possibility is to try to minimise the maximum number
33 * of filled squares in any block, which in particular ought
34 * to enforce never leaving a completely filled block in the
35 * puzzle as presented.
37 * - alternative interface modes
38 * + sudoku.com's Windows program has a palette of possible
39 * entries; you select a palette entry first and then click
40 * on the square you want it to go in, thus enabling
41 * mouse-only play. Useful for PDAs! I don't think it's
42 * actually incompatible with the current highlight-then-type
43 * approach: you _either_ highlight a palette entry and then
44 * click, _or_ you highlight a square and then type. At most
45 * one thing is ever highlighted at a time, so there's no way
47 * + then again, I don't actually like sudoku.com's interface;
48 * it's too much like a paint package whereas I prefer to
49 * think of Solo as a text editor.
50 * + another PDA-friendly possibility is a drag interface:
51 * _drag_ numbers from the palette into the grid squares.
52 * Thought experiments suggest I'd prefer that to the
53 * sudoku.com approach, but I haven't actually tried it.
57 * Solo puzzles need to be square overall (since each row and each
58 * column must contain one of every digit), but they need not be
59 * subdivided the same way internally. I am going to adopt a
60 * convention whereby I _always_ refer to `r' as the number of rows
61 * of _big_ divisions, and `c' as the number of columns of _big_
62 * divisions. Thus, a 2c by 3r puzzle looks something like this:
66 * ------+------ (Of course, you can't subdivide it the other way
67 * 1 4 5 | 6 3 2 or you'll get clashes; observe that the 4 in the
68 * 3 2 6 | 4 1 5 top left would conflict with the 4 in the second
69 * ------+------ box down on the left-hand side.)
73 * The need for a strong naming convention should now be clear:
74 * each small box is two rows of digits by three columns, while the
75 * overall puzzle has three rows of small boxes by two columns. So
76 * I will (hopefully) consistently use `r' to denote the number of
77 * rows _of small boxes_ (here 3), which is also the number of
78 * columns of digits in each small box; and `c' vice versa (here
81 * I'm also going to choose arbitrarily to list c first wherever
82 * possible: the above is a 2x3 puzzle, not a 3x2 one.
92 #ifdef STANDALONE_SOLVER
94 int solver_show_working, solver_recurse_depth;
100 * To save space, I store digits internally as unsigned char. This
101 * imposes a hard limit of 255 on the order of the puzzle. Since
102 * even a 5x5 takes unacceptably long to generate, I don't see this
103 * as a serious limitation unless something _really_ impressive
104 * happens in computing technology; but here's a typedef anyway for
105 * general good practice.
107 typedef unsigned char digit;
108 #define ORDER_MAX 255
110 #define PREFERRED_TILE_SIZE 48
111 #define TILE_SIZE (ds->tilesize)
112 #define BORDER (TILE_SIZE / 2)
113 #define GRIDEXTRA max((TILE_SIZE / 32),1)
115 #define FLASH_TIME 0.4F
117 enum { SYMM_NONE, SYMM_ROT2, SYMM_ROT4, SYMM_REF2, SYMM_REF2D, SYMM_REF4,
118 SYMM_REF4D, SYMM_REF8 };
121 DIFF_SIMPLE, DIFF_INTERSECT, DIFF_SET, DIFF_EXTREME, DIFF_RECURSIVE,
122 DIFF_AMBIGUOUS, DIFF_IMPOSSIBLE };
124 enum { DIFF_KSINGLE, DIFF_KMINMAX, DIFF_KSUMS, DIFF_KINTERSECT };
140 * To determine all possible ways to reach a given sum by adding two or
141 * three numbers from 1..9, each of which occurs exactly once in the sum,
142 * these arrays contain a list of bitmasks for each sum value, where if
143 * bit N is set, it means that N occurs in the sum. Each list is
144 * terminated by a zero if it is shorter than the size of the array.
149 unsigned long sum_bits2[18][MAX_2SUMS];
150 unsigned long sum_bits3[25][MAX_3SUMS];
151 unsigned long sum_bits4[31][MAX_4SUMS];
153 static int find_sum_bits(unsigned long *array, int idx, int value_left,
154 int addends_left, int min_addend,
155 unsigned long bitmask_so_far)
158 assert(addends_left >= 2);
160 for (i = min_addend; i < value_left; i++) {
161 unsigned long new_bitmask = bitmask_so_far | (1L << i);
162 assert(bitmask_so_far != new_bitmask);
164 if (addends_left == 2) {
165 int j = value_left - i;
170 array[idx++] = new_bitmask | (1L << j);
172 idx = find_sum_bits(array, idx, value_left - i,
173 addends_left - 1, i + 1,
179 static void precompute_sum_bits(void)
182 for (i = 3; i < 31; i++) {
185 j = find_sum_bits(sum_bits2[i], 0, i, 2, 1, 0);
186 assert (j <= MAX_2SUMS);
191 j = find_sum_bits(sum_bits3[i], 0, i, 3, 1, 0);
192 assert (j <= MAX_3SUMS);
196 j = find_sum_bits(sum_bits4[i], 0, i, 4, 1, 0);
197 assert (j <= MAX_4SUMS);
205 * For a square puzzle, `c' and `r' indicate the puzzle
206 * parameters as described above.
208 * A jigsaw-style puzzle is indicated by r==1, in which case c
209 * can be whatever it likes (there is no constraint on
210 * compositeness - a 7x7 jigsaw sudoku makes perfect sense).
212 int c, r, symm, diff, kdiff;
213 int xtype; /* require all digits in X-diagonals */
217 struct block_structure {
221 * For text formatting, we do need c and r here.
226 * For any square index, whichblock[i] gives its block index.
228 * For 0 <= b,i < cr, blocks[b][i] gives the index of the ith
229 * square in block b. nr_squares[b] gives the number of squares
230 * in block b (also the number of valid elements in blocks[b]).
232 * blocks_data holds the data pointed to by blocks.
234 * nr_squares may be NULL for block structures where all blocks are
237 int *whichblock, **blocks, *nr_squares, *blocks_data;
238 int nr_blocks, max_nr_squares;
240 #ifdef STANDALONE_SOLVER
242 * Textual descriptions of each block. For normal Sudoku these
243 * are of the form "(1,3)"; for jigsaw they are "starting at
244 * (5,7)". So the sensible usage in both cases is to say
245 * "elimination within block %s" with one of these strings.
247 * Only blocknames itself needs individually freeing; it's all
256 * For historical reasons, I use `cr' to denote the overall
257 * width/height of the puzzle. It was a natural notation when
258 * all puzzles were divided into blocks in a grid, but doesn't
259 * really make much sense given jigsaw puzzles. However, the
260 * obvious `n' is heavily used in the solver to describe the
261 * index of a number being placed, so `cr' will have to stay.
264 struct block_structure *blocks;
265 struct block_structure *kblocks; /* Blocks for killer puzzles. */
268 unsigned char *pencil; /* c*r*c*r elements */
269 unsigned char *immutable; /* marks which digits are clues */
270 int completed, cheated;
273 static game_params *default_params(void)
275 game_params *ret = snew(game_params);
280 ret->symm = SYMM_ROT2; /* a plausible default */
281 ret->diff = DIFF_BLOCK; /* so is this */
282 ret->kdiff = DIFF_KINTERSECT; /* so is this */
287 static void free_params(game_params *params)
292 static game_params *dup_params(const game_params *params)
294 game_params *ret = snew(game_params);
295 *ret = *params; /* structure copy */
299 static int game_fetch_preset(int i, char **name, game_params **params)
305 { "2x2 Trivial", { 2, 2, SYMM_ROT2, DIFF_BLOCK, DIFF_KMINMAX, FALSE, FALSE } },
306 { "2x3 Basic", { 2, 3, SYMM_ROT2, DIFF_SIMPLE, DIFF_KMINMAX, FALSE, FALSE } },
307 { "3x3 Trivial", { 3, 3, SYMM_ROT2, DIFF_BLOCK, DIFF_KMINMAX, FALSE, FALSE } },
308 { "3x3 Basic", { 3, 3, SYMM_ROT2, DIFF_SIMPLE, DIFF_KMINMAX, FALSE, FALSE } },
309 { "3x3 Basic X", { 3, 3, SYMM_ROT2, DIFF_SIMPLE, DIFF_KMINMAX, TRUE } },
310 { "3x3 Intermediate", { 3, 3, SYMM_ROT2, DIFF_INTERSECT, DIFF_KMINMAX, FALSE, FALSE } },
311 { "3x3 Advanced", { 3, 3, SYMM_ROT2, DIFF_SET, DIFF_KMINMAX, FALSE, FALSE } },
312 { "3x3 Advanced X", { 3, 3, SYMM_ROT2, DIFF_SET, DIFF_KMINMAX, TRUE } },
313 { "3x3 Extreme", { 3, 3, SYMM_ROT2, DIFF_EXTREME, DIFF_KMINMAX, FALSE, FALSE } },
314 { "3x3 Unreasonable", { 3, 3, SYMM_ROT2, DIFF_RECURSIVE, DIFF_KMINMAX, FALSE, FALSE } },
315 { "3x3 Killer", { 3, 3, SYMM_NONE, DIFF_BLOCK, DIFF_KINTERSECT, FALSE, TRUE } },
316 { "9 Jigsaw Basic", { 9, 1, SYMM_ROT2, DIFF_SIMPLE, DIFF_KMINMAX, FALSE, FALSE } },
317 { "9 Jigsaw Basic X", { 9, 1, SYMM_ROT2, DIFF_SIMPLE, DIFF_KMINMAX, TRUE } },
318 { "9 Jigsaw Advanced", { 9, 1, SYMM_ROT2, DIFF_SET, DIFF_KMINMAX, FALSE, FALSE } },
320 { "3x4 Basic", { 3, 4, SYMM_ROT2, DIFF_SIMPLE, DIFF_KMINMAX, FALSE, FALSE } },
321 { "4x4 Basic", { 4, 4, SYMM_ROT2, DIFF_SIMPLE, DIFF_KMINMAX, FALSE, FALSE } },
325 if (i < 0 || i >= lenof(presets))
328 *name = dupstr(presets[i].title);
329 *params = dup_params(&presets[i].params);
334 static void decode_params(game_params *ret, char const *string)
338 ret->c = ret->r = atoi(string);
341 while (*string && isdigit((unsigned char)*string)) string++;
342 if (*string == 'x') {
344 ret->r = atoi(string);
346 while (*string && isdigit((unsigned char)*string)) string++;
349 if (*string == 'j') {
354 } else if (*string == 'x') {
357 } else if (*string == 'k') {
360 } else if (*string == 'r' || *string == 'm' || *string == 'a') {
363 if (sc == 'm' && *string == 'd') {
370 while (*string && isdigit((unsigned char)*string)) string++;
371 if (sc == 'm' && sn == 8)
372 ret->symm = SYMM_REF8;
373 if (sc == 'm' && sn == 4)
374 ret->symm = sd ? SYMM_REF4D : SYMM_REF4;
375 if (sc == 'm' && sn == 2)
376 ret->symm = sd ? SYMM_REF2D : SYMM_REF2;
377 if (sc == 'r' && sn == 4)
378 ret->symm = SYMM_ROT4;
379 if (sc == 'r' && sn == 2)
380 ret->symm = SYMM_ROT2;
382 ret->symm = SYMM_NONE;
383 } else if (*string == 'd') {
385 if (*string == 't') /* trivial */
386 string++, ret->diff = DIFF_BLOCK;
387 else if (*string == 'b') /* basic */
388 string++, ret->diff = DIFF_SIMPLE;
389 else if (*string == 'i') /* intermediate */
390 string++, ret->diff = DIFF_INTERSECT;
391 else if (*string == 'a') /* advanced */
392 string++, ret->diff = DIFF_SET;
393 else if (*string == 'e') /* extreme */
394 string++, ret->diff = DIFF_EXTREME;
395 else if (*string == 'u') /* unreasonable */
396 string++, ret->diff = DIFF_RECURSIVE;
398 string++; /* eat unknown character */
402 static char *encode_params(const game_params *params, int full)
407 sprintf(str, "%dx%d", params->c, params->r);
409 sprintf(str, "%dj", params->c);
416 switch (params->symm) {
417 case SYMM_REF8: strcat(str, "m8"); break;
418 case SYMM_REF4: strcat(str, "m4"); break;
419 case SYMM_REF4D: strcat(str, "md4"); break;
420 case SYMM_REF2: strcat(str, "m2"); break;
421 case SYMM_REF2D: strcat(str, "md2"); break;
422 case SYMM_ROT4: strcat(str, "r4"); break;
423 /* case SYMM_ROT2: strcat(str, "r2"); break; [default] */
424 case SYMM_NONE: strcat(str, "a"); break;
426 switch (params->diff) {
427 /* case DIFF_BLOCK: strcat(str, "dt"); break; [default] */
428 case DIFF_SIMPLE: strcat(str, "db"); break;
429 case DIFF_INTERSECT: strcat(str, "di"); break;
430 case DIFF_SET: strcat(str, "da"); break;
431 case DIFF_EXTREME: strcat(str, "de"); break;
432 case DIFF_RECURSIVE: strcat(str, "du"); break;
438 static config_item *game_configure(const game_params *params)
443 ret = snewn(8, config_item);
445 ret[0].name = "Columns of sub-blocks";
446 ret[0].type = C_STRING;
447 sprintf(buf, "%d", params->c);
448 ret[0].sval = dupstr(buf);
451 ret[1].name = "Rows of sub-blocks";
452 ret[1].type = C_STRING;
453 sprintf(buf, "%d", params->r);
454 ret[1].sval = dupstr(buf);
457 ret[2].name = "\"X\" (require every number in each main diagonal)";
458 ret[2].type = C_BOOLEAN;
460 ret[2].ival = params->xtype;
462 ret[3].name = "Jigsaw (irregularly shaped sub-blocks)";
463 ret[3].type = C_BOOLEAN;
465 ret[3].ival = (params->r == 1);
467 ret[4].name = "Killer (digit sums)";
468 ret[4].type = C_BOOLEAN;
470 ret[4].ival = params->killer;
472 ret[5].name = "Symmetry";
473 ret[5].type = C_CHOICES;
474 ret[5].sval = ":None:2-way rotation:4-way rotation:2-way mirror:"
475 "2-way diagonal mirror:4-way mirror:4-way diagonal mirror:"
477 ret[5].ival = params->symm;
479 ret[6].name = "Difficulty";
480 ret[6].type = C_CHOICES;
481 ret[6].sval = ":Trivial:Basic:Intermediate:Advanced:Extreme:Unreasonable";
482 ret[6].ival = params->diff;
492 static game_params *custom_params(const config_item *cfg)
494 game_params *ret = snew(game_params);
496 ret->c = atoi(cfg[0].sval);
497 ret->r = atoi(cfg[1].sval);
498 ret->xtype = cfg[2].ival;
503 ret->killer = cfg[4].ival;
504 ret->symm = cfg[5].ival;
505 ret->diff = cfg[6].ival;
506 ret->kdiff = DIFF_KINTERSECT;
511 static char *validate_params(const game_params *params, int full)
514 return "Both dimensions must be at least 2";
515 if (params->c > ORDER_MAX || params->r > ORDER_MAX)
516 return "Dimensions greater than "STR(ORDER_MAX)" are not supported";
517 if ((params->c * params->r) > 31)
518 return "Unable to support more than 31 distinct symbols in a puzzle";
519 if (params->killer && params->c * params->r > 9)
520 return "Killer puzzle dimensions must be smaller than 10.";
525 * ----------------------------------------------------------------------
526 * Block structure functions.
529 static struct block_structure *alloc_block_structure(int c, int r, int area,
534 struct block_structure *b = snew(struct block_structure);
537 b->nr_blocks = nr_blocks;
538 b->max_nr_squares = max_nr_squares;
539 b->c = c; b->r = r; b->area = area;
540 b->whichblock = snewn(area, int);
541 b->blocks_data = snewn(nr_blocks * max_nr_squares, int);
542 b->blocks = snewn(nr_blocks, int *);
543 b->nr_squares = snewn(nr_blocks, int);
545 for (i = 0; i < nr_blocks; i++)
546 b->blocks[i] = b->blocks_data + i*max_nr_squares;
548 #ifdef STANDALONE_SOLVER
549 b->blocknames = (char **)smalloc(c*r*(sizeof(char *)+80));
550 for (i = 0; i < c * r; i++)
551 b->blocknames[i] = NULL;
556 static void free_block_structure(struct block_structure *b)
558 if (--b->refcount == 0) {
559 sfree(b->whichblock);
561 sfree(b->blocks_data);
562 #ifdef STANDALONE_SOLVER
563 sfree(b->blocknames);
565 sfree(b->nr_squares);
570 static struct block_structure *dup_block_structure(struct block_structure *b)
572 struct block_structure *nb;
575 nb = alloc_block_structure(b->c, b->r, b->area, b->max_nr_squares,
577 memcpy(nb->nr_squares, b->nr_squares, b->nr_blocks * sizeof *b->nr_squares);
578 memcpy(nb->whichblock, b->whichblock, b->area * sizeof *b->whichblock);
579 memcpy(nb->blocks_data, b->blocks_data,
580 b->nr_blocks * b->max_nr_squares * sizeof *b->blocks_data);
581 for (i = 0; i < b->nr_blocks; i++)
582 nb->blocks[i] = nb->blocks_data + i*nb->max_nr_squares;
584 #ifdef STANDALONE_SOLVER
585 memcpy(nb->blocknames, b->blocknames, b->c * b->r *(sizeof(char *)+80));
588 for (i = 0; i < b->c * b->r; i++)
589 if (b->blocknames[i] == NULL)
590 nb->blocknames[i] = NULL;
592 nb->blocknames[i] = ((char *)nb->blocknames) + (b->blocknames[i] - (char *)b->blocknames);
598 static void split_block(struct block_structure *b, int *squares, int nr_squares)
601 int previous_block = b->whichblock[squares[0]];
602 int newblock = b->nr_blocks;
604 assert(b->max_nr_squares >= nr_squares);
605 assert(b->nr_squares[previous_block] > nr_squares);
608 b->blocks_data = sresize(b->blocks_data,
609 b->nr_blocks * b->max_nr_squares, int);
610 b->nr_squares = sresize(b->nr_squares, b->nr_blocks, int);
612 b->blocks = snewn(b->nr_blocks, int *);
613 for (i = 0; i < b->nr_blocks; i++)
614 b->blocks[i] = b->blocks_data + i*b->max_nr_squares;
615 for (i = 0; i < nr_squares; i++) {
616 assert(b->whichblock[squares[i]] == previous_block);
617 b->whichblock[squares[i]] = newblock;
618 b->blocks[newblock][i] = squares[i];
620 for (i = j = 0; i < b->nr_squares[previous_block]; i++) {
622 int sq = b->blocks[previous_block][i];
623 for (k = 0; k < nr_squares; k++)
624 if (squares[k] == sq)
627 b->blocks[previous_block][j++] = sq;
629 b->nr_squares[previous_block] -= nr_squares;
630 b->nr_squares[newblock] = nr_squares;
633 static void remove_from_block(struct block_structure *blocks, int b, int n)
636 blocks->whichblock[n] = -1;
637 for (i = j = 0; i < blocks->nr_squares[b]; i++)
638 if (blocks->blocks[b][i] != n)
639 blocks->blocks[b][j++] = blocks->blocks[b][i];
641 blocks->nr_squares[b]--;
644 /* ----------------------------------------------------------------------
647 * This solver is used for two purposes:
648 * + to check solubility of a grid as we gradually remove numbers
650 * + to solve an externally generated puzzle when the user selects
653 * It supports a variety of specific modes of reasoning. By
654 * enabling or disabling subsets of these modes we can arrange a
655 * range of difficulty levels.
659 * Modes of reasoning currently supported:
661 * - Positional elimination: a number must go in a particular
662 * square because all the other empty squares in a given
663 * row/col/blk are ruled out.
665 * - Killer minmax elimination: for killer-type puzzles, a number
666 * is impossible if choosing it would cause the sum in a killer
667 * region to be guaranteed to be too large or too small.
669 * - Numeric elimination: a square must have a particular number
670 * in because all the other numbers that could go in it are
673 * - Intersectional analysis: given two domains which overlap
674 * (hence one must be a block, and the other can be a row or
675 * col), if the possible locations for a particular number in
676 * one of the domains can be narrowed down to the overlap, then
677 * that number can be ruled out everywhere but the overlap in
678 * the other domain too.
680 * - Set elimination: if there is a subset of the empty squares
681 * within a domain such that the union of the possible numbers
682 * in that subset has the same size as the subset itself, then
683 * those numbers can be ruled out everywhere else in the domain.
684 * (For example, if there are five empty squares and the
685 * possible numbers in each are 12, 23, 13, 134 and 1345, then
686 * the first three empty squares form such a subset: the numbers
687 * 1, 2 and 3 _must_ be in those three squares in some
688 * permutation, and hence we can deduce none of them can be in
689 * the fourth or fifth squares.)
690 * + You can also see this the other way round, concentrating
691 * on numbers rather than squares: if there is a subset of
692 * the unplaced numbers within a domain such that the union
693 * of all their possible positions has the same size as the
694 * subset itself, then all other numbers can be ruled out for
695 * those positions. However, it turns out that this is
696 * exactly equivalent to the first formulation at all times:
697 * there is a 1-1 correspondence between suitable subsets of
698 * the unplaced numbers and suitable subsets of the unfilled
699 * places, found by taking the _complement_ of the union of
700 * the numbers' possible positions (or the spaces' possible
703 * - Forcing chains (see comment for solver_forcing().)
705 * - Recursion. If all else fails, we pick one of the currently
706 * most constrained empty squares and take a random guess at its
707 * contents, then continue solving on that basis and see if we
711 struct solver_usage {
713 struct block_structure *blocks, *kblocks, *extra_cages;
715 * We set up a cubic array, indexed by x, y and digit; each
716 * element of this array is TRUE or FALSE according to whether
717 * or not that digit _could_ in principle go in that position.
719 * The way to index this array is cube[(y*cr+x)*cr+n-1]; there
720 * are macros below to help with this.
724 * This is the grid in which we write down our final
725 * deductions. y-coordinates in here are _not_ transformed.
729 * For killer-type puzzles, kclues holds the secondary clue for
730 * each cage. For derived cages, the clue is in extra_clues.
732 digit *kclues, *extra_clues;
734 * Now we keep track, at a slightly higher level, of what we
735 * have yet to work out, to prevent doing the same deduction
738 /* row[y*cr+n-1] TRUE if digit n has been placed in row y */
740 /* col[x*cr+n-1] TRUE if digit n has been placed in row x */
742 /* blk[i*cr+n-1] TRUE if digit n has been placed in block i */
744 /* diag[i*cr+n-1] TRUE if digit n has been placed in diagonal i */
745 unsigned char *diag; /* diag 0 is \, 1 is / */
751 #define cubepos2(xy,n) ((xy)*usage->cr+(n)-1)
752 #define cubepos(x,y,n) cubepos2((y)*usage->cr+(x),n)
753 #define cube(x,y,n) (usage->cube[cubepos(x,y,n)])
754 #define cube2(xy,n) (usage->cube[cubepos2(xy,n)])
756 #define ondiag0(xy) ((xy) % (cr+1) == 0)
757 #define ondiag1(xy) ((xy) % (cr-1) == 0 && (xy) > 0 && (xy) < cr*cr-1)
758 #define diag0(i) ((i) * (cr+1))
759 #define diag1(i) ((i+1) * (cr-1))
762 * Function called when we are certain that a particular square has
763 * a particular number in it. The y-coordinate passed in here is
766 static void solver_place(struct solver_usage *usage, int x, int y, int n)
769 int sqindex = y*cr+x;
775 * Rule out all other numbers in this square.
777 for (i = 1; i <= cr; i++)
782 * Rule out this number in all other positions in the row.
784 for (i = 0; i < cr; i++)
789 * Rule out this number in all other positions in the column.
791 for (i = 0; i < cr; i++)
796 * Rule out this number in all other positions in the block.
798 bi = usage->blocks->whichblock[sqindex];
799 for (i = 0; i < cr; i++) {
800 int bp = usage->blocks->blocks[bi][i];
806 * Enter the number in the result grid.
808 usage->grid[sqindex] = n;
811 * Cross out this number from the list of numbers left to place
812 * in its row, its column and its block.
814 usage->row[y*cr+n-1] = usage->col[x*cr+n-1] =
815 usage->blk[bi*cr+n-1] = TRUE;
818 if (ondiag0(sqindex)) {
819 for (i = 0; i < cr; i++)
820 if (diag0(i) != sqindex)
821 cube2(diag0(i),n) = FALSE;
822 usage->diag[n-1] = TRUE;
824 if (ondiag1(sqindex)) {
825 for (i = 0; i < cr; i++)
826 if (diag1(i) != sqindex)
827 cube2(diag1(i),n) = FALSE;
828 usage->diag[cr+n-1] = TRUE;
833 #if defined STANDALONE_SOLVER && defined __GNUC__
835 * Forward-declare the functions taking printf-like format arguments
836 * with __attribute__((format)) so as to ensure the argument syntax
839 struct solver_scratch;
840 static int solver_elim(struct solver_usage *usage, int *indices,
841 char *fmt, ...) __attribute__((format(printf,3,4)));
842 static int solver_intersect(struct solver_usage *usage,
843 int *indices1, int *indices2, char *fmt, ...)
844 __attribute__((format(printf,4,5)));
845 static int solver_set(struct solver_usage *usage,
846 struct solver_scratch *scratch,
847 int *indices, char *fmt, ...)
848 __attribute__((format(printf,4,5)));
851 static int solver_elim(struct solver_usage *usage, int *indices
852 #ifdef STANDALONE_SOLVER
861 * Count the number of set bits within this section of the
866 for (i = 0; i < cr; i++)
867 if (usage->cube[indices[i]]) {
881 if (!usage->grid[y*cr+x]) {
882 #ifdef STANDALONE_SOLVER
883 if (solver_show_working) {
885 printf("%*s", solver_recurse_depth*4, "");
889 printf(":\n%*s placing %d at (%d,%d)\n",
890 solver_recurse_depth*4, "", n, 1+x, 1+y);
893 solver_place(usage, x, y, n);
897 #ifdef STANDALONE_SOLVER
898 if (solver_show_working) {
900 printf("%*s", solver_recurse_depth*4, "");
904 printf(":\n%*s no possibilities available\n",
905 solver_recurse_depth*4, "");
914 static int solver_intersect(struct solver_usage *usage,
915 int *indices1, int *indices2
916 #ifdef STANDALONE_SOLVER
925 * Loop over the first domain and see if there's any set bit
926 * not also in the second.
928 for (i = j = 0; i < cr; i++) {
930 while (j < cr && indices2[j] < p)
932 if (usage->cube[p]) {
933 if (j < cr && indices2[j] == p)
934 continue; /* both domains contain this index */
936 return 0; /* there is, so we can't deduce */
941 * We have determined that all set bits in the first domain are
942 * within its overlap with the second. So loop over the second
943 * domain and remove all set bits that aren't also in that
944 * overlap; return +1 iff we actually _did_ anything.
947 for (i = j = 0; i < cr; i++) {
949 while (j < cr && indices1[j] < p)
951 if (usage->cube[p] && (j >= cr || indices1[j] != p)) {
952 #ifdef STANDALONE_SOLVER
953 if (solver_show_working) {
958 printf("%*s", solver_recurse_depth*4, "");
970 printf("%*s ruling out %d at (%d,%d)\n",
971 solver_recurse_depth*4, "", pn, 1+px, 1+py);
974 ret = +1; /* we did something */
982 struct solver_scratch {
983 unsigned char *grid, *rowidx, *colidx, *set;
984 int *neighbours, *bfsqueue;
985 int *indexlist, *indexlist2;
986 #ifdef STANDALONE_SOLVER
991 static int solver_set(struct solver_usage *usage,
992 struct solver_scratch *scratch,
994 #ifdef STANDALONE_SOLVER
1001 unsigned char *grid = scratch->grid;
1002 unsigned char *rowidx = scratch->rowidx;
1003 unsigned char *colidx = scratch->colidx;
1004 unsigned char *set = scratch->set;
1007 * We are passed a cr-by-cr matrix of booleans. Our first job
1008 * is to winnow it by finding any definite placements - i.e.
1009 * any row with a solitary 1 - and discarding that row and the
1010 * column containing the 1.
1012 memset(rowidx, TRUE, cr);
1013 memset(colidx, TRUE, cr);
1014 for (i = 0; i < cr; i++) {
1015 int count = 0, first = -1;
1016 for (j = 0; j < cr; j++)
1017 if (usage->cube[indices[i*cr+j]])
1021 * If count == 0, then there's a row with no 1s at all and
1022 * the puzzle is internally inconsistent. However, we ought
1023 * to have caught this already during the simpler reasoning
1024 * methods, so we can safely fail an assertion if we reach
1029 rowidx[i] = colidx[first] = FALSE;
1033 * Convert each of rowidx/colidx from a list of 0s and 1s to a
1034 * list of the indices of the 1s.
1036 for (i = j = 0; i < cr; i++)
1040 for (i = j = 0; i < cr; i++)
1046 * And create the smaller matrix.
1048 for (i = 0; i < n; i++)
1049 for (j = 0; j < n; j++)
1050 grid[i*cr+j] = usage->cube[indices[rowidx[i]*cr+colidx[j]]];
1053 * Having done that, we now have a matrix in which every row
1054 * has at least two 1s in. Now we search to see if we can find
1055 * a rectangle of zeroes (in the set-theoretic sense of
1056 * `rectangle', i.e. a subset of rows crossed with a subset of
1057 * columns) whose width and height add up to n.
1064 * We have a candidate set. If its size is <=1 or >=n-1
1065 * then we move on immediately.
1067 if (count > 1 && count < n-1) {
1069 * The number of rows we need is n-count. See if we can
1070 * find that many rows which each have a zero in all
1071 * the positions listed in `set'.
1074 for (i = 0; i < n; i++) {
1076 for (j = 0; j < n; j++)
1077 if (set[j] && grid[i*cr+j]) {
1086 * We expect never to be able to get _more_ than
1087 * n-count suitable rows: this would imply that (for
1088 * example) there are four numbers which between them
1089 * have at most three possible positions, and hence it
1090 * indicates a faulty deduction before this point or
1091 * even a bogus clue.
1093 if (rows > n - count) {
1094 #ifdef STANDALONE_SOLVER
1095 if (solver_show_working) {
1097 printf("%*s", solver_recurse_depth*4,
1102 printf(":\n%*s contradiction reached\n",
1103 solver_recurse_depth*4, "");
1109 if (rows >= n - count) {
1110 int progress = FALSE;
1113 * We've got one! Now, for each row which _doesn't_
1114 * satisfy the criterion, eliminate all its set
1115 * bits in the positions _not_ listed in `set'.
1116 * Return +1 (meaning progress has been made) if we
1117 * successfully eliminated anything at all.
1119 * This involves referring back through
1120 * rowidx/colidx in order to work out which actual
1121 * positions in the cube to meddle with.
1123 for (i = 0; i < n; i++) {
1125 for (j = 0; j < n; j++)
1126 if (set[j] && grid[i*cr+j]) {
1131 for (j = 0; j < n; j++)
1132 if (!set[j] && grid[i*cr+j]) {
1133 int fpos = indices[rowidx[i]*cr+colidx[j]];
1134 #ifdef STANDALONE_SOLVER
1135 if (solver_show_working) {
1140 printf("%*s", solver_recurse_depth*4,
1153 printf("%*s ruling out %d at (%d,%d)\n",
1154 solver_recurse_depth*4, "",
1159 usage->cube[fpos] = FALSE;
1171 * Binary increment: change the rightmost 0 to a 1, and
1172 * change all 1s to the right of it to 0s.
1175 while (i > 0 && set[i-1])
1176 set[--i] = 0, count--;
1178 set[--i] = 1, count++;
1187 * Look for forcing chains. A forcing chain is a path of
1188 * pairwise-exclusive squares (i.e. each pair of adjacent squares
1189 * in the path are in the same row, column or block) with the
1190 * following properties:
1192 * (a) Each square on the path has precisely two possible numbers.
1194 * (b) Each pair of squares which are adjacent on the path share
1195 * at least one possible number in common.
1197 * (c) Each square in the middle of the path shares _both_ of its
1198 * numbers with at least one of its neighbours (not the same
1199 * one with both neighbours).
1201 * These together imply that at least one of the possible number
1202 * choices at one end of the path forces _all_ the rest of the
1203 * numbers along the path. In order to make real use of this, we
1204 * need further properties:
1206 * (c) Ruling out some number N from the square at one end of the
1207 * path forces the square at the other end to take the same
1210 * (d) The two end squares are both in line with some third
1213 * (e) That third square currently has N as a possibility.
1215 * If we can find all of that lot, we can deduce that at least one
1216 * of the two ends of the forcing chain has number N, and that
1217 * therefore the mutually adjacent third square does not.
1219 * To find forcing chains, we're going to start a bfs at each
1220 * suitable square, once for each of its two possible numbers.
1222 static int solver_forcing(struct solver_usage *usage,
1223 struct solver_scratch *scratch)
1226 int *bfsqueue = scratch->bfsqueue;
1227 #ifdef STANDALONE_SOLVER
1228 int *bfsprev = scratch->bfsprev;
1230 unsigned char *number = scratch->grid;
1231 int *neighbours = scratch->neighbours;
1234 for (y = 0; y < cr; y++)
1235 for (x = 0; x < cr; x++) {
1239 * If this square doesn't have exactly two candidate
1240 * numbers, don't try it.
1242 * In this loop we also sum the candidate numbers,
1243 * which is a nasty hack to allow us to quickly find
1244 * `the other one' (since we will shortly know there
1247 for (count = t = 0, n = 1; n <= cr; n++)
1254 * Now attempt a bfs for each candidate.
1256 for (n = 1; n <= cr; n++)
1257 if (cube(x, y, n)) {
1258 int orign, currn, head, tail;
1265 memset(number, cr+1, cr*cr);
1267 bfsqueue[tail++] = y*cr+x;
1268 #ifdef STANDALONE_SOLVER
1269 bfsprev[y*cr+x] = -1;
1271 number[y*cr+x] = t - n;
1273 while (head < tail) {
1274 int xx, yy, nneighbours, xt, yt, i;
1276 xx = bfsqueue[head++];
1280 currn = number[yy*cr+xx];
1283 * Find neighbours of yy,xx.
1286 for (yt = 0; yt < cr; yt++)
1287 neighbours[nneighbours++] = yt*cr+xx;
1288 for (xt = 0; xt < cr; xt++)
1289 neighbours[nneighbours++] = yy*cr+xt;
1290 xt = usage->blocks->whichblock[yy*cr+xx];
1291 for (yt = 0; yt < cr; yt++)
1292 neighbours[nneighbours++] = usage->blocks->blocks[xt][yt];
1294 int sqindex = yy*cr+xx;
1295 if (ondiag0(sqindex)) {
1296 for (i = 0; i < cr; i++)
1297 neighbours[nneighbours++] = diag0(i);
1299 if (ondiag1(sqindex)) {
1300 for (i = 0; i < cr; i++)
1301 neighbours[nneighbours++] = diag1(i);
1306 * Try visiting each of those neighbours.
1308 for (i = 0; i < nneighbours; i++) {
1311 xt = neighbours[i] % cr;
1312 yt = neighbours[i] / cr;
1315 * We need this square to not be
1316 * already visited, and to include
1317 * currn as a possible number.
1319 if (number[yt*cr+xt] <= cr)
1321 if (!cube(xt, yt, currn))
1325 * Don't visit _this_ square a second
1328 if (xt == xx && yt == yy)
1332 * To continue with the bfs, we need
1333 * this square to have exactly two
1336 for (cc = tt = 0, nn = 1; nn <= cr; nn++)
1337 if (cube(xt, yt, nn))
1340 bfsqueue[tail++] = yt*cr+xt;
1341 #ifdef STANDALONE_SOLVER
1342 bfsprev[yt*cr+xt] = yy*cr+xx;
1344 number[yt*cr+xt] = tt - currn;
1348 * One other possibility is that this
1349 * might be the square in which we can
1350 * make a real deduction: if it's
1351 * adjacent to x,y, and currn is equal
1352 * to the original number we ruled out.
1354 if (currn == orign &&
1355 (xt == x || yt == y ||
1356 (usage->blocks->whichblock[yt*cr+xt] == usage->blocks->whichblock[y*cr+x]) ||
1357 (usage->diag && ((ondiag0(yt*cr+xt) && ondiag0(y*cr+x)) ||
1358 (ondiag1(yt*cr+xt) && ondiag1(y*cr+x)))))) {
1359 #ifdef STANDALONE_SOLVER
1360 if (solver_show_working) {
1363 printf("%*sforcing chain, %d at ends of ",
1364 solver_recurse_depth*4, "", orign);
1368 printf("%s(%d,%d)", sep, 1+xl,
1370 xl = bfsprev[yl*cr+xl];
1377 printf("\n%*s ruling out %d at (%d,%d)\n",
1378 solver_recurse_depth*4, "",
1382 cube(xt, yt, orign) = FALSE;
1393 static int solver_killer_minmax(struct solver_usage *usage,
1394 struct block_structure *cages, digit *clues,
1396 #ifdef STANDALONE_SOLVER
1404 int nsquares = cages->nr_squares[b];
1409 for (i = 0; i < nsquares; i++) {
1410 int n, x = cages->blocks[b][i];
1412 for (n = 1; n <= cr; n++)
1414 int maxval = 0, minval = 0;
1416 for (j = 0; j < nsquares; j++) {
1418 int y = cages->blocks[b][j];
1421 for (m = 1; m <= cr; m++)
1426 for (m = cr; m > 0; m--)
1432 if (maxval + n < clues[b]) {
1433 cube2(x, n) = FALSE;
1435 #ifdef STANDALONE_SOLVER
1436 if (solver_show_working)
1437 printf("%*s ruling out %d at (%d,%d) as too low %s\n",
1438 solver_recurse_depth*4, "killer minmax analysis",
1439 n, 1 + x%cr, 1 + x/cr, extra);
1442 if (minval + n > clues[b]) {
1443 cube2(x, n) = FALSE;
1445 #ifdef STANDALONE_SOLVER
1446 if (solver_show_working)
1447 printf("%*s ruling out %d at (%d,%d) as too high %s\n",
1448 solver_recurse_depth*4, "killer minmax analysis",
1449 n, 1 + x%cr, 1 + x/cr, extra);
1457 static int solver_killer_sums(struct solver_usage *usage, int b,
1458 struct block_structure *cages, int clue,
1460 #ifdef STANDALONE_SOLVER
1461 , const char *cage_type
1466 int i, ret, max_sums;
1467 int nsquares = cages->nr_squares[b];
1468 unsigned long *sumbits, possible_addends;
1471 assert(nsquares == 0);
1474 assert(nsquares > 0);
1476 if (nsquares < 2 || nsquares > 4)
1479 if (!cage_is_region) {
1480 int known_row = -1, known_col = -1, known_block = -1;
1482 * Verify that the cage lies entirely within one region,
1483 * so that using the precomputed sums is valid.
1485 for (i = 0; i < nsquares; i++) {
1486 int x = cages->blocks[b][i];
1488 assert(usage->grid[x] == 0);
1493 known_block = usage->blocks->whichblock[x];
1495 if (known_row != x/cr)
1497 if (known_col != x%cr)
1499 if (known_block != usage->blocks->whichblock[x])
1503 if (known_block == -1 && known_col == -1 && known_row == -1)
1506 if (nsquares == 2) {
1507 if (clue < 3 || clue > 17)
1510 sumbits = sum_bits2[clue];
1511 max_sums = MAX_2SUMS;
1512 } else if (nsquares == 3) {
1513 if (clue < 6 || clue > 24)
1516 sumbits = sum_bits3[clue];
1517 max_sums = MAX_3SUMS;
1519 if (clue < 10 || clue > 30)
1522 sumbits = sum_bits4[clue];
1523 max_sums = MAX_4SUMS;
1526 * For every possible way to get the sum, see if there is
1527 * one square in the cage that disallows all the required
1528 * addends. If we find one such square, this way to compute
1529 * the sum is impossible.
1531 possible_addends = 0;
1532 for (i = 0; i < max_sums; i++) {
1534 unsigned long bits = sumbits[i];
1539 for (j = 0; j < nsquares; j++) {
1541 unsigned long square_bits = bits;
1542 int x = cages->blocks[b][j];
1543 for (n = 1; n <= cr; n++)
1545 square_bits &= ~(1L << n);
1546 if (square_bits == 0) {
1551 possible_addends |= bits;
1554 * Now we know which addends can possibly be used to
1555 * compute the sum. Remove all other digits from the
1556 * set of possibilities.
1558 if (possible_addends == 0)
1562 for (i = 0; i < nsquares; i++) {
1564 int x = cages->blocks[b][i];
1565 for (n = 1; n <= cr; n++) {
1568 if ((possible_addends & (1 << n)) == 0) {
1569 cube2(x, n) = FALSE;
1571 #ifdef STANDALONE_SOLVER
1572 if (solver_show_working) {
1573 printf("%*s using %s\n",
1574 solver_recurse_depth*4, "killer sums analysis",
1576 printf("%*s ruling out %d at (%d,%d) due to impossible %d-sum\n",
1577 solver_recurse_depth*4, "",
1578 n, 1 + x%cr, 1 + x/cr, nsquares);
1587 static int filter_whole_cages(struct solver_usage *usage, int *squares, int n,
1593 /* First, filter squares with a clue. */
1594 for (i = j = 0; i < n; i++)
1595 if (usage->grid[squares[i]])
1596 *filtered_sum += usage->grid[squares[i]];
1598 squares[j++] = squares[i];
1602 * Filter all cages that are covered entirely by the list of
1606 for (b = 0; b < usage->kblocks->nr_blocks && off < n; b++) {
1607 int b_squares = usage->kblocks->nr_squares[b];
1614 * Find all squares of block b that lie in our list,
1615 * and make them contiguous at off, which is the current position
1616 * in the output list.
1618 for (i = 0; i < b_squares; i++) {
1619 for (j = off; j < n; j++)
1620 if (squares[j] == usage->kblocks->blocks[b][i]) {
1621 int t = squares[off + matched];
1622 squares[off + matched] = squares[j];
1628 /* If so, filter out all squares of b from the list. */
1629 if (matched != usage->kblocks->nr_squares[b]) {
1633 memmove(squares + off, squares + off + matched,
1634 (n - off - matched) * sizeof *squares);
1637 *filtered_sum += usage->kclues[b];
1643 static struct solver_scratch *solver_new_scratch(struct solver_usage *usage)
1645 struct solver_scratch *scratch = snew(struct solver_scratch);
1647 scratch->grid = snewn(cr*cr, unsigned char);
1648 scratch->rowidx = snewn(cr, unsigned char);
1649 scratch->colidx = snewn(cr, unsigned char);
1650 scratch->set = snewn(cr, unsigned char);
1651 scratch->neighbours = snewn(5*cr, int);
1652 scratch->bfsqueue = snewn(cr*cr, int);
1653 #ifdef STANDALONE_SOLVER
1654 scratch->bfsprev = snewn(cr*cr, int);
1656 scratch->indexlist = snewn(cr*cr, int); /* used for set elimination */
1657 scratch->indexlist2 = snewn(cr, int); /* only used for intersect() */
1661 static void solver_free_scratch(struct solver_scratch *scratch)
1663 #ifdef STANDALONE_SOLVER
1664 sfree(scratch->bfsprev);
1666 sfree(scratch->bfsqueue);
1667 sfree(scratch->neighbours);
1668 sfree(scratch->set);
1669 sfree(scratch->colidx);
1670 sfree(scratch->rowidx);
1671 sfree(scratch->grid);
1672 sfree(scratch->indexlist);
1673 sfree(scratch->indexlist2);
1678 * Used for passing information about difficulty levels between the solver
1682 /* Maximum levels allowed. */
1683 int maxdiff, maxkdiff;
1684 /* Levels reached by the solver. */
1688 static void solver(int cr, struct block_structure *blocks,
1689 struct block_structure *kblocks, int xtype,
1690 digit *grid, digit *kgrid, struct difficulty *dlev)
1692 struct solver_usage *usage;
1693 struct solver_scratch *scratch;
1694 int x, y, b, i, n, ret;
1695 int diff = DIFF_BLOCK;
1696 int kdiff = DIFF_KSINGLE;
1699 * Set up a usage structure as a clean slate (everything
1702 usage = snew(struct solver_usage);
1704 usage->blocks = blocks;
1706 usage->kblocks = dup_block_structure(kblocks);
1707 usage->extra_cages = alloc_block_structure (kblocks->c, kblocks->r,
1708 cr * cr, cr, cr * cr);
1709 usage->extra_clues = snewn(cr*cr, digit);
1711 usage->kblocks = usage->extra_cages = NULL;
1712 usage->extra_clues = NULL;
1714 usage->cube = snewn(cr*cr*cr, unsigned char);
1715 usage->grid = grid; /* write straight back to the input */
1720 nclues = kblocks->nr_blocks;
1722 * Allow for expansion of the killer regions, the absolute
1723 * limit is obviously one region per square.
1725 usage->kclues = snewn(cr*cr, digit);
1726 for (i = 0; i < nclues; i++) {
1727 for (n = 0; n < kblocks->nr_squares[i]; n++)
1728 if (kgrid[kblocks->blocks[i][n]] != 0)
1729 usage->kclues[i] = kgrid[kblocks->blocks[i][n]];
1730 assert(usage->kclues[i] > 0);
1732 memset(usage->kclues + nclues, 0, cr*cr - nclues);
1734 usage->kclues = NULL;
1737 memset(usage->cube, TRUE, cr*cr*cr);
1739 usage->row = snewn(cr * cr, unsigned char);
1740 usage->col = snewn(cr * cr, unsigned char);
1741 usage->blk = snewn(cr * cr, unsigned char);
1742 memset(usage->row, FALSE, cr * cr);
1743 memset(usage->col, FALSE, cr * cr);
1744 memset(usage->blk, FALSE, cr * cr);
1747 usage->diag = snewn(cr * 2, unsigned char);
1748 memset(usage->diag, FALSE, cr * 2);
1752 usage->nr_regions = cr * 3 + (xtype ? 2 : 0);
1753 usage->regions = snewn(cr * usage->nr_regions, int);
1754 usage->sq2region = snewn(cr * cr * 3, int *);
1756 for (n = 0; n < cr; n++) {
1757 for (i = 0; i < cr; i++) {
1760 b = usage->blocks->blocks[n][i];
1761 usage->regions[cr*n*3 + i] = x;
1762 usage->regions[cr*n*3 + cr + i] = y;
1763 usage->regions[cr*n*3 + 2*cr + i] = b;
1764 usage->sq2region[x*3] = usage->regions + cr*n*3;
1765 usage->sq2region[y*3 + 1] = usage->regions + cr*n*3 + cr;
1766 usage->sq2region[b*3 + 2] = usage->regions + cr*n*3 + 2*cr;
1770 scratch = solver_new_scratch(usage);
1773 * Place all the clue numbers we are given.
1775 for (x = 0; x < cr; x++)
1776 for (y = 0; y < cr; y++) {
1777 int n = grid[y*cr+x];
1780 diff = DIFF_IMPOSSIBLE;
1783 solver_place(usage, x, y, grid[y*cr+x]);
1788 * Now loop over the grid repeatedly trying all permitted modes
1789 * of reasoning. The loop terminates if we complete an
1790 * iteration without making any progress; we then return
1791 * failure or success depending on whether the grid is full or
1796 * I'd like to write `continue;' inside each of the
1797 * following loops, so that the solver returns here after
1798 * making some progress. However, I can't specify that I
1799 * want to continue an outer loop rather than the innermost
1800 * one, so I'm apologetically resorting to a goto.
1805 * Blockwise positional elimination.
1807 for (b = 0; b < cr; b++)
1808 for (n = 1; n <= cr; n++)
1809 if (!usage->blk[b*cr+n-1]) {
1810 for (i = 0; i < cr; i++)
1811 scratch->indexlist[i] = cubepos2(usage->blocks->blocks[b][i],n);
1812 ret = solver_elim(usage, scratch->indexlist
1813 #ifdef STANDALONE_SOLVER
1814 , "positional elimination,"
1815 " %d in block %s", n,
1816 usage->blocks->blocknames[b]
1820 diff = DIFF_IMPOSSIBLE;
1822 } else if (ret > 0) {
1823 diff = max(diff, DIFF_BLOCK);
1828 if (usage->kclues != NULL) {
1829 int changed = FALSE;
1832 * First, bring the kblocks into a more useful form: remove
1833 * all filled-in squares, and reduce the sum by their values.
1834 * Walk in reverse order, since otherwise remove_from_block
1835 * can move element past our loop counter.
1837 for (b = 0; b < usage->kblocks->nr_blocks; b++)
1838 for (i = usage->kblocks->nr_squares[b] -1; i >= 0; i--) {
1839 int x = usage->kblocks->blocks[b][i];
1840 int t = usage->grid[x];
1844 remove_from_block(usage->kblocks, b, x);
1845 if (t > usage->kclues[b]) {
1846 diff = DIFF_IMPOSSIBLE;
1849 usage->kclues[b] -= t;
1851 * Since cages are regions, this tells us something
1852 * about the other squares in the cage.
1854 for (n = 0; n < usage->kblocks->nr_squares[b]; n++) {
1855 cube2(usage->kblocks->blocks[b][n], t) = FALSE;
1860 * The most trivial kind of solver for killer puzzles: fill
1861 * single-square cages.
1863 for (b = 0; b < usage->kblocks->nr_blocks; b++) {
1864 int squares = usage->kblocks->nr_squares[b];
1866 int v = usage->kclues[b];
1867 if (v < 1 || v > cr) {
1868 diff = DIFF_IMPOSSIBLE;
1871 x = usage->kblocks->blocks[b][0] % cr;
1872 y = usage->kblocks->blocks[b][0] / cr;
1873 if (!cube(x, y, v)) {
1874 diff = DIFF_IMPOSSIBLE;
1877 solver_place(usage, x, y, v);
1879 #ifdef STANDALONE_SOLVER
1880 if (solver_show_working) {
1881 printf("%*s placing %d at (%d,%d)\n",
1882 solver_recurse_depth*4, "killer single-square cage",
1883 v, 1 + x%cr, 1 + x/cr);
1891 kdiff = max(kdiff, DIFF_KSINGLE);
1895 if (dlev->maxkdiff >= DIFF_KINTERSECT && usage->kclues != NULL) {
1896 int changed = FALSE;
1898 * Now, create the extra_cages information. Every full region
1899 * (row, column, or block) has the same sum total (45 for 3x3
1900 * puzzles. After we try to cover these regions with cages that
1901 * lie entirely within them, any squares that remain must bring
1902 * the total to this known value, and so they form additional
1903 * cages which aren't immediately evident in the displayed form
1906 usage->extra_cages->nr_blocks = 0;
1907 for (i = 0; i < 3; i++) {
1908 for (n = 0; n < cr; n++) {
1909 int *region = usage->regions + cr*n*3 + i*cr;
1910 int sum = cr * (cr + 1) / 2;
1913 int n_extra = usage->extra_cages->nr_blocks;
1914 int *extra_list = usage->extra_cages->blocks[n_extra];
1915 memcpy(extra_list, region, cr * sizeof *extra_list);
1917 nsquares = filter_whole_cages(usage, extra_list, nsquares, &filtered);
1919 if (nsquares == cr || nsquares == 0)
1921 if (dlev->maxdiff >= DIFF_RECURSIVE) {
1923 dlev->diff = DIFF_IMPOSSIBLE;
1929 if (nsquares == 1) {
1931 diff = DIFF_IMPOSSIBLE;
1934 x = extra_list[0] % cr;
1935 y = extra_list[0] / cr;
1936 if (!cube(x, y, sum)) {
1937 diff = DIFF_IMPOSSIBLE;
1940 solver_place(usage, x, y, sum);
1942 #ifdef STANDALONE_SOLVER
1943 if (solver_show_working) {
1944 printf("%*s placing %d at (%d,%d)\n",
1945 solver_recurse_depth*4, "killer single-square deduced cage",
1951 b = usage->kblocks->whichblock[extra_list[0]];
1952 for (x = 1; x < nsquares; x++)
1953 if (usage->kblocks->whichblock[extra_list[x]] != b)
1955 if (x == nsquares) {
1956 assert(usage->kblocks->nr_squares[b] > nsquares);
1957 split_block(usage->kblocks, extra_list, nsquares);
1958 assert(usage->kblocks->nr_squares[usage->kblocks->nr_blocks - 1] == nsquares);
1959 usage->kclues[usage->kblocks->nr_blocks - 1] = sum;
1960 usage->kclues[b] -= sum;
1962 usage->extra_cages->nr_squares[n_extra] = nsquares;
1963 usage->extra_cages->nr_blocks++;
1964 usage->extra_clues[n_extra] = sum;
1969 kdiff = max(kdiff, DIFF_KINTERSECT);
1975 * Another simple killer-type elimination. For every square in a
1976 * cage, find the minimum and maximum possible sums of all the
1977 * other squares in the same cage, and rule out possibilities
1978 * for the given square based on whether they are guaranteed to
1979 * cause the sum to be either too high or too low.
1980 * This is a special case of trying all possible sums across a
1981 * region, which is a recursive algorithm. We should probably
1982 * implement it for a higher difficulty level.
1984 if (dlev->maxkdiff >= DIFF_KMINMAX && usage->kclues != NULL) {
1985 int changed = FALSE;
1986 for (b = 0; b < usage->kblocks->nr_blocks; b++) {
1987 int ret = solver_killer_minmax(usage, usage->kblocks,
1989 #ifdef STANDALONE_SOLVER
1994 diff = DIFF_IMPOSSIBLE;
1999 for (b = 0; b < usage->extra_cages->nr_blocks; b++) {
2000 int ret = solver_killer_minmax(usage, usage->extra_cages,
2001 usage->extra_clues, b
2002 #ifdef STANDALONE_SOLVER
2003 , "using deduced cages"
2007 diff = DIFF_IMPOSSIBLE;
2013 kdiff = max(kdiff, DIFF_KMINMAX);
2019 * Try to use knowledge of which numbers can be used to generate
2021 * This can only be used if a cage lies entirely within a region.
2023 if (dlev->maxkdiff >= DIFF_KSUMS && usage->kclues != NULL) {
2024 int changed = FALSE;
2026 for (b = 0; b < usage->kblocks->nr_blocks; b++) {
2027 int ret = solver_killer_sums(usage, b, usage->kblocks,
2028 usage->kclues[b], TRUE
2029 #ifdef STANDALONE_SOLVER
2035 kdiff = max(kdiff, DIFF_KSUMS);
2036 } else if (ret < 0) {
2037 diff = DIFF_IMPOSSIBLE;
2042 for (b = 0; b < usage->extra_cages->nr_blocks; b++) {
2043 int ret = solver_killer_sums(usage, b, usage->extra_cages,
2044 usage->extra_clues[b], FALSE
2045 #ifdef STANDALONE_SOLVER
2051 kdiff = max(kdiff, DIFF_KSUMS);
2052 } else if (ret < 0) {
2053 diff = DIFF_IMPOSSIBLE;
2062 if (dlev->maxdiff <= DIFF_BLOCK)
2066 * Row-wise positional elimination.
2068 for (y = 0; y < cr; y++)
2069 for (n = 1; n <= cr; n++)
2070 if (!usage->row[y*cr+n-1]) {
2071 for (x = 0; x < cr; x++)
2072 scratch->indexlist[x] = cubepos(x, y, n);
2073 ret = solver_elim(usage, scratch->indexlist
2074 #ifdef STANDALONE_SOLVER
2075 , "positional elimination,"
2076 " %d in row %d", n, 1+y
2080 diff = DIFF_IMPOSSIBLE;
2082 } else if (ret > 0) {
2083 diff = max(diff, DIFF_SIMPLE);
2088 * Column-wise positional elimination.
2090 for (x = 0; x < cr; x++)
2091 for (n = 1; n <= cr; n++)
2092 if (!usage->col[x*cr+n-1]) {
2093 for (y = 0; y < cr; y++)
2094 scratch->indexlist[y] = cubepos(x, y, n);
2095 ret = solver_elim(usage, scratch->indexlist
2096 #ifdef STANDALONE_SOLVER
2097 , "positional elimination,"
2098 " %d in column %d", n, 1+x
2102 diff = DIFF_IMPOSSIBLE;
2104 } else if (ret > 0) {
2105 diff = max(diff, DIFF_SIMPLE);
2111 * X-diagonal positional elimination.
2114 for (n = 1; n <= cr; n++)
2115 if (!usage->diag[n-1]) {
2116 for (i = 0; i < cr; i++)
2117 scratch->indexlist[i] = cubepos2(diag0(i), n);
2118 ret = solver_elim(usage, scratch->indexlist
2119 #ifdef STANDALONE_SOLVER
2120 , "positional elimination,"
2121 " %d in \\-diagonal", n
2125 diff = DIFF_IMPOSSIBLE;
2127 } else if (ret > 0) {
2128 diff = max(diff, DIFF_SIMPLE);
2132 for (n = 1; n <= cr; n++)
2133 if (!usage->diag[cr+n-1]) {
2134 for (i = 0; i < cr; i++)
2135 scratch->indexlist[i] = cubepos2(diag1(i), n);
2136 ret = solver_elim(usage, scratch->indexlist
2137 #ifdef STANDALONE_SOLVER
2138 , "positional elimination,"
2139 " %d in /-diagonal", n
2143 diff = DIFF_IMPOSSIBLE;
2145 } else if (ret > 0) {
2146 diff = max(diff, DIFF_SIMPLE);
2153 * Numeric elimination.
2155 for (x = 0; x < cr; x++)
2156 for (y = 0; y < cr; y++)
2157 if (!usage->grid[y*cr+x]) {
2158 for (n = 1; n <= cr; n++)
2159 scratch->indexlist[n-1] = cubepos(x, y, n);
2160 ret = solver_elim(usage, scratch->indexlist
2161 #ifdef STANDALONE_SOLVER
2162 , "numeric elimination at (%d,%d)",
2167 diff = DIFF_IMPOSSIBLE;
2169 } else if (ret > 0) {
2170 diff = max(diff, DIFF_SIMPLE);
2175 if (dlev->maxdiff <= DIFF_SIMPLE)
2179 * Intersectional analysis, rows vs blocks.
2181 for (y = 0; y < cr; y++)
2182 for (b = 0; b < cr; b++)
2183 for (n = 1; n <= cr; n++) {
2184 if (usage->row[y*cr+n-1] ||
2185 usage->blk[b*cr+n-1])
2187 for (i = 0; i < cr; i++) {
2188 scratch->indexlist[i] = cubepos(i, y, n);
2189 scratch->indexlist2[i] = cubepos2(usage->blocks->blocks[b][i], n);
2192 * solver_intersect() never returns -1.
2194 if (solver_intersect(usage, scratch->indexlist,
2196 #ifdef STANDALONE_SOLVER
2197 , "intersectional analysis,"
2198 " %d in row %d vs block %s",
2199 n, 1+y, usage->blocks->blocknames[b]
2202 solver_intersect(usage, scratch->indexlist2,
2204 #ifdef STANDALONE_SOLVER
2205 , "intersectional analysis,"
2206 " %d in block %s vs row %d",
2207 n, usage->blocks->blocknames[b], 1+y
2210 diff = max(diff, DIFF_INTERSECT);
2216 * Intersectional analysis, columns vs blocks.
2218 for (x = 0; x < cr; x++)
2219 for (b = 0; b < cr; b++)
2220 for (n = 1; n <= cr; n++) {
2221 if (usage->col[x*cr+n-1] ||
2222 usage->blk[b*cr+n-1])
2224 for (i = 0; i < cr; i++) {
2225 scratch->indexlist[i] = cubepos(x, i, n);
2226 scratch->indexlist2[i] = cubepos2(usage->blocks->blocks[b][i], n);
2228 if (solver_intersect(usage, scratch->indexlist,
2230 #ifdef STANDALONE_SOLVER
2231 , "intersectional analysis,"
2232 " %d in column %d vs block %s",
2233 n, 1+x, usage->blocks->blocknames[b]
2236 solver_intersect(usage, scratch->indexlist2,
2238 #ifdef STANDALONE_SOLVER
2239 , "intersectional analysis,"
2240 " %d in block %s vs column %d",
2241 n, usage->blocks->blocknames[b], 1+x
2244 diff = max(diff, DIFF_INTERSECT);
2251 * Intersectional analysis, \-diagonal vs blocks.
2253 for (b = 0; b < cr; b++)
2254 for (n = 1; n <= cr; n++) {
2255 if (usage->diag[n-1] ||
2256 usage->blk[b*cr+n-1])
2258 for (i = 0; i < cr; i++) {
2259 scratch->indexlist[i] = cubepos2(diag0(i), n);
2260 scratch->indexlist2[i] = cubepos2(usage->blocks->blocks[b][i], n);
2262 if (solver_intersect(usage, scratch->indexlist,
2264 #ifdef STANDALONE_SOLVER
2265 , "intersectional analysis,"
2266 " %d in \\-diagonal vs block %s",
2267 n, usage->blocks->blocknames[b]
2270 solver_intersect(usage, scratch->indexlist2,
2272 #ifdef STANDALONE_SOLVER
2273 , "intersectional analysis,"
2274 " %d in block %s vs \\-diagonal",
2275 n, usage->blocks->blocknames[b]
2278 diff = max(diff, DIFF_INTERSECT);
2284 * Intersectional analysis, /-diagonal vs blocks.
2286 for (b = 0; b < cr; b++)
2287 for (n = 1; n <= cr; n++) {
2288 if (usage->diag[cr+n-1] ||
2289 usage->blk[b*cr+n-1])
2291 for (i = 0; i < cr; i++) {
2292 scratch->indexlist[i] = cubepos2(diag1(i), n);
2293 scratch->indexlist2[i] = cubepos2(usage->blocks->blocks[b][i], n);
2295 if (solver_intersect(usage, scratch->indexlist,
2297 #ifdef STANDALONE_SOLVER
2298 , "intersectional analysis,"
2299 " %d in /-diagonal vs block %s",
2300 n, usage->blocks->blocknames[b]
2303 solver_intersect(usage, scratch->indexlist2,
2305 #ifdef STANDALONE_SOLVER
2306 , "intersectional analysis,"
2307 " %d in block %s vs /-diagonal",
2308 n, usage->blocks->blocknames[b]
2311 diff = max(diff, DIFF_INTERSECT);
2317 if (dlev->maxdiff <= DIFF_INTERSECT)
2321 * Blockwise set elimination.
2323 for (b = 0; b < cr; b++) {
2324 for (i = 0; i < cr; i++)
2325 for (n = 1; n <= cr; n++)
2326 scratch->indexlist[i*cr+n-1] = cubepos2(usage->blocks->blocks[b][i], n);
2327 ret = solver_set(usage, scratch, scratch->indexlist
2328 #ifdef STANDALONE_SOLVER
2329 , "set elimination, block %s",
2330 usage->blocks->blocknames[b]
2334 diff = DIFF_IMPOSSIBLE;
2336 } else if (ret > 0) {
2337 diff = max(diff, DIFF_SET);
2343 * Row-wise set elimination.
2345 for (y = 0; y < cr; y++) {
2346 for (x = 0; x < cr; x++)
2347 for (n = 1; n <= cr; n++)
2348 scratch->indexlist[x*cr+n-1] = cubepos(x, y, n);
2349 ret = solver_set(usage, scratch, scratch->indexlist
2350 #ifdef STANDALONE_SOLVER
2351 , "set elimination, row %d", 1+y
2355 diff = DIFF_IMPOSSIBLE;
2357 } else if (ret > 0) {
2358 diff = max(diff, DIFF_SET);
2364 * Column-wise set elimination.
2366 for (x = 0; x < cr; x++) {
2367 for (y = 0; y < cr; y++)
2368 for (n = 1; n <= cr; n++)
2369 scratch->indexlist[y*cr+n-1] = cubepos(x, y, n);
2370 ret = solver_set(usage, scratch, scratch->indexlist
2371 #ifdef STANDALONE_SOLVER
2372 , "set elimination, column %d", 1+x
2376 diff = DIFF_IMPOSSIBLE;
2378 } else if (ret > 0) {
2379 diff = max(diff, DIFF_SET);
2386 * \-diagonal set elimination.
2388 for (i = 0; i < cr; i++)
2389 for (n = 1; n <= cr; n++)
2390 scratch->indexlist[i*cr+n-1] = cubepos2(diag0(i), n);
2391 ret = solver_set(usage, scratch, scratch->indexlist
2392 #ifdef STANDALONE_SOLVER
2393 , "set elimination, \\-diagonal"
2397 diff = DIFF_IMPOSSIBLE;
2399 } else if (ret > 0) {
2400 diff = max(diff, DIFF_SET);
2405 * /-diagonal set elimination.
2407 for (i = 0; i < cr; i++)
2408 for (n = 1; n <= cr; n++)
2409 scratch->indexlist[i*cr+n-1] = cubepos2(diag1(i), n);
2410 ret = solver_set(usage, scratch, scratch->indexlist
2411 #ifdef STANDALONE_SOLVER
2412 , "set elimination, /-diagonal"
2416 diff = DIFF_IMPOSSIBLE;
2418 } else if (ret > 0) {
2419 diff = max(diff, DIFF_SET);
2424 if (dlev->maxdiff <= DIFF_SET)
2428 * Row-vs-column set elimination on a single number.
2430 for (n = 1; n <= cr; n++) {
2431 for (y = 0; y < cr; y++)
2432 for (x = 0; x < cr; x++)
2433 scratch->indexlist[y*cr+x] = cubepos(x, y, n);
2434 ret = solver_set(usage, scratch, scratch->indexlist
2435 #ifdef STANDALONE_SOLVER
2436 , "positional set elimination, number %d", n
2440 diff = DIFF_IMPOSSIBLE;
2442 } else if (ret > 0) {
2443 diff = max(diff, DIFF_EXTREME);
2451 if (solver_forcing(usage, scratch)) {
2452 diff = max(diff, DIFF_EXTREME);
2457 * If we reach here, we have made no deductions in this
2458 * iteration, so the algorithm terminates.
2464 * Last chance: if we haven't fully solved the puzzle yet, try
2465 * recursing based on guesses for a particular square. We pick
2466 * one of the most constrained empty squares we can find, which
2467 * has the effect of pruning the search tree as much as
2470 if (dlev->maxdiff >= DIFF_RECURSIVE) {
2471 int best, bestcount;
2476 for (y = 0; y < cr; y++)
2477 for (x = 0; x < cr; x++)
2478 if (!grid[y*cr+x]) {
2482 * An unfilled square. Count the number of
2483 * possible digits in it.
2486 for (n = 1; n <= cr; n++)
2491 * We should have found any impossibilities
2492 * already, so this can safely be an assert.
2496 if (count < bestcount) {
2504 digit *list, *ingrid, *outgrid;
2506 diff = DIFF_IMPOSSIBLE; /* no solution found yet */
2509 * Attempt recursion.
2514 list = snewn(cr, digit);
2515 ingrid = snewn(cr * cr, digit);
2516 outgrid = snewn(cr * cr, digit);
2517 memcpy(ingrid, grid, cr * cr);
2519 /* Make a list of the possible digits. */
2520 for (j = 0, n = 1; n <= cr; n++)
2524 #ifdef STANDALONE_SOLVER
2525 if (solver_show_working) {
2527 printf("%*srecursing on (%d,%d) [",
2528 solver_recurse_depth*4, "", x + 1, y + 1);
2529 for (i = 0; i < j; i++) {
2530 printf("%s%d", sep, list[i]);
2538 * And step along the list, recursing back into the
2539 * main solver at every stage.
2541 for (i = 0; i < j; i++) {
2542 memcpy(outgrid, ingrid, cr * cr);
2543 outgrid[y*cr+x] = list[i];
2545 #ifdef STANDALONE_SOLVER
2546 if (solver_show_working)
2547 printf("%*sguessing %d at (%d,%d)\n",
2548 solver_recurse_depth*4, "", list[i], x + 1, y + 1);
2549 solver_recurse_depth++;
2552 solver(cr, blocks, kblocks, xtype, outgrid, kgrid, dlev);
2554 #ifdef STANDALONE_SOLVER
2555 solver_recurse_depth--;
2556 if (solver_show_working) {
2557 printf("%*sretracting %d at (%d,%d)\n",
2558 solver_recurse_depth*4, "", list[i], x + 1, y + 1);
2563 * If we have our first solution, copy it into the
2564 * grid we will return.
2566 if (diff == DIFF_IMPOSSIBLE && dlev->diff != DIFF_IMPOSSIBLE)
2567 memcpy(grid, outgrid, cr*cr);
2569 if (dlev->diff == DIFF_AMBIGUOUS)
2570 diff = DIFF_AMBIGUOUS;
2571 else if (dlev->diff == DIFF_IMPOSSIBLE)
2572 /* do not change our return value */;
2574 /* the recursion turned up exactly one solution */
2575 if (diff == DIFF_IMPOSSIBLE)
2576 diff = DIFF_RECURSIVE;
2578 diff = DIFF_AMBIGUOUS;
2582 * As soon as we've found more than one solution,
2583 * give up immediately.
2585 if (diff == DIFF_AMBIGUOUS)
2596 * We're forbidden to use recursion, so we just see whether
2597 * our grid is fully solved, and return DIFF_IMPOSSIBLE
2600 for (y = 0; y < cr; y++)
2601 for (x = 0; x < cr; x++)
2603 diff = DIFF_IMPOSSIBLE;
2608 dlev->kdiff = kdiff;
2610 #ifdef STANDALONE_SOLVER
2611 if (solver_show_working)
2612 printf("%*s%s found\n",
2613 solver_recurse_depth*4, "",
2614 diff == DIFF_IMPOSSIBLE ? "no solution" :
2615 diff == DIFF_AMBIGUOUS ? "multiple solutions" :
2619 sfree(usage->sq2region);
2620 sfree(usage->regions);
2625 if (usage->kblocks) {
2626 free_block_structure(usage->kblocks);
2627 free_block_structure(usage->extra_cages);
2628 sfree(usage->extra_clues);
2630 if (usage->kclues) sfree(usage->kclues);
2633 solver_free_scratch(scratch);
2636 /* ----------------------------------------------------------------------
2637 * End of solver code.
2640 /* ----------------------------------------------------------------------
2641 * Killer set generator.
2644 /* ----------------------------------------------------------------------
2645 * Solo filled-grid generator.
2647 * This grid generator works by essentially trying to solve a grid
2648 * starting from no clues, and not worrying that there's more than
2649 * one possible solution. Unfortunately, it isn't computationally
2650 * feasible to do this by calling the above solver with an empty
2651 * grid, because that one needs to allocate a lot of scratch space
2652 * at every recursion level. Instead, I have a much simpler
2653 * algorithm which I shamelessly copied from a Python solver
2654 * written by Andrew Wilkinson (which is GPLed, but I've reused
2655 * only ideas and no code). It mostly just does the obvious
2656 * recursive thing: pick an empty square, put one of the possible
2657 * digits in it, recurse until all squares are filled, backtrack
2658 * and change some choices if necessary.
2660 * The clever bit is that every time it chooses which square to
2661 * fill in next, it does so by counting the number of _possible_
2662 * numbers that can go in each square, and it prioritises so that
2663 * it picks a square with the _lowest_ number of possibilities. The
2664 * idea is that filling in lots of the obvious bits (particularly
2665 * any squares with only one possibility) will cut down on the list
2666 * of possibilities for other squares and hence reduce the enormous
2667 * search space as much as possible as early as possible.
2669 * The use of bit sets implies that we support puzzles up to a size of
2670 * 32x32 (less if anyone finds a 16-bit machine to compile this on).
2674 * Internal data structure used in gridgen to keep track of
2677 struct gridgen_coord { int x, y, r; };
2678 struct gridgen_usage {
2680 struct block_structure *blocks, *kblocks;
2681 /* grid is a copy of the input grid, modified as we go along */
2684 * Bitsets. In each of them, bit n is set if digit n has been placed
2685 * in the corresponding region. row, col and blk are used for all
2686 * puzzles. cge is used only for killer puzzles, and diag is used
2687 * only for x-type puzzles.
2688 * All of these have cr entries, except diag which only has 2,
2689 * and cge, which has as many entries as kblocks.
2691 unsigned int *row, *col, *blk, *cge, *diag;
2692 /* This lists all the empty spaces remaining in the grid. */
2693 struct gridgen_coord *spaces;
2695 /* If we need randomisation in the solve, this is our random state. */
2699 static void gridgen_place(struct gridgen_usage *usage, int x, int y, digit n)
2701 unsigned int bit = 1 << n;
2703 usage->row[y] |= bit;
2704 usage->col[x] |= bit;
2705 usage->blk[usage->blocks->whichblock[y*cr+x]] |= bit;
2707 usage->cge[usage->kblocks->whichblock[y*cr+x]] |= bit;
2709 if (ondiag0(y*cr+x))
2710 usage->diag[0] |= bit;
2711 if (ondiag1(y*cr+x))
2712 usage->diag[1] |= bit;
2714 usage->grid[y*cr+x] = n;
2717 static void gridgen_remove(struct gridgen_usage *usage, int x, int y, digit n)
2719 unsigned int mask = ~(1 << n);
2721 usage->row[y] &= mask;
2722 usage->col[x] &= mask;
2723 usage->blk[usage->blocks->whichblock[y*cr+x]] &= mask;
2725 usage->cge[usage->kblocks->whichblock[y*cr+x]] &= mask;
2727 if (ondiag0(y*cr+x))
2728 usage->diag[0] &= mask;
2729 if (ondiag1(y*cr+x))
2730 usage->diag[1] &= mask;
2732 usage->grid[y*cr+x] = 0;
2738 * The real recursive step in the generating function.
2740 * Return values: 1 means solution found, 0 means no solution
2741 * found on this branch.
2743 static int gridgen_real(struct gridgen_usage *usage, digit *grid, int *steps)
2746 int i, j, n, sx, sy, bestm, bestr, ret;
2751 * Firstly, check for completion! If there are no spaces left
2752 * in the grid, we have a solution.
2754 if (usage->nspaces == 0)
2758 * Next, abandon generation if we went over our steps limit.
2765 * Otherwise, there must be at least one space. Find the most
2766 * constrained space, using the `r' field as a tie-breaker.
2768 bestm = cr+1; /* so that any space will beat it */
2772 for (j = 0; j < usage->nspaces; j++) {
2773 int x = usage->spaces[j].x, y = usage->spaces[j].y;
2774 unsigned int used_xy;
2777 m = usage->blocks->whichblock[y*cr+x];
2778 used_xy = usage->row[y] | usage->col[x] | usage->blk[m];
2779 if (usage->cge != NULL)
2780 used_xy |= usage->cge[usage->kblocks->whichblock[y*cr+x]];
2781 if (usage->cge != NULL)
2782 used_xy |= usage->cge[usage->kblocks->whichblock[y*cr+x]];
2783 if (usage->diag != NULL) {
2784 if (ondiag0(y*cr+x))
2785 used_xy |= usage->diag[0];
2786 if (ondiag1(y*cr+x))
2787 used_xy |= usage->diag[1];
2791 * Find the number of digits that could go in this space.
2794 for (n = 1; n <= cr; n++) {
2795 unsigned int bit = 1 << n;
2796 if ((used_xy & bit) == 0)
2799 if (m < bestm || (m == bestm && usage->spaces[j].r < bestr)) {
2801 bestr = usage->spaces[j].r;
2810 * Swap that square into the final place in the spaces array,
2811 * so that decrementing nspaces will remove it from the list.
2813 if (i != usage->nspaces-1) {
2814 struct gridgen_coord t;
2815 t = usage->spaces[usage->nspaces-1];
2816 usage->spaces[usage->nspaces-1] = usage->spaces[i];
2817 usage->spaces[i] = t;
2821 * Now we've decided which square to start our recursion at,
2822 * simply go through all possible values, shuffling them
2823 * randomly first if necessary.
2825 digits = snewn(bestm, int);
2828 for (n = 1; n <= cr; n++) {
2829 unsigned int bit = 1 << n;
2831 if ((used & bit) == 0)
2836 shuffle(digits, j, sizeof(*digits), usage->rs);
2838 /* And finally, go through the digit list and actually recurse. */
2840 for (i = 0; i < j; i++) {
2843 /* Update the usage structure to reflect the placing of this digit. */
2844 gridgen_place(usage, sx, sy, n);
2847 /* Call the solver recursively. Stop when we find a solution. */
2848 if (gridgen_real(usage, grid, steps)) {
2853 /* Revert the usage structure. */
2854 gridgen_remove(usage, sx, sy, n);
2863 * Entry point to generator. You give it parameters and a starting
2864 * grid, which is simply an array of cr*cr digits.
2866 static int gridgen(int cr, struct block_structure *blocks,
2867 struct block_structure *kblocks, int xtype,
2868 digit *grid, random_state *rs, int maxsteps)
2870 struct gridgen_usage *usage;
2874 * Clear the grid to start with.
2876 memset(grid, 0, cr*cr);
2879 * Create a gridgen_usage structure.
2881 usage = snew(struct gridgen_usage);
2884 usage->blocks = blocks;
2888 usage->row = snewn(cr, unsigned int);
2889 usage->col = snewn(cr, unsigned int);
2890 usage->blk = snewn(cr, unsigned int);
2891 if (kblocks != NULL) {
2892 usage->kblocks = kblocks;
2893 usage->cge = snewn(usage->kblocks->nr_blocks, unsigned int);
2894 memset(usage->cge, FALSE, kblocks->nr_blocks * sizeof *usage->cge);
2899 memset(usage->row, 0, cr * sizeof *usage->row);
2900 memset(usage->col, 0, cr * sizeof *usage->col);
2901 memset(usage->blk, 0, cr * sizeof *usage->blk);
2904 usage->diag = snewn(2, unsigned int);
2905 memset(usage->diag, 0, 2 * sizeof *usage->diag);
2911 * Begin by filling in the whole top row with randomly chosen
2912 * numbers. This cannot introduce any bias or restriction on
2913 * the available grids, since we already know those numbers
2914 * are all distinct so all we're doing is choosing their
2917 for (x = 0; x < cr; x++)
2919 shuffle(grid, cr, sizeof(*grid), rs);
2920 for (x = 0; x < cr; x++)
2921 gridgen_place(usage, x, 0, grid[x]);
2923 usage->spaces = snewn(cr * cr, struct gridgen_coord);
2929 * Initialise the list of grid spaces, taking care to leave
2930 * out the row I've already filled in above.
2932 for (y = 1; y < cr; y++) {
2933 for (x = 0; x < cr; x++) {
2934 usage->spaces[usage->nspaces].x = x;
2935 usage->spaces[usage->nspaces].y = y;
2936 usage->spaces[usage->nspaces].r = random_bits(rs, 31);
2942 * Run the real generator function.
2944 ret = gridgen_real(usage, grid, &maxsteps);
2947 * Clean up the usage structure now we have our answer.
2949 sfree(usage->spaces);
2959 /* ----------------------------------------------------------------------
2960 * End of grid generator code.
2964 * Check whether a grid contains a valid complete puzzle.
2966 static int check_valid(int cr, struct block_structure *blocks,
2967 struct block_structure *kblocks, int xtype, digit *grid)
2969 unsigned char *used;
2972 used = snewn(cr, unsigned char);
2975 * Check that each row contains precisely one of everything.
2977 for (y = 0; y < cr; y++) {
2978 memset(used, FALSE, cr);
2979 for (x = 0; x < cr; x++)
2980 if (grid[y*cr+x] > 0 && grid[y*cr+x] <= cr)
2981 used[grid[y*cr+x]-1] = TRUE;
2982 for (n = 0; n < cr; n++)
2990 * Check that each column contains precisely one of everything.
2992 for (x = 0; x < cr; x++) {
2993 memset(used, FALSE, cr);
2994 for (y = 0; y < cr; y++)
2995 if (grid[y*cr+x] > 0 && grid[y*cr+x] <= cr)
2996 used[grid[y*cr+x]-1] = TRUE;
2997 for (n = 0; n < cr; n++)
3005 * Check that each block contains precisely one of everything.
3007 for (i = 0; i < cr; i++) {
3008 memset(used, FALSE, cr);
3009 for (j = 0; j < cr; j++)
3010 if (grid[blocks->blocks[i][j]] > 0 &&
3011 grid[blocks->blocks[i][j]] <= cr)
3012 used[grid[blocks->blocks[i][j]]-1] = TRUE;
3013 for (n = 0; n < cr; n++)
3021 * Check that each Killer cage, if any, contains at most one of
3025 for (i = 0; i < kblocks->nr_blocks; i++) {
3026 memset(used, FALSE, cr);
3027 for (j = 0; j < kblocks->nr_squares[i]; j++)
3028 if (grid[kblocks->blocks[i][j]] > 0 &&
3029 grid[kblocks->blocks[i][j]] <= cr) {
3030 if (used[grid[kblocks->blocks[i][j]]-1]) {
3034 used[grid[kblocks->blocks[i][j]]-1] = TRUE;
3040 * Check that each diagonal contains precisely one of everything.
3043 memset(used, FALSE, cr);
3044 for (i = 0; i < cr; i++)
3045 if (grid[diag0(i)] > 0 && grid[diag0(i)] <= cr)
3046 used[grid[diag0(i)]-1] = TRUE;
3047 for (n = 0; n < cr; n++)
3052 for (i = 0; i < cr; i++)
3053 if (grid[diag1(i)] > 0 && grid[diag1(i)] <= cr)
3054 used[grid[diag1(i)]-1] = TRUE;
3055 for (n = 0; n < cr; n++)
3066 static int symmetries(const game_params *params, int x, int y,
3069 int c = params->c, r = params->r, cr = c*r;
3072 #define ADD(x,y) (*output++ = (x), *output++ = (y), i++)
3078 break; /* just x,y is all we need */
3080 ADD(cr - 1 - x, cr - 1 - y);
3085 ADD(cr - 1 - x, cr - 1 - y);
3096 ADD(cr - 1 - x, cr - 1 - y);
3100 ADD(cr - 1 - x, cr - 1 - y);
3101 ADD(cr - 1 - y, cr - 1 - x);
3106 ADD(cr - 1 - x, cr - 1 - y);
3110 ADD(cr - 1 - y, cr - 1 - x);
3119 static char *encode_solve_move(int cr, digit *grid)
3122 char *ret, *p, *sep;
3125 * It's surprisingly easy to work out _exactly_ how long this
3126 * string needs to be. To decimal-encode all the numbers from 1
3129 * - every number has a units digit; total is n.
3130 * - all numbers above 9 have a tens digit; total is max(n-9,0).
3131 * - all numbers above 99 have a hundreds digit; total is max(n-99,0).
3135 for (i = 1; i <= cr; i *= 10)
3136 len += max(cr - i + 1, 0);
3137 len += cr; /* don't forget the commas */
3138 len *= cr; /* there are cr rows of these */
3141 * Now len is one bigger than the total size of the
3142 * comma-separated numbers (because we counted an
3143 * additional leading comma). We need to have a leading S
3144 * and a trailing NUL, so we're off by one in total.
3148 ret = snewn(len, char);
3152 for (i = 0; i < cr*cr; i++) {
3153 p += sprintf(p, "%s%d", sep, grid[i]);
3157 assert(p - ret == len);
3162 static void dsf_to_blocks(int *dsf, struct block_structure *blocks,
3163 int min_expected, int max_expected)
3165 int cr = blocks->c * blocks->r, area = cr * cr;
3168 for (i = 0; i < area; i++)
3169 blocks->whichblock[i] = -1;
3170 for (i = 0; i < area; i++) {
3171 int j = dsf_canonify(dsf, i);
3172 if (blocks->whichblock[j] < 0)
3173 blocks->whichblock[j] = nb++;
3174 blocks->whichblock[i] = blocks->whichblock[j];
3176 assert(nb >= min_expected && nb <= max_expected);
3177 blocks->nr_blocks = nb;
3180 static void make_blocks_from_whichblock(struct block_structure *blocks)
3184 for (i = 0; i < blocks->nr_blocks; i++) {
3185 blocks->blocks[i][blocks->max_nr_squares-1] = 0;
3186 blocks->nr_squares[i] = 0;
3188 for (i = 0; i < blocks->area; i++) {
3189 int b = blocks->whichblock[i];
3190 int j = blocks->blocks[b][blocks->max_nr_squares-1]++;
3191 assert(j < blocks->max_nr_squares);
3192 blocks->blocks[b][j] = i;
3193 blocks->nr_squares[b]++;
3197 static char *encode_block_structure_desc(char *p, struct block_structure *blocks)
3200 int c = blocks->c, r = blocks->r, cr = c * r;
3203 * Encode the block structure. We do this by encoding
3204 * the pattern of dividing lines: first we iterate
3205 * over the cr*(cr-1) internal vertical grid lines in
3206 * ordinary reading order, then over the cr*(cr-1)
3207 * internal horizontal ones in transposed reading
3210 * We encode the number of non-lines between the
3211 * lines; _ means zero (two adjacent divisions), a
3212 * means 1, ..., y means 25, and z means 25 non-lines
3213 * _and no following line_ (so that za means 26, zb 27
3216 for (i = 0; i <= 2*cr*(cr-1); i++) {
3217 int x, y, p0, p1, edge;
3219 if (i == 2*cr*(cr-1)) {
3220 edge = TRUE; /* terminating virtual edge */
3222 if (i < cr*(cr-1)) {
3233 edge = (blocks->whichblock[p0] != blocks->whichblock[p1]);
3237 while (currrun > 25)
3238 *p++ = 'z', currrun -= 25;
3240 *p++ = 'a'-1 + currrun;
3250 static char *encode_grid(char *desc, digit *grid, int area)
3256 for (i = 0; i <= area; i++) {
3257 int n = (i < area ? grid[i] : -1);
3264 int c = 'a' - 1 + run;
3268 run -= c - ('a' - 1);
3272 * If there's a number in the very top left or
3273 * bottom right, there's no point putting an
3274 * unnecessary _ before or after it.
3276 if (p > desc && n > 0)
3280 p += sprintf(p, "%d", n);
3288 * Conservatively stimate the number of characters required for
3289 * encoding a grid of a certain area.
3291 static int grid_encode_space (int area)
3294 for (count = 1, t = area; t > 26; t -= 26)
3296 return count * area;
3300 * Conservatively stimate the number of characters required for
3301 * encoding a given blocks structure.
3303 static int blocks_encode_space(struct block_structure *blocks)
3305 int cr = blocks->c * blocks->r, area = cr * cr;
3306 return grid_encode_space(area);
3309 static char *encode_puzzle_desc(const game_params *params, digit *grid,
3310 struct block_structure *blocks,
3312 struct block_structure *kblocks)
3314 int c = params->c, r = params->r, cr = c*r;
3319 space = grid_encode_space(area) + 1;
3321 space += blocks_encode_space(blocks) + 1;
3322 if (params->killer) {
3323 space += blocks_encode_space(kblocks) + 1;
3324 space += grid_encode_space(area) + 1;
3326 desc = snewn(space, char);
3327 p = encode_grid(desc, grid, area);
3331 p = encode_block_structure_desc(p, blocks);
3333 if (params->killer) {
3335 p = encode_block_structure_desc(p, kblocks);
3337 p = encode_grid(p, kgrid, area);
3339 assert(p - desc < space);
3341 desc = sresize(desc, p - desc, char);
3346 static void merge_blocks(struct block_structure *b, int n1, int n2)
3349 /* Move data towards the lower block number. */
3356 /* Merge n2 into n1, and move the last block into n2's position. */
3357 for (i = 0; i < b->nr_squares[n2]; i++)
3358 b->whichblock[b->blocks[n2][i]] = n1;
3359 memcpy(b->blocks[n1] + b->nr_squares[n1], b->blocks[n2],
3360 b->nr_squares[n2] * sizeof **b->blocks);
3361 b->nr_squares[n1] += b->nr_squares[n2];
3363 n1 = b->nr_blocks - 1;
3365 memcpy(b->blocks[n2], b->blocks[n1],
3366 b->nr_squares[n1] * sizeof **b->blocks);
3367 for (i = 0; i < b->nr_squares[n1]; i++)
3368 b->whichblock[b->blocks[n1][i]] = n2;
3369 b->nr_squares[n2] = b->nr_squares[n1];
3374 static int merge_some_cages(struct block_structure *b, int cr, int area,
3375 digit *grid, random_state *rs)
3378 * Make a list of all the pairs of adjacent blocks.
3386 pairs = snewn(b->nr_blocks * b->nr_blocks, struct pair);
3389 for (i = 0; i < b->nr_blocks; i++) {
3390 for (j = i+1; j < b->nr_blocks; j++) {
3393 * Rule the merger out of consideration if it's
3394 * obviously not viable.
3396 if (b->nr_squares[i] + b->nr_squares[j] > b->max_nr_squares)
3397 continue; /* we couldn't merge these anyway */
3400 * See if these two blocks have a pair of squares
3401 * adjacent to each other.
3403 for (k = 0; k < b->nr_squares[i]; k++) {
3404 int xy = b->blocks[i][k];
3405 int y = xy / cr, x = xy % cr;
3406 if ((y > 0 && b->whichblock[xy - cr] == j) ||
3407 (y+1 < cr && b->whichblock[xy + cr] == j) ||
3408 (x > 0 && b->whichblock[xy - 1] == j) ||
3409 (x+1 < cr && b->whichblock[xy + 1] == j)) {
3411 * Yes! Add this pair to our list.
3413 pairs[npairs].b1 = i;
3414 pairs[npairs].b2 = j;
3422 * Now go through that list in random order until we find a pair
3423 * of blocks we can merge.
3425 while (npairs > 0) {
3427 unsigned int digits_found;
3430 * Pick a random pair, and remove it from the list.
3432 i = random_upto(rs, npairs);
3436 pairs[i] = pairs[npairs-1];
3439 /* Guarantee that the merged cage would still be a region. */
3441 for (i = 0; i < b->nr_squares[n1]; i++)
3442 digits_found |= 1 << grid[b->blocks[n1][i]];
3443 for (i = 0; i < b->nr_squares[n2]; i++)
3444 if (digits_found & (1 << grid[b->blocks[n2][i]]))
3446 if (i != b->nr_squares[n2])
3450 * Got one! Do the merge.
3452 merge_blocks(b, n1, n2);
3461 static void compute_kclues(struct block_structure *cages, digit *kclues,
3462 digit *grid, int area)
3465 memset(kclues, 0, area * sizeof *kclues);
3466 for (i = 0; i < cages->nr_blocks; i++) {
3468 for (j = 0; j < area; j++)
3469 if (cages->whichblock[j] == i)
3471 for (j = 0; j < area; j++)
3472 if (cages->whichblock[j] == i)
3479 static struct block_structure *gen_killer_cages(int cr, random_state *rs,
3480 int remove_singletons)
3483 int x, y, area = cr * cr;
3484 int n_singletons = 0;
3485 struct block_structure *b = alloc_block_structure (1, cr, area, cr, area);
3487 for (x = 0; x < area; x++)
3488 b->whichblock[x] = -1;
3490 for (y = 0; y < cr; y++)
3491 for (x = 0; x < cr; x++) {
3494 if (b->whichblock[xy] != -1)
3496 b->whichblock[xy] = nr;
3498 rnd = random_bits(rs, 4);
3499 if (xy + 1 < area && (rnd >= 4 || (!remove_singletons && rnd >= 1))) {
3501 if (x + 1 == cr || b->whichblock[xy2] != -1 ||
3502 (xy + cr < area && random_bits(rs, 1) == 0))
3507 b->whichblock[xy2] = nr;
3514 make_blocks_from_whichblock(b);
3516 for (x = y = 0; x < b->nr_blocks; x++)
3517 if (b->nr_squares[x] == 1)
3519 assert(y == n_singletons);
3521 if (n_singletons > 0 && remove_singletons) {
3523 for (n = 0; n < b->nr_blocks;) {
3524 int xy, x, y, xy2, other;
3525 if (b->nr_squares[n] > 1) {
3529 xy = b->blocks[n][0];
3534 else if (x + 1 < cr && (y + 1 == cr || random_bits(rs, 1) == 0))
3538 other = b->whichblock[xy2];
3540 if (b->nr_squares[other] == 1)
3543 merge_blocks(b, n, other);
3547 assert(n_singletons == 0);
3552 static char *new_game_desc(const game_params *params, random_state *rs,
3553 char **aux, int interactive)
3555 int c = params->c, r = params->r, cr = c*r;
3557 struct block_structure *blocks, *kblocks;
3558 digit *grid, *grid2, *kgrid;
3559 struct xy { int x, y; } *locs;
3562 int coords[16], ncoords;
3564 struct difficulty dlev;
3566 precompute_sum_bits();
3569 * Adjust the maximum difficulty level to be consistent with
3570 * the puzzle size: all 2x2 puzzles appear to be Trivial
3571 * (DIFF_BLOCK) so we cannot hold out for even a Basic
3572 * (DIFF_SIMPLE) one.
3574 dlev.maxdiff = params->diff;
3575 dlev.maxkdiff = params->kdiff;
3576 if (c == 2 && r == 2)
3577 dlev.maxdiff = DIFF_BLOCK;
3579 grid = snewn(area, digit);
3580 locs = snewn(area, struct xy);
3581 grid2 = snewn(area, digit);
3583 blocks = alloc_block_structure (c, r, area, cr, cr);
3586 kgrid = (params->killer) ? snewn(area, digit) : NULL;
3588 #ifdef STANDALONE_SOLVER
3589 assert(!"This should never happen, so we don't need to create blocknames");
3593 * Loop until we get a grid of the required difficulty. This is
3594 * nasty, but it seems to be unpleasantly hard to generate
3595 * difficult grids otherwise.
3599 * Generate a random solved state, starting by
3600 * constructing the block structure.
3602 if (r == 1) { /* jigsaw mode */
3603 int *dsf = divvy_rectangle(cr, cr, cr, rs);
3605 dsf_to_blocks (dsf, blocks, cr, cr);
3608 } else { /* basic Sudoku mode */
3609 for (y = 0; y < cr; y++)
3610 for (x = 0; x < cr; x++)
3611 blocks->whichblock[y*cr+x] = (y/c) * c + (x/r);
3613 make_blocks_from_whichblock(blocks);
3615 if (params->killer) {
3616 if (kblocks) free_block_structure(kblocks);
3617 kblocks = gen_killer_cages(cr, rs, params->kdiff > DIFF_KSINGLE);
3620 if (!gridgen(cr, blocks, kblocks, params->xtype, grid, rs, area*area))
3622 assert(check_valid(cr, blocks, kblocks, params->xtype, grid));
3625 * Save the solved grid in aux.
3629 * We might already have written *aux the last time we
3630 * went round this loop, in which case we should free
3631 * the old aux before overwriting it with the new one.
3637 *aux = encode_solve_move(cr, grid);
3641 * Now we have a solved grid. For normal puzzles, we start removing
3642 * things from it while preserving solubility. Killer puzzles are
3643 * different: we just pass the empty grid to the solver, and use
3644 * the puzzle if it comes back solved.
3647 if (params->killer) {
3648 struct block_structure *good_cages = NULL;
3649 struct block_structure *last_cages = NULL;
3652 memcpy(grid2, grid, area);
3655 compute_kclues(kblocks, kgrid, grid2, area);
3657 memset(grid, 0, area * sizeof *grid);
3658 solver(cr, blocks, kblocks, params->xtype, grid, kgrid, &dlev);
3659 if (dlev.diff == dlev.maxdiff && dlev.kdiff == dlev.maxkdiff) {
3661 * We have one that matches our difficulty. Store it for
3662 * later, but keep going.
3665 free_block_structure(good_cages);
3667 good_cages = dup_block_structure(kblocks);
3668 if (!merge_some_cages(kblocks, cr, area, grid2, rs))
3670 } else if (dlev.diff > dlev.maxdiff || dlev.kdiff > dlev.maxkdiff) {
3672 * Give up after too many tries and either use the good one we
3673 * found, or generate a new grid.
3678 * The difficulty level got too high. If we have a good
3679 * one, use it, otherwise go back to the last one that
3680 * was at a lower difficulty and restart the process from
3683 if (good_cages != NULL) {
3684 free_block_structure(kblocks);
3685 kblocks = dup_block_structure(good_cages);
3686 if (!merge_some_cages(kblocks, cr, area, grid2, rs))
3689 if (last_cages == NULL)
3691 free_block_structure(kblocks);
3692 kblocks = last_cages;
3697 free_block_structure(last_cages);
3698 last_cages = dup_block_structure(kblocks);
3699 if (!merge_some_cages(kblocks, cr, area, grid2, rs))
3704 free_block_structure(last_cages);
3705 if (good_cages != NULL) {
3706 free_block_structure(kblocks);
3707 kblocks = good_cages;
3708 compute_kclues(kblocks, kgrid, grid2, area);
3709 memset(grid, 0, area * sizeof *grid);
3716 * Find the set of equivalence classes of squares permitted
3717 * by the selected symmetry. We do this by enumerating all
3718 * the grid squares which have no symmetric companion
3719 * sorting lower than themselves.
3722 for (y = 0; y < cr; y++)
3723 for (x = 0; x < cr; x++) {
3727 ncoords = symmetries(params, x, y, coords, params->symm);
3728 for (j = 0; j < ncoords; j++)
3729 if (coords[2*j+1]*cr+coords[2*j] < i)
3739 * Now shuffle that list.
3741 shuffle(locs, nlocs, sizeof(*locs), rs);
3744 * Now loop over the shuffled list and, for each element,
3745 * see whether removing that element (and its reflections)
3746 * from the grid will still leave the grid soluble.
3748 for (i = 0; i < nlocs; i++) {
3752 memcpy(grid2, grid, area);
3753 ncoords = symmetries(params, x, y, coords, params->symm);
3754 for (j = 0; j < ncoords; j++)
3755 grid2[coords[2*j+1]*cr+coords[2*j]] = 0;
3757 solver(cr, blocks, kblocks, params->xtype, grid2, kgrid, &dlev);
3758 if (dlev.diff <= dlev.maxdiff &&
3759 (!params->killer || dlev.kdiff <= dlev.maxkdiff)) {
3760 for (j = 0; j < ncoords; j++)
3761 grid[coords[2*j+1]*cr+coords[2*j]] = 0;
3765 memcpy(grid2, grid, area);
3767 solver(cr, blocks, kblocks, params->xtype, grid2, kgrid, &dlev);
3768 if (dlev.diff == dlev.maxdiff &&
3769 (!params->killer || dlev.kdiff == dlev.maxkdiff))
3770 break; /* found one! */
3777 * Now we have the grid as it will be presented to the user.
3778 * Encode it in a game desc.
3780 desc = encode_puzzle_desc(params, grid, blocks, kgrid, kblocks);
3783 free_block_structure(blocks);
3784 if (params->killer) {
3785 free_block_structure(kblocks);
3792 static const char *spec_to_grid(const char *desc, digit *grid, int area)
3795 while (*desc && *desc != ',') {
3797 if (n >= 'a' && n <= 'z') {
3798 int run = n - 'a' + 1;
3799 assert(i + run <= area);
3802 } else if (n == '_') {
3804 } else if (n > '0' && n <= '9') {
3806 grid[i++] = atoi(desc-1);
3807 while (*desc >= '0' && *desc <= '9')
3810 assert(!"We can't get here");
3818 * Create a DSF from a spec found in *pdesc. Update this to point past the
3819 * end of the block spec, and return an error string or NULL if everything
3820 * is OK. The DSF is stored in *PDSF.
3822 static char *spec_to_dsf(const char **pdesc, int **pdsf, int cr, int area)
3824 const char *desc = *pdesc;
3828 *pdsf = dsf = snew_dsf(area);
3830 while (*desc && *desc != ',') {
3835 else if (*desc >= 'a' && *desc <= 'z')
3836 c = *desc - 'a' + 1;
3839 return "Invalid character in game description";
3843 adv = (c != 25); /* 'z' is a special case */
3849 * Non-edge; merge the two dsf classes on either
3852 assert(pos < 2*cr*(cr-1));
3853 if (pos < cr*(cr-1)) {
3859 int x = pos/(cr-1) - cr;
3864 dsf_merge(dsf, p0, p1);
3874 * When desc is exhausted, we expect to have gone exactly
3875 * one space _past_ the end of the grid, due to the dummy
3878 if (pos != 2*cr*(cr-1)+1) {
3880 return "Not enough data in block structure specification";
3886 static char *validate_grid_desc(const char **pdesc, int range, int area)
3888 const char *desc = *pdesc;
3890 while (*desc && *desc != ',') {
3892 if (n >= 'a' && n <= 'z') {
3893 squares += n - 'a' + 1;
3894 } else if (n == '_') {
3896 } else if (n > '0' && n <= '9') {
3897 int val = atoi(desc-1);
3898 if (val < 1 || val > range)
3899 return "Out-of-range number in game description";
3901 while (*desc >= '0' && *desc <= '9')
3904 return "Invalid character in game description";
3908 return "Not enough data to fill grid";
3911 return "Too much data to fit in grid";
3916 static char *validate_block_desc(const char **pdesc, int cr, int area,
3917 int min_nr_blocks, int max_nr_blocks,
3918 int min_nr_squares, int max_nr_squares)
3923 err = spec_to_dsf(pdesc, &dsf, cr, area);
3928 if (min_nr_squares == max_nr_squares) {
3929 assert(min_nr_blocks == max_nr_blocks);
3930 assert(min_nr_blocks * min_nr_squares == area);
3933 * Now we've got our dsf. Verify that it matches
3937 int *canons, *counts;
3938 int i, j, c, ncanons = 0;
3940 canons = snewn(max_nr_blocks, int);
3941 counts = snewn(max_nr_blocks, int);
3943 for (i = 0; i < area; i++) {
3944 j = dsf_canonify(dsf, i);
3946 for (c = 0; c < ncanons; c++)
3947 if (canons[c] == j) {
3949 if (counts[c] > max_nr_squares) {
3953 return "A jigsaw block is too big";
3959 if (ncanons >= max_nr_blocks) {
3963 return "Too many distinct jigsaw blocks";
3965 canons[ncanons] = j;
3966 counts[ncanons] = 1;
3971 if (ncanons < min_nr_blocks) {
3975 return "Not enough distinct jigsaw blocks";
3977 for (c = 0; c < ncanons; c++) {
3978 if (counts[c] < min_nr_squares) {
3982 return "A jigsaw block is too small";
3993 static char *validate_desc(const game_params *params, const char *desc)
3995 int cr = params->c * params->r, area = cr*cr;
3998 err = validate_grid_desc(&desc, cr, area);
4002 if (params->r == 1) {
4004 * Now we expect a suffix giving the jigsaw block
4005 * structure. Parse it and validate that it divides the
4006 * grid into the right number of regions which are the
4010 return "Expected jigsaw block structure in game description";
4012 err = validate_block_desc(&desc, cr, area, cr, cr, cr, cr);
4017 if (params->killer) {
4019 return "Expected killer block structure in game description";
4021 err = validate_block_desc(&desc, cr, area, cr, area, 2, cr);
4025 return "Expected killer clue grid in game description";
4027 err = validate_grid_desc(&desc, cr * area, area);
4032 return "Unexpected data at end of game description";
4037 static game_state *new_game(midend *me, const game_params *params,
4040 game_state *state = snew(game_state);
4041 int c = params->c, r = params->r, cr = c*r, area = cr * cr;
4044 precompute_sum_bits();
4047 state->xtype = params->xtype;
4048 state->killer = params->killer;
4050 state->grid = snewn(area, digit);
4051 state->pencil = snewn(area * cr, unsigned char);
4052 memset(state->pencil, 0, area * cr);
4053 state->immutable = snewn(area, unsigned char);
4054 memset(state->immutable, FALSE, area);
4056 state->blocks = alloc_block_structure (c, r, area, cr, cr);
4058 if (params->killer) {
4059 state->kblocks = alloc_block_structure (c, r, area, cr, area);
4060 state->kgrid = snewn(area, digit);
4062 state->kblocks = NULL;
4063 state->kgrid = NULL;
4065 state->completed = state->cheated = FALSE;
4067 desc = spec_to_grid(desc, state->grid, area);
4068 for (i = 0; i < area; i++)
4069 if (state->grid[i] != 0)
4070 state->immutable[i] = TRUE;
4075 assert(*desc == ',');
4077 err = spec_to_dsf(&desc, &dsf, cr, area);
4078 assert(err == NULL);
4079 dsf_to_blocks(dsf, state->blocks, cr, cr);
4084 for (y = 0; y < cr; y++)
4085 for (x = 0; x < cr; x++)
4086 state->blocks->whichblock[y*cr+x] = (y/c) * c + (x/r);
4088 make_blocks_from_whichblock(state->blocks);
4090 if (params->killer) {
4093 assert(*desc == ',');
4095 err = spec_to_dsf(&desc, &dsf, cr, area);
4096 assert(err == NULL);
4097 dsf_to_blocks(dsf, state->kblocks, cr, area);
4099 make_blocks_from_whichblock(state->kblocks);
4101 assert(*desc == ',');
4103 desc = spec_to_grid(desc, state->kgrid, area);
4107 #ifdef STANDALONE_SOLVER
4109 * Set up the block names for solver diagnostic output.
4112 char *p = (char *)(state->blocks->blocknames + cr);
4115 for (i = 0; i < area; i++) {
4116 int j = state->blocks->whichblock[i];
4117 if (!state->blocks->blocknames[j]) {
4118 state->blocks->blocknames[j] = p;
4119 p += 1 + sprintf(p, "starting at (%d,%d)",
4120 1 + i%cr, 1 + i/cr);
4125 for (by = 0; by < r; by++)
4126 for (bx = 0; bx < c; bx++) {
4127 state->blocks->blocknames[by*c+bx] = p;
4128 p += 1 + sprintf(p, "(%d,%d)", bx+1, by+1);
4131 assert(p - (char *)state->blocks->blocknames < (int)(cr*(sizeof(char *)+80)));
4132 for (i = 0; i < cr; i++)
4133 assert(state->blocks->blocknames[i]);
4140 static game_state *dup_game(const game_state *state)
4142 game_state *ret = snew(game_state);
4143 int cr = state->cr, area = cr * cr;
4145 ret->cr = state->cr;
4146 ret->xtype = state->xtype;
4147 ret->killer = state->killer;
4149 ret->blocks = state->blocks;
4150 ret->blocks->refcount++;
4152 ret->kblocks = state->kblocks;
4154 ret->kblocks->refcount++;
4156 ret->grid = snewn(area, digit);
4157 memcpy(ret->grid, state->grid, area);
4159 if (state->killer) {
4160 ret->kgrid = snewn(area, digit);
4161 memcpy(ret->kgrid, state->kgrid, area);
4165 ret->pencil = snewn(area * cr, unsigned char);
4166 memcpy(ret->pencil, state->pencil, area * cr);
4168 ret->immutable = snewn(area, unsigned char);
4169 memcpy(ret->immutable, state->immutable, area);
4171 ret->completed = state->completed;
4172 ret->cheated = state->cheated;
4177 static void free_game(game_state *state)
4179 free_block_structure(state->blocks);
4181 free_block_structure(state->kblocks);
4183 sfree(state->immutable);
4184 sfree(state->pencil);
4186 if (state->kgrid) sfree(state->kgrid);
4190 static char *solve_game(const game_state *state, const game_state *currstate,
4191 const char *ai, char **error)
4196 struct difficulty dlev;
4199 * If we already have the solution in ai, save ourselves some
4205 grid = snewn(cr*cr, digit);
4206 memcpy(grid, state->grid, cr*cr);
4207 dlev.maxdiff = DIFF_RECURSIVE;
4208 dlev.maxkdiff = DIFF_KINTERSECT;
4209 solver(cr, state->blocks, state->kblocks, state->xtype, grid,
4210 state->kgrid, &dlev);
4214 if (dlev.diff == DIFF_IMPOSSIBLE)
4215 *error = "No solution exists for this puzzle";
4216 else if (dlev.diff == DIFF_AMBIGUOUS)
4217 *error = "Multiple solutions exist for this puzzle";
4224 ret = encode_solve_move(cr, grid);
4231 static char *grid_text_format(int cr, struct block_structure *blocks,
4232 int xtype, digit *grid)
4236 int totallen, linelen, nlines;
4240 * For non-jigsaw Sudoku, we format in the way we always have,
4241 * by having the digits unevenly spaced so that the dividing
4250 * For jigsaw puzzles, however, we must leave space between
4251 * _all_ pairs of digits for an optional dividing line, so we
4252 * have to move to the rather ugly
4262 * We deal with both cases using the same formatting code; we
4263 * simply invent a vmod value such that there's a vertical
4264 * dividing line before column i iff i is divisible by vmod
4265 * (so it's r in the first case and 1 in the second), and hmod
4266 * likewise for horizontal dividing lines.
4269 if (blocks->r != 1) {
4277 * Line length: we have cr digits, each with a space after it,
4278 * and (cr-1)/vmod dividing lines, each with a space after it.
4279 * The final space is replaced by a newline, but that doesn't
4280 * affect the length.
4282 linelen = 2*(cr + (cr-1)/vmod);
4285 * Number of lines: we have cr rows of digits, and (cr-1)/hmod
4288 nlines = cr + (cr-1)/hmod;
4291 * Allocate the space.
4293 totallen = linelen * nlines;
4294 ret = snewn(totallen+1, char); /* leave room for terminating NUL */
4300 for (y = 0; y < cr; y++) {
4304 for (x = 0; x < cr; x++) {
4308 digit d = grid[y*cr+x];
4312 * Empty space: we usually write a dot, but we'll
4313 * highlight spaces on the X-diagonals (in X mode)
4314 * by using underscores instead.
4316 if (xtype && (ondiag0(y*cr+x) || ondiag1(y*cr+x)))
4320 } else if (d <= 9) {
4337 * Optional dividing line.
4339 if (blocks->whichblock[y*cr+x] != blocks->whichblock[y*cr+x+1])
4346 if (y == cr-1 || (y+1) % hmod)
4352 for (x = 0; x < cr; x++) {
4357 * Division between two squares. This varies
4358 * complicatedly in length.
4360 dwid = 2; /* digit and its following space */
4362 dwid--; /* no following space at end of line */
4363 if (x > 0 && x % vmod == 0)
4364 dwid++; /* preceding space after a divider */
4366 if (blocks->whichblock[y*cr+x] != blocks->whichblock[(y+1)*cr+x])
4383 * Corner square. This is:
4384 * - a space if all four surrounding squares are in
4386 * - a vertical line if the two left ones are in one
4387 * block and the two right in another
4388 * - a horizontal line if the two top ones are in one
4389 * block and the two bottom in another
4390 * - a plus sign in all other cases. (If we had a
4391 * richer character set available we could break
4392 * this case up further by doing fun things with
4393 * line-drawing T-pieces.)
4395 tl = blocks->whichblock[y*cr+x];
4396 tr = blocks->whichblock[y*cr+x+1];
4397 bl = blocks->whichblock[(y+1)*cr+x];
4398 br = blocks->whichblock[(y+1)*cr+x+1];
4400 if (tl == tr && tr == bl && bl == br)
4402 else if (tl == bl && tr == br)
4404 else if (tl == tr && bl == br)
4413 assert(p - ret == totallen);
4418 static int game_can_format_as_text_now(const game_params *params)
4421 * Formatting Killer puzzles as text is currently unsupported. I
4422 * can't think of any sensible way of doing it which doesn't
4423 * involve expanding the puzzle to such a large scale as to make
4431 static char *game_text_format(const game_state *state)
4433 assert(!state->kblocks);
4434 return grid_text_format(state->cr, state->blocks, state->xtype,
4440 * These are the coordinates of the currently highlighted
4441 * square on the grid, if hshow = 1.
4445 * This indicates whether the current highlight is a
4446 * pencil-mark one or a real one.
4450 * This indicates whether or not we're showing the highlight
4451 * (used to be hx = hy = -1); important so that when we're
4452 * using the cursor keys it doesn't keep coming back at a
4453 * fixed position. When hshow = 1, pressing a valid number
4454 * or letter key or Space will enter that number or letter in the grid.
4458 * This indicates whether we're using the highlight as a cursor;
4459 * it means that it doesn't vanish on a keypress, and that it is
4460 * allowed on immutable squares.
4465 static game_ui *new_ui(const game_state *state)
4467 game_ui *ui = snew(game_ui);
4469 ui->hx = ui->hy = 0;
4470 ui->hpencil = ui->hshow = ui->hcursor = 0;
4475 static void free_ui(game_ui *ui)
4480 static char *encode_ui(const game_ui *ui)
4485 static void decode_ui(game_ui *ui, const char *encoding)
4489 static void game_changed_state(game_ui *ui, const game_state *oldstate,
4490 const game_state *newstate)
4492 int cr = newstate->cr;
4494 * We prevent pencil-mode highlighting of a filled square, unless
4495 * we're using the cursor keys. So if the user has just filled in
4496 * a square which we had a pencil-mode highlight in (by Undo, or
4497 * by Redo, or by Solve), then we cancel the highlight.
4499 if (ui->hshow && ui->hpencil && !ui->hcursor &&
4500 newstate->grid[ui->hy * cr + ui->hx] != 0) {
4505 struct game_drawstate {
4510 unsigned char *pencil;
4512 /* This is scratch space used within a single call to game_redraw. */
4513 int nregions, *entered_items;
4516 static char *interpret_move(const game_state *state, game_ui *ui,
4517 const game_drawstate *ds,
4518 int x, int y, int button)
4524 button &= ~MOD_MASK;
4526 tx = (x + TILE_SIZE - BORDER) / TILE_SIZE - 1;
4527 ty = (y + TILE_SIZE - BORDER) / TILE_SIZE - 1;
4529 if (tx >= 0 && tx < cr && ty >= 0 && ty < cr) {
4530 if (button == LEFT_BUTTON) {
4531 if (state->immutable[ty*cr+tx]) {
4533 } else if (tx == ui->hx && ty == ui->hy &&
4534 ui->hshow && ui->hpencil == 0) {
4543 return ""; /* UI activity occurred */
4545 if (button == RIGHT_BUTTON) {
4547 * Pencil-mode highlighting for non filled squares.
4549 if (state->grid[ty*cr+tx] == 0) {
4550 if (tx == ui->hx && ty == ui->hy &&
4551 ui->hshow && ui->hpencil) {
4563 return ""; /* UI activity occurred */
4566 if (IS_CURSOR_MOVE(button)) {
4567 move_cursor(button, &ui->hx, &ui->hy, cr, cr, 0);
4568 ui->hshow = ui->hcursor = 1;
4572 (button == CURSOR_SELECT)) {
4573 ui->hpencil = 1 - ui->hpencil;
4579 ((button >= '0' && button <= '9' && button - '0' <= cr) ||
4580 (button >= 'a' && button <= 'z' && button - 'a' + 10 <= cr) ||
4581 (button >= 'A' && button <= 'Z' && button - 'A' + 10 <= cr) ||
4582 button == CURSOR_SELECT2 || button == '\b')) {
4583 int n = button - '0';
4584 if (button >= 'A' && button <= 'Z')
4585 n = button - 'A' + 10;
4586 if (button >= 'a' && button <= 'z')
4587 n = button - 'a' + 10;
4588 if (button == CURSOR_SELECT2 || button == '\b')
4592 * Can't overwrite this square. This can only happen here
4593 * if we're using the cursor keys.
4595 if (state->immutable[ui->hy*cr+ui->hx])
4599 * Can't make pencil marks in a filled square. Again, this
4600 * can only become highlighted if we're using cursor keys.
4602 if (ui->hpencil && state->grid[ui->hy*cr+ui->hx])
4605 sprintf(buf, "%c%d,%d,%d",
4606 (char)(ui->hpencil && n > 0 ? 'P' : 'R'), ui->hx, ui->hy, n);
4608 if (!ui->hcursor) ui->hshow = 0;
4616 static game_state *execute_move(const game_state *from, const char *move)
4622 if (move[0] == 'S') {
4625 ret = dup_game(from);
4626 ret->completed = ret->cheated = TRUE;
4629 for (n = 0; n < cr*cr; n++) {
4630 ret->grid[n] = atoi(p);
4632 if (!*p || ret->grid[n] < 1 || ret->grid[n] > cr) {
4637 while (*p && isdigit((unsigned char)*p)) p++;
4642 } else if ((move[0] == 'P' || move[0] == 'R') &&
4643 sscanf(move+1, "%d,%d,%d", &x, &y, &n) == 3 &&
4644 x >= 0 && x < cr && y >= 0 && y < cr && n >= 0 && n <= cr) {
4646 ret = dup_game(from);
4647 if (move[0] == 'P' && n > 0) {
4648 int index = (y*cr+x) * cr + (n-1);
4649 ret->pencil[index] = !ret->pencil[index];
4651 ret->grid[y*cr+x] = n;
4652 memset(ret->pencil + (y*cr+x)*cr, 0, cr);
4655 * We've made a real change to the grid. Check to see
4656 * if the game has been completed.
4658 if (!ret->completed && check_valid(cr, ret->blocks, ret->kblocks,
4659 ret->xtype, ret->grid)) {
4660 ret->completed = TRUE;
4665 return NULL; /* couldn't parse move string */
4668 /* ----------------------------------------------------------------------
4672 #define SIZE(cr) ((cr) * TILE_SIZE + 2*BORDER + 1)
4673 #define GETTILESIZE(cr, w) ( (double)(w-1) / (double)(cr+1) )
4675 static void game_compute_size(const game_params *params, int tilesize,
4678 /* Ick: fake up `ds->tilesize' for macro expansion purposes */
4679 struct { int tilesize; } ads, *ds = &ads;
4680 ads.tilesize = tilesize;
4682 *x = SIZE(params->c * params->r);
4683 *y = SIZE(params->c * params->r);
4686 static void game_set_size(drawing *dr, game_drawstate *ds,
4687 const game_params *params, int tilesize)
4689 ds->tilesize = tilesize;
4692 static float *game_colours(frontend *fe, int *ncolours)
4694 float *ret = snewn(3 * NCOLOURS, float);
4696 frontend_default_colour(fe, &ret[COL_BACKGROUND * 3]);
4698 ret[COL_XDIAGONALS * 3 + 0] = 0.9F * ret[COL_BACKGROUND * 3 + 0];
4699 ret[COL_XDIAGONALS * 3 + 1] = 0.9F * ret[COL_BACKGROUND * 3 + 1];
4700 ret[COL_XDIAGONALS * 3 + 2] = 0.9F * ret[COL_BACKGROUND * 3 + 2];
4702 ret[COL_GRID * 3 + 0] = 0.0F;
4703 ret[COL_GRID * 3 + 1] = 0.0F;
4704 ret[COL_GRID * 3 + 2] = 0.0F;
4706 ret[COL_CLUE * 3 + 0] = 0.0F;
4707 ret[COL_CLUE * 3 + 1] = 0.0F;
4708 ret[COL_CLUE * 3 + 2] = 0.0F;
4710 ret[COL_USER * 3 + 0] = 0.0F;
4711 ret[COL_USER * 3 + 1] = 0.6F * ret[COL_BACKGROUND * 3 + 1];
4712 ret[COL_USER * 3 + 2] = 0.0F;
4714 ret[COL_HIGHLIGHT * 3 + 0] = 0.78F * ret[COL_BACKGROUND * 3 + 0];
4715 ret[COL_HIGHLIGHT * 3 + 1] = 0.78F * ret[COL_BACKGROUND * 3 + 1];
4716 ret[COL_HIGHLIGHT * 3 + 2] = 0.78F * ret[COL_BACKGROUND * 3 + 2];
4718 ret[COL_ERROR * 3 + 0] = 1.0F;
4719 ret[COL_ERROR * 3 + 1] = 0.0F;
4720 ret[COL_ERROR * 3 + 2] = 0.0F;
4722 ret[COL_PENCIL * 3 + 0] = 0.5F * ret[COL_BACKGROUND * 3 + 0];
4723 ret[COL_PENCIL * 3 + 1] = 0.5F * ret[COL_BACKGROUND * 3 + 1];
4724 ret[COL_PENCIL * 3 + 2] = ret[COL_BACKGROUND * 3 + 2];
4726 ret[COL_KILLER * 3 + 0] = 0.5F * ret[COL_BACKGROUND * 3 + 0];
4727 ret[COL_KILLER * 3 + 1] = 0.5F * ret[COL_BACKGROUND * 3 + 1];
4728 ret[COL_KILLER * 3 + 2] = 0.1F * ret[COL_BACKGROUND * 3 + 2];
4730 *ncolours = NCOLOURS;
4734 static game_drawstate *game_new_drawstate(drawing *dr, const game_state *state)
4736 struct game_drawstate *ds = snew(struct game_drawstate);
4739 ds->started = FALSE;
4741 ds->xtype = state->xtype;
4742 ds->grid = snewn(cr*cr, digit);
4743 memset(ds->grid, cr+2, cr*cr);
4744 ds->pencil = snewn(cr*cr*cr, digit);
4745 memset(ds->pencil, 0, cr*cr*cr);
4746 ds->hl = snewn(cr*cr, unsigned char);
4747 memset(ds->hl, 0, cr*cr);
4749 * ds->entered_items needs one row of cr entries per entity in
4750 * which digits may not be duplicated. That's one for each row,
4751 * each column, each block, each diagonal, and each Killer cage.
4753 ds->nregions = cr*3 + 2;
4755 ds->nregions += state->kblocks->nr_blocks;
4756 ds->entered_items = snewn(cr * ds->nregions, int);
4757 ds->tilesize = 0; /* not decided yet */
4761 static void game_free_drawstate(drawing *dr, game_drawstate *ds)
4766 sfree(ds->entered_items);
4770 static void draw_number(drawing *dr, game_drawstate *ds,
4771 const game_state *state, int x, int y, int hl)
4776 int col_killer = (hl & 32 ? COL_ERROR : COL_KILLER);
4779 if (ds->grid[y*cr+x] == state->grid[y*cr+x] &&
4780 ds->hl[y*cr+x] == hl &&
4781 !memcmp(ds->pencil+(y*cr+x)*cr, state->pencil+(y*cr+x)*cr, cr))
4782 return; /* no change required */
4784 tx = BORDER + x * TILE_SIZE + 1 + GRIDEXTRA;
4785 ty = BORDER + y * TILE_SIZE + 1 + GRIDEXTRA;
4789 cw = tw = TILE_SIZE-1-2*GRIDEXTRA;
4790 ch = th = TILE_SIZE-1-2*GRIDEXTRA;
4792 if (x > 0 && state->blocks->whichblock[y*cr+x] == state->blocks->whichblock[y*cr+x-1])
4793 cx -= GRIDEXTRA, cw += GRIDEXTRA;
4794 if (x+1 < cr && state->blocks->whichblock[y*cr+x] == state->blocks->whichblock[y*cr+x+1])
4796 if (y > 0 && state->blocks->whichblock[y*cr+x] == state->blocks->whichblock[(y-1)*cr+x])
4797 cy -= GRIDEXTRA, ch += GRIDEXTRA;
4798 if (y+1 < cr && state->blocks->whichblock[y*cr+x] == state->blocks->whichblock[(y+1)*cr+x])
4801 clip(dr, cx, cy, cw, ch);
4803 /* background needs erasing */
4804 draw_rect(dr, cx, cy, cw, ch,
4805 ((hl & 15) == 1 ? COL_HIGHLIGHT :
4806 (ds->xtype && (ondiag0(y*cr+x) || ondiag1(y*cr+x))) ? COL_XDIAGONALS :
4810 * Draw the corners of thick lines in corner-adjacent squares,
4811 * which jut into this square by one pixel.
4813 if (x > 0 && y > 0 && state->blocks->whichblock[y*cr+x] != state->blocks->whichblock[(y-1)*cr+x-1])
4814 draw_rect(dr, tx-GRIDEXTRA, ty-GRIDEXTRA, GRIDEXTRA, GRIDEXTRA, COL_GRID);
4815 if (x+1 < cr && y > 0 && state->blocks->whichblock[y*cr+x] != state->blocks->whichblock[(y-1)*cr+x+1])
4816 draw_rect(dr, tx+TILE_SIZE-1-2*GRIDEXTRA, ty-GRIDEXTRA, GRIDEXTRA, GRIDEXTRA, COL_GRID);
4817 if (x > 0 && y+1 < cr && state->blocks->whichblock[y*cr+x] != state->blocks->whichblock[(y+1)*cr+x-1])
4818 draw_rect(dr, tx-GRIDEXTRA, ty+TILE_SIZE-1-2*GRIDEXTRA, GRIDEXTRA, GRIDEXTRA, COL_GRID);
4819 if (x+1 < cr && y+1 < cr && state->blocks->whichblock[y*cr+x] != state->blocks->whichblock[(y+1)*cr+x+1])
4820 draw_rect(dr, tx+TILE_SIZE-1-2*GRIDEXTRA, ty+TILE_SIZE-1-2*GRIDEXTRA, GRIDEXTRA, GRIDEXTRA, COL_GRID);
4822 /* pencil-mode highlight */
4823 if ((hl & 15) == 2) {
4827 coords[2] = cx+cw/2;
4830 coords[5] = cy+ch/2;
4831 draw_polygon(dr, coords, 3, COL_HIGHLIGHT, COL_HIGHLIGHT);
4834 if (state->kblocks) {
4835 int t = GRIDEXTRA * 3;
4836 int kcx, kcy, kcw, kch;
4838 int has_left = 0, has_right = 0, has_top = 0, has_bottom = 0;
4841 * In non-jigsaw mode, the Killer cages are placed at a
4842 * fixed offset from the outer edge of the cell dividing
4843 * lines, so that they look right whether those lines are
4844 * thick or thin. In jigsaw mode, however, doing this will
4845 * sometimes cause the cage outlines in adjacent squares to
4846 * fail to match up with each other, so we must offset a
4847 * fixed amount from the _centre_ of the cell dividing
4850 if (state->blocks->r == 1) {
4867 * First, draw the lines dividing this area from neighbouring
4870 if (x == 0 || state->kblocks->whichblock[y*cr+x] != state->kblocks->whichblock[y*cr+x-1])
4871 has_left = 1, kl += t;
4872 if (x+1 >= cr || state->kblocks->whichblock[y*cr+x] != state->kblocks->whichblock[y*cr+x+1])
4873 has_right = 1, kr -= t;
4874 if (y == 0 || state->kblocks->whichblock[y*cr+x] != state->kblocks->whichblock[(y-1)*cr+x])
4875 has_top = 1, kt += t;
4876 if (y+1 >= cr || state->kblocks->whichblock[y*cr+x] != state->kblocks->whichblock[(y+1)*cr+x])
4877 has_bottom = 1, kb -= t;
4879 draw_line(dr, kl, kt, kr, kt, col_killer);
4881 draw_line(dr, kl, kb, kr, kb, col_killer);
4883 draw_line(dr, kl, kt, kl, kb, col_killer);
4885 draw_line(dr, kr, kt, kr, kb, col_killer);
4887 * Now, take care of the corners (just as for the normal borders).
4888 * We only need a corner if there wasn't a full edge.
4890 if (x > 0 && y > 0 && !has_left && !has_top
4891 && state->kblocks->whichblock[y*cr+x] != state->kblocks->whichblock[(y-1)*cr+x-1])
4893 draw_line(dr, kl, kt + t, kl + t, kt + t, col_killer);
4894 draw_line(dr, kl + t, kt, kl + t, kt + t, col_killer);
4896 if (x+1 < cr && y > 0 && !has_right && !has_top
4897 && state->kblocks->whichblock[y*cr+x] != state->kblocks->whichblock[(y-1)*cr+x+1])
4899 draw_line(dr, kcx + kcw - t, kt + t, kcx + kcw, kt + t, col_killer);
4900 draw_line(dr, kcx + kcw - t, kt, kcx + kcw - t, kt + t, col_killer);
4902 if (x > 0 && y+1 < cr && !has_left && !has_bottom
4903 && state->kblocks->whichblock[y*cr+x] != state->kblocks->whichblock[(y+1)*cr+x-1])
4905 draw_line(dr, kl, kcy + kch - t, kl + t, kcy + kch - t, col_killer);
4906 draw_line(dr, kl + t, kcy + kch - t, kl + t, kcy + kch, col_killer);
4908 if (x+1 < cr && y+1 < cr && !has_right && !has_bottom
4909 && state->kblocks->whichblock[y*cr+x] != state->kblocks->whichblock[(y+1)*cr+x+1])
4911 draw_line(dr, kcx + kcw - t, kcy + kch - t, kcx + kcw - t, kcy + kch, col_killer);
4912 draw_line(dr, kcx + kcw - t, kcy + kch - t, kcx + kcw, kcy + kch - t, col_killer);
4917 if (state->killer && state->kgrid[y*cr+x]) {
4918 sprintf (str, "%d", state->kgrid[y*cr+x]);
4919 draw_text(dr, tx + GRIDEXTRA * 4, ty + GRIDEXTRA * 4 + TILE_SIZE/4,
4920 FONT_VARIABLE, TILE_SIZE/4, ALIGN_VNORMAL | ALIGN_HLEFT,
4924 /* new number needs drawing? */
4925 if (state->grid[y*cr+x]) {
4927 str[0] = state->grid[y*cr+x] + '0';
4929 str[0] += 'a' - ('9'+1);
4930 draw_text(dr, tx + TILE_SIZE/2, ty + TILE_SIZE/2,
4931 FONT_VARIABLE, TILE_SIZE/2, ALIGN_VCENTRE | ALIGN_HCENTRE,
4932 state->immutable[y*cr+x] ? COL_CLUE : (hl & 16) ? COL_ERROR : COL_USER, str);
4937 int pw, ph, minph, pbest, fontsize;
4939 /* Count the pencil marks required. */
4940 for (i = npencil = 0; i < cr; i++)
4941 if (state->pencil[(y*cr+x)*cr+i])
4948 * Determine the bounding rectangle within which we're going
4949 * to put the pencil marks.
4951 /* Start with the whole square */
4952 pl = tx + GRIDEXTRA;
4953 pr = pl + TILE_SIZE - GRIDEXTRA;
4954 pt = ty + GRIDEXTRA;
4955 pb = pt + TILE_SIZE - GRIDEXTRA;
4956 if (state->killer) {
4958 * Make space for the Killer cages. We do this
4959 * unconditionally, for uniformity between squares,
4960 * rather than making it depend on whether a Killer
4961 * cage edge is actually present on any given side.
4963 pl += GRIDEXTRA * 3;
4964 pr -= GRIDEXTRA * 3;
4965 pt += GRIDEXTRA * 3;
4966 pb -= GRIDEXTRA * 3;
4967 if (state->kgrid[y*cr+x] != 0) {
4968 /* Make further space for the Killer number. */
4975 * We arrange our pencil marks in a grid layout, with
4976 * the number of rows and columns adjusted to allow the
4977 * maximum font size.
4979 * So now we work out what the grid size ought to be.
4984 for (pw = 3; pw < max(npencil,4); pw++) {
4987 ph = (npencil + pw - 1) / pw;
4988 ph = max(ph, minph);
4989 fw = (pr - pl) / (float)pw;
4990 fh = (pb - pt) / (float)ph;
4992 if (fs > bestsize) {
4999 ph = (npencil + pw - 1) / pw;
5000 ph = max(ph, minph);
5003 * Now we've got our grid dimensions, work out the pixel
5004 * size of a grid element, and round it to the nearest
5005 * pixel. (We don't want rounding errors to make the
5006 * grid look uneven at low pixel sizes.)
5008 fontsize = min((pr - pl) / pw, (pb - pt) / ph);
5011 * Centre the resulting figure in the square.
5013 pl = tx + (TILE_SIZE - fontsize * pw) / 2;
5014 pt = ty + (TILE_SIZE - fontsize * ph) / 2;
5017 * And move it down a bit if it's collided with the
5018 * Killer cage number.
5020 if (state->killer && state->kgrid[y*cr+x] != 0) {
5021 pt = max(pt, ty + GRIDEXTRA * 3 + TILE_SIZE/4);
5025 * Now actually draw the pencil marks.
5027 for (i = j = 0; i < cr; i++)
5028 if (state->pencil[(y*cr+x)*cr+i]) {
5029 int dx = j % pw, dy = j / pw;
5034 str[0] += 'a' - ('9'+1);
5035 draw_text(dr, pl + fontsize * (2*dx+1) / 2,
5036 pt + fontsize * (2*dy+1) / 2,
5037 FONT_VARIABLE, fontsize,
5038 ALIGN_VCENTRE | ALIGN_HCENTRE, COL_PENCIL, str);
5046 draw_update(dr, cx, cy, cw, ch);
5048 ds->grid[y*cr+x] = state->grid[y*cr+x];
5049 memcpy(ds->pencil+(y*cr+x)*cr, state->pencil+(y*cr+x)*cr, cr);
5050 ds->hl[y*cr+x] = hl;
5053 static void game_redraw(drawing *dr, game_drawstate *ds,
5054 const game_state *oldstate, const game_state *state,
5055 int dir, const game_ui *ui,
5056 float animtime, float flashtime)
5063 * The initial contents of the window are not guaranteed
5064 * and can vary with front ends. To be on the safe side,
5065 * all games should start by drawing a big
5066 * background-colour rectangle covering the whole window.
5068 draw_rect(dr, 0, 0, SIZE(cr), SIZE(cr), COL_BACKGROUND);
5071 * Draw the grid. We draw it as a big thick rectangle of
5072 * COL_GRID initially; individual calls to draw_number()
5073 * will poke the right-shaped holes in it.
5075 draw_rect(dr, BORDER-GRIDEXTRA, BORDER-GRIDEXTRA,
5076 cr*TILE_SIZE+1+2*GRIDEXTRA, cr*TILE_SIZE+1+2*GRIDEXTRA,
5081 * This array is used to keep track of rows, columns and boxes
5082 * which contain a number more than once.
5084 for (x = 0; x < cr * ds->nregions; x++)
5085 ds->entered_items[x] = 0;
5086 for (x = 0; x < cr; x++)
5087 for (y = 0; y < cr; y++) {
5088 digit d = state->grid[y*cr+x];
5093 ds->entered_items[x*cr+d-1]++;
5096 ds->entered_items[(y+cr)*cr+d-1]++;
5099 box = state->blocks->whichblock[y*cr+x];
5100 ds->entered_items[(box+2*cr)*cr+d-1]++;
5104 if (ondiag0(y*cr+x))
5105 ds->entered_items[(3*cr)*cr+d-1]++;
5106 if (ondiag1(y*cr+x))
5107 ds->entered_items[(3*cr+1)*cr+d-1]++;
5111 if (state->kblocks) {
5112 kbox = state->kblocks->whichblock[y*cr+x];
5113 ds->entered_items[(kbox+3*cr+2)*cr+d-1]++;
5119 * Draw any numbers which need redrawing.
5121 for (x = 0; x < cr; x++) {
5122 for (y = 0; y < cr; y++) {
5124 digit d = state->grid[y*cr+x];
5126 if (flashtime > 0 &&
5127 (flashtime <= FLASH_TIME/3 ||
5128 flashtime >= FLASH_TIME*2/3))
5131 /* Highlight active input areas. */
5132 if (x == ui->hx && y == ui->hy && ui->hshow)
5133 highlight = ui->hpencil ? 2 : 1;
5135 /* Mark obvious errors (ie, numbers which occur more than once
5136 * in a single row, column, or box). */
5137 if (d && (ds->entered_items[x*cr+d-1] > 1 ||
5138 ds->entered_items[(y+cr)*cr+d-1] > 1 ||
5139 ds->entered_items[(state->blocks->whichblock[y*cr+x]
5140 +2*cr)*cr+d-1] > 1 ||
5141 (ds->xtype && ((ondiag0(y*cr+x) &&
5142 ds->entered_items[(3*cr)*cr+d-1] > 1) ||
5144 ds->entered_items[(3*cr+1)*cr+d-1]>1)))||
5146 ds->entered_items[(state->kblocks->whichblock[y*cr+x]
5147 +3*cr+2)*cr+d-1] > 1)))
5150 if (d && state->kblocks) {
5151 int i, b = state->kblocks->whichblock[y*cr+x];
5152 int n_squares = state->kblocks->nr_squares[b];
5153 int sum = 0, clue = 0;
5154 for (i = 0; i < n_squares; i++) {
5155 int xy = state->kblocks->blocks[b][i];
5156 if (state->grid[xy] == 0)
5159 sum += state->grid[xy];
5160 if (state->kgrid[xy]) {
5162 clue = state->kgrid[xy];
5166 if (i == n_squares) {
5173 draw_number(dr, ds, state, x, y, highlight);
5178 * Update the _entire_ grid if necessary.
5181 draw_update(dr, 0, 0, SIZE(cr), SIZE(cr));
5186 static float game_anim_length(const game_state *oldstate,
5187 const game_state *newstate, int dir, game_ui *ui)
5192 static float game_flash_length(const game_state *oldstate,
5193 const game_state *newstate, int dir, game_ui *ui)
5195 if (!oldstate->completed && newstate->completed &&
5196 !oldstate->cheated && !newstate->cheated)
5201 static int game_status(const game_state *state)
5203 return state->completed ? +1 : 0;
5206 static int game_timing_state(const game_state *state, game_ui *ui)
5208 if (state->completed)
5213 static void game_print_size(const game_params *params, float *x, float *y)
5218 * I'll use 9mm squares by default. They should be quite big
5219 * for this game, because players will want to jot down no end
5220 * of pencil marks in the squares.
5222 game_compute_size(params, 900, &pw, &ph);
5228 * Subfunction to draw the thick lines between cells. In order to do
5229 * this using the line-drawing rather than rectangle-drawing API (so
5230 * as to get line thicknesses to scale correctly) and yet have
5231 * correctly mitred joins between lines, we must do this by tracing
5232 * the boundary of each sub-block and drawing it in one go as a
5235 * This subfunction is also reused with thinner dotted lines to
5236 * outline the Killer cages, this time offsetting the outline toward
5237 * the interior of the affected squares.
5239 static void outline_block_structure(drawing *dr, game_drawstate *ds,
5240 const game_state *state,
5241 struct block_structure *blocks,
5247 int x, y, dx, dy, sx, sy, sdx, sdy;
5250 * Maximum perimeter of a k-omino is 2k+2. (Proof: start
5251 * with k unconnected squares, with total perimeter 4k.
5252 * Now repeatedly join two disconnected components
5253 * together into a larger one; every time you do so you
5254 * remove at least two unit edges, and you require k-1 of
5255 * these operations to create a single connected piece, so
5256 * you must have at most 4k-2(k-1) = 2k+2 unit edges left
5259 coords = snewn(4*cr+4, int); /* 2k+2 points, 2 coords per point */
5262 * Iterate over all the blocks.
5264 for (bi = 0; bi < blocks->nr_blocks; bi++) {
5265 if (blocks->nr_squares[bi] == 0)
5269 * For each block, find a starting square within it
5270 * which has a boundary at the left.
5272 for (i = 0; i < cr; i++) {
5273 int j = blocks->blocks[bi][i];
5274 if (j % cr == 0 || blocks->whichblock[j-1] != bi)
5277 assert(i < cr); /* every block must have _some_ leftmost square */
5278 x = blocks->blocks[bi][i] % cr;
5279 y = blocks->blocks[bi][i] / cr;
5284 * Now begin tracing round the perimeter. At all
5285 * times, (x,y) describes some square within the
5286 * block, and (x+dx,y+dy) is some adjacent square
5287 * outside it; so the edge between those two squares
5288 * is always an edge of the block.
5290 sx = x, sy = y, sdx = dx, sdy = dy; /* save starting position */
5293 int cx, cy, tx, ty, nin;
5296 * Advance to the next edge, by looking at the two
5297 * squares beyond it. If they're both outside the block,
5298 * we turn right (by leaving x,y the same and rotating
5299 * dx,dy clockwise); if they're both inside, we turn
5300 * left (by rotating dx,dy anticlockwise and contriving
5301 * to leave x+dx,y+dy unchanged); if one of each, we go
5302 * straight on (and may enforce by assertion that
5303 * they're one of each the _right_ way round).
5308 nin += (tx >= 0 && tx < cr && ty >= 0 && ty < cr &&
5309 blocks->whichblock[ty*cr+tx] == bi);
5312 nin += (tx >= 0 && tx < cr && ty >= 0 && ty < cr &&
5313 blocks->whichblock[ty*cr+tx] == bi);
5322 } else if (nin == 2) {
5346 * Now enforce by assertion that we ended up
5347 * somewhere sensible.
5349 assert(x >= 0 && x < cr && y >= 0 && y < cr &&
5350 blocks->whichblock[y*cr+x] == bi);
5351 assert(x+dx < 0 || x+dx >= cr || y+dy < 0 || y+dy >= cr ||
5352 blocks->whichblock[(y+dy)*cr+(x+dx)] != bi);
5355 * Record the point we just went past at one end of the
5356 * edge. To do this, we translate (x,y) down and right
5357 * by half a unit (so they're describing a point in the
5358 * _centre_ of the square) and then translate back again
5359 * in a manner rotated by dy and dx.
5362 cx = ((2*x+1) + dy + dx) / 2;
5363 cy = ((2*y+1) - dx + dy) / 2;
5364 coords[2*n+0] = BORDER + cx * TILE_SIZE;
5365 coords[2*n+1] = BORDER + cy * TILE_SIZE;
5366 coords[2*n+0] -= dx * inset;
5367 coords[2*n+1] -= dy * inset;
5370 * We turned right, so inset this corner back along
5371 * the edge towards the centre of the square.
5373 coords[2*n+0] -= dy * inset;
5374 coords[2*n+1] += dx * inset;
5375 } else if (nin == 2) {
5377 * We turned left, so inset this corner further
5378 * _out_ along the edge into the next square.
5380 coords[2*n+0] += dy * inset;
5381 coords[2*n+1] -= dx * inset;
5385 } while (x != sx || y != sy || dx != sdx || dy != sdy);
5388 * That's our polygon; now draw it.
5390 draw_polygon(dr, coords, n, -1, ink);
5396 static void game_print(drawing *dr, const game_state *state, int tilesize)
5399 int ink = print_mono_colour(dr, 0);
5402 /* Ick: fake up `ds->tilesize' for macro expansion purposes */
5403 game_drawstate ads, *ds = &ads;
5404 game_set_size(dr, ds, NULL, tilesize);
5409 print_line_width(dr, 3 * TILE_SIZE / 40);
5410 draw_rect_outline(dr, BORDER, BORDER, cr*TILE_SIZE, cr*TILE_SIZE, ink);
5413 * Highlight X-diagonal squares.
5417 int xhighlight = print_grey_colour(dr, 0.90F);
5419 for (i = 0; i < cr; i++)
5420 draw_rect(dr, BORDER + i*TILE_SIZE, BORDER + i*TILE_SIZE,
5421 TILE_SIZE, TILE_SIZE, xhighlight);
5422 for (i = 0; i < cr; i++)
5423 if (i*2 != cr-1) /* avoid redoing centre square, just for fun */
5424 draw_rect(dr, BORDER + i*TILE_SIZE,
5425 BORDER + (cr-1-i)*TILE_SIZE,
5426 TILE_SIZE, TILE_SIZE, xhighlight);
5432 for (x = 1; x < cr; x++) {
5433 print_line_width(dr, TILE_SIZE / 40);
5434 draw_line(dr, BORDER+x*TILE_SIZE, BORDER,
5435 BORDER+x*TILE_SIZE, BORDER+cr*TILE_SIZE, ink);
5437 for (y = 1; y < cr; y++) {
5438 print_line_width(dr, TILE_SIZE / 40);
5439 draw_line(dr, BORDER, BORDER+y*TILE_SIZE,
5440 BORDER+cr*TILE_SIZE, BORDER+y*TILE_SIZE, ink);
5444 * Thick lines between cells.
5446 print_line_width(dr, 3 * TILE_SIZE / 40);
5447 outline_block_structure(dr, ds, state, state->blocks, ink, 0);
5450 * Killer cages and their totals.
5452 if (state->kblocks) {
5453 print_line_width(dr, TILE_SIZE / 40);
5454 print_line_dotted(dr, TRUE);
5455 outline_block_structure(dr, ds, state, state->kblocks, ink,
5456 5 * TILE_SIZE / 40);
5457 print_line_dotted(dr, FALSE);
5458 for (y = 0; y < cr; y++)
5459 for (x = 0; x < cr; x++)
5460 if (state->kgrid[y*cr+x]) {
5462 sprintf(str, "%d", state->kgrid[y*cr+x]);
5464 BORDER+x*TILE_SIZE + 7*TILE_SIZE/40,
5465 BORDER+y*TILE_SIZE + 16*TILE_SIZE/40,
5466 FONT_VARIABLE, TILE_SIZE/4,
5467 ALIGN_VNORMAL | ALIGN_HLEFT,
5473 * Standard (non-Killer) clue numbers.
5475 for (y = 0; y < cr; y++)
5476 for (x = 0; x < cr; x++)
5477 if (state->grid[y*cr+x]) {
5480 str[0] = state->grid[y*cr+x] + '0';
5482 str[0] += 'a' - ('9'+1);
5483 draw_text(dr, BORDER + x*TILE_SIZE + TILE_SIZE/2,
5484 BORDER + y*TILE_SIZE + TILE_SIZE/2,
5485 FONT_VARIABLE, TILE_SIZE/2,
5486 ALIGN_VCENTRE | ALIGN_HCENTRE, ink, str);
5491 #define thegame solo
5494 const struct game thegame = {
5495 "Solo", "games.solo", "solo",
5502 TRUE, game_configure, custom_params,
5510 TRUE, game_can_format_as_text_now, game_text_format,
5518 PREFERRED_TILE_SIZE, game_compute_size, game_set_size,
5521 game_free_drawstate,
5526 TRUE, FALSE, game_print_size, game_print,
5527 FALSE, /* wants_statusbar */
5528 FALSE, game_timing_state,
5529 REQUIRE_RBUTTON | REQUIRE_NUMPAD, /* flags */
5532 #ifdef STANDALONE_SOLVER
5534 int main(int argc, char **argv)
5538 char *id = NULL, *desc, *err;
5540 struct difficulty dlev;
5542 while (--argc > 0) {
5544 if (!strcmp(p, "-v")) {
5545 solver_show_working = TRUE;
5546 } else if (!strcmp(p, "-g")) {
5548 } else if (*p == '-') {
5549 fprintf(stderr, "%s: unrecognised option `%s'\n", argv[0], p);
5557 fprintf(stderr, "usage: %s [-g | -v] <game_id>\n", argv[0]);
5561 desc = strchr(id, ':');
5563 fprintf(stderr, "%s: game id expects a colon in it\n", argv[0]);
5568 p = default_params();
5569 decode_params(p, id);
5570 err = validate_desc(p, desc);
5572 fprintf(stderr, "%s: %s\n", argv[0], err);
5575 s = new_game(NULL, p, desc);
5577 dlev.maxdiff = DIFF_RECURSIVE;
5578 dlev.maxkdiff = DIFF_KINTERSECT;
5579 solver(s->cr, s->blocks, s->kblocks, s->xtype, s->grid, s->kgrid, &dlev);
5581 printf("Difficulty rating: %s\n",
5582 dlev.diff==DIFF_BLOCK ? "Trivial (blockwise positional elimination only)":
5583 dlev.diff==DIFF_SIMPLE ? "Basic (row/column/number elimination required)":
5584 dlev.diff==DIFF_INTERSECT ? "Intermediate (intersectional analysis required)":
5585 dlev.diff==DIFF_SET ? "Advanced (set elimination required)":
5586 dlev.diff==DIFF_EXTREME ? "Extreme (complex non-recursive techniques required)":
5587 dlev.diff==DIFF_RECURSIVE ? "Unreasonable (guesswork and backtracking required)":
5588 dlev.diff==DIFF_AMBIGUOUS ? "Ambiguous (multiple solutions exist)":
5589 dlev.diff==DIFF_IMPOSSIBLE ? "Impossible (no solution exists)":
5590 "INTERNAL ERROR: unrecognised difficulty code");
5592 printf("Killer difficulty: %s\n",
5593 dlev.kdiff==DIFF_KSINGLE ? "Trivial (single square cages only)":
5594 dlev.kdiff==DIFF_KMINMAX ? "Simple (maximum sum analysis required)":
5595 dlev.kdiff==DIFF_KSUMS ? "Intermediate (sum possibilities)":
5596 dlev.kdiff==DIFF_KINTERSECT ? "Advanced (sum region intersections)":
5597 "INTERNAL ERROR: unrecognised difficulty code");
5599 printf("%s\n", grid_text_format(s->cr, s->blocks, s->xtype, s->grid));
5607 /* vim: set shiftwidth=4 tabstop=8: */