1d8e8ad8 |
1 | /* |
2 | * solo.c: the number-placing puzzle most popularly known as `Sudoku'. |
3 | * |
4 | * TODO: |
5 | * |
1d8e8ad8 |
6 | * - can we do anything about nasty centring of text in GTK? It |
7 | * seems to be taking ascenders/descenders into account when |
8 | * centring. Ick. |
9 | * |
10 | * - implement stronger modes of reasoning in nsolve, thus |
11 | * enabling harder puzzles |
ef57b17d |
12 | * + and having done that, supply configurable difficulty |
13 | * levels |
1d8e8ad8 |
14 | * |
ef57b17d |
15 | * - it might still be nice to do some prioritisation on the |
16 | * removal of numbers from the grid |
17 | * + one possibility is to try to minimise the maximum number |
18 | * of filled squares in any block, which in particular ought |
19 | * to enforce never leaving a completely filled block in the |
20 | * puzzle as presented. |
21 | * + be careful of being too clever here, though, until after |
22 | * I've tried implementing difficulty levels. It's not |
23 | * impossible that those might impose much more important |
24 | * constraints on this process. |
1d8e8ad8 |
25 | * |
26 | * - alternative interface modes |
27 | * + sudoku.com's Windows program has a palette of possible |
28 | * entries; you select a palette entry first and then click |
29 | * on the square you want it to go in, thus enabling |
30 | * mouse-only play. Useful for PDAs! I don't think it's |
31 | * actually incompatible with the current highlight-then-type |
32 | * approach: you _either_ highlight a palette entry and then |
33 | * click, _or_ you highlight a square and then type. At most |
34 | * one thing is ever highlighted at a time, so there's no way |
35 | * to confuse the two. |
36 | * + `pencil marks' might be useful for more subtle forms of |
37 | * deduction, once we implement creation of puzzles that |
38 | * require it. |
39 | */ |
40 | |
41 | /* |
42 | * Solo puzzles need to be square overall (since each row and each |
43 | * column must contain one of every digit), but they need not be |
44 | * subdivided the same way internally. I am going to adopt a |
45 | * convention whereby I _always_ refer to `r' as the number of rows |
46 | * of _big_ divisions, and `c' as the number of columns of _big_ |
47 | * divisions. Thus, a 2c by 3r puzzle looks something like this: |
48 | * |
49 | * 4 5 1 | 2 6 3 |
50 | * 6 3 2 | 5 4 1 |
51 | * ------+------ (Of course, you can't subdivide it the other way |
52 | * 1 4 5 | 6 3 2 or you'll get clashes; observe that the 4 in the |
53 | * 3 2 6 | 4 1 5 top left would conflict with the 4 in the second |
54 | * ------+------ box down on the left-hand side.) |
55 | * 5 1 4 | 3 2 6 |
56 | * 2 6 3 | 1 5 4 |
57 | * |
58 | * The need for a strong naming convention should now be clear: |
59 | * each small box is two rows of digits by three columns, while the |
60 | * overall puzzle has three rows of small boxes by two columns. So |
61 | * I will (hopefully) consistently use `r' to denote the number of |
62 | * rows _of small boxes_ (here 3), which is also the number of |
63 | * columns of digits in each small box; and `c' vice versa (here |
64 | * 2). |
65 | * |
66 | * I'm also going to choose arbitrarily to list c first wherever |
67 | * possible: the above is a 2x3 puzzle, not a 3x2 one. |
68 | */ |
69 | |
70 | #include <stdio.h> |
71 | #include <stdlib.h> |
72 | #include <string.h> |
73 | #include <assert.h> |
74 | #include <ctype.h> |
75 | #include <math.h> |
76 | |
77 | #include "puzzles.h" |
78 | |
79 | /* |
80 | * To save space, I store digits internally as unsigned char. This |
81 | * imposes a hard limit of 255 on the order of the puzzle. Since |
82 | * even a 5x5 takes unacceptably long to generate, I don't see this |
83 | * as a serious limitation unless something _really_ impressive |
84 | * happens in computing technology; but here's a typedef anyway for |
85 | * general good practice. |
86 | */ |
87 | typedef unsigned char digit; |
88 | #define ORDER_MAX 255 |
89 | |
90 | #define TILE_SIZE 32 |
91 | #define BORDER 18 |
92 | |
93 | #define FLASH_TIME 0.4F |
94 | |
ef57b17d |
95 | enum { SYMM_NONE, SYMM_ROT2, SYMM_ROT4, SYMM_REF4 }; |
96 | |
1d8e8ad8 |
97 | enum { |
98 | COL_BACKGROUND, |
ef57b17d |
99 | COL_GRID, |
100 | COL_CLUE, |
101 | COL_USER, |
102 | COL_HIGHLIGHT, |
103 | NCOLOURS |
1d8e8ad8 |
104 | }; |
105 | |
106 | struct game_params { |
ef57b17d |
107 | int c, r, symm; |
1d8e8ad8 |
108 | }; |
109 | |
110 | struct game_state { |
111 | int c, r; |
112 | digit *grid; |
113 | unsigned char *immutable; /* marks which digits are clues */ |
114 | int completed; |
115 | }; |
116 | |
117 | static game_params *default_params(void) |
118 | { |
119 | game_params *ret = snew(game_params); |
120 | |
121 | ret->c = ret->r = 3; |
ef57b17d |
122 | ret->symm = SYMM_ROT2; /* a plausible default */ |
1d8e8ad8 |
123 | |
124 | return ret; |
125 | } |
126 | |
127 | static int game_fetch_preset(int i, char **name, game_params **params) |
128 | { |
129 | game_params *ret; |
130 | int c, r; |
131 | char buf[80]; |
132 | |
133 | switch (i) { |
134 | case 0: c = 2, r = 2; break; |
135 | case 1: c = 2, r = 3; break; |
136 | case 2: c = 3, r = 3; break; |
137 | case 3: c = 3, r = 4; break; |
138 | case 4: c = 4, r = 4; break; |
139 | default: return FALSE; |
140 | } |
141 | |
142 | sprintf(buf, "%dx%d", c, r); |
143 | *name = dupstr(buf); |
144 | *params = ret = snew(game_params); |
145 | ret->c = c; |
146 | ret->r = r; |
ef57b17d |
147 | ret->symm = SYMM_ROT2; |
1d8e8ad8 |
148 | /* FIXME: difficulty presets? */ |
149 | return TRUE; |
150 | } |
151 | |
152 | static void free_params(game_params *params) |
153 | { |
154 | sfree(params); |
155 | } |
156 | |
157 | static game_params *dup_params(game_params *params) |
158 | { |
159 | game_params *ret = snew(game_params); |
160 | *ret = *params; /* structure copy */ |
161 | return ret; |
162 | } |
163 | |
164 | static game_params *decode_params(char const *string) |
165 | { |
166 | game_params *ret = default_params(); |
167 | |
168 | ret->c = ret->r = atoi(string); |
ef57b17d |
169 | ret->symm = SYMM_ROT2; |
1d8e8ad8 |
170 | while (*string && isdigit((unsigned char)*string)) string++; |
171 | if (*string == 'x') { |
172 | string++; |
173 | ret->r = atoi(string); |
174 | while (*string && isdigit((unsigned char)*string)) string++; |
175 | } |
ef57b17d |
176 | if (*string == 'r' || *string == 'm' || *string == 'a') { |
177 | int sn, sc; |
178 | sc = *string++; |
179 | sn = atoi(string); |
180 | while (*string && isdigit((unsigned char)*string)) string++; |
181 | if (sc == 'm' && sn == 4) |
182 | ret->symm = SYMM_REF4; |
183 | if (sc == 'r' && sn == 4) |
184 | ret->symm = SYMM_ROT4; |
185 | if (sc == 'r' && sn == 2) |
186 | ret->symm = SYMM_ROT2; |
187 | if (sc == 'a') |
188 | ret->symm = SYMM_NONE; |
189 | } |
1d8e8ad8 |
190 | /* FIXME: difficulty levels */ |
191 | |
192 | return ret; |
193 | } |
194 | |
195 | static char *encode_params(game_params *params) |
196 | { |
197 | char str[80]; |
198 | |
ef57b17d |
199 | /* |
200 | * Symmetry is a game generation preference and hence is left |
201 | * out of the encoding. Users can add it back in as they see |
202 | * fit. |
203 | */ |
1d8e8ad8 |
204 | sprintf(str, "%dx%d", params->c, params->r); |
205 | return dupstr(str); |
206 | } |
207 | |
208 | static config_item *game_configure(game_params *params) |
209 | { |
210 | config_item *ret; |
211 | char buf[80]; |
212 | |
213 | ret = snewn(5, config_item); |
214 | |
215 | ret[0].name = "Columns of sub-blocks"; |
216 | ret[0].type = C_STRING; |
217 | sprintf(buf, "%d", params->c); |
218 | ret[0].sval = dupstr(buf); |
219 | ret[0].ival = 0; |
220 | |
221 | ret[1].name = "Rows of sub-blocks"; |
222 | ret[1].type = C_STRING; |
223 | sprintf(buf, "%d", params->r); |
224 | ret[1].sval = dupstr(buf); |
225 | ret[1].ival = 0; |
226 | |
ef57b17d |
227 | ret[2].name = "Symmetry"; |
228 | ret[2].type = C_CHOICES; |
229 | ret[2].sval = ":None:2-way rotation:4-way rotation:4-way mirror"; |
230 | ret[2].ival = params->symm; |
231 | |
1d8e8ad8 |
232 | /* |
233 | * FIXME: difficulty level. |
234 | */ |
235 | |
ef57b17d |
236 | ret[3].name = NULL; |
237 | ret[3].type = C_END; |
238 | ret[3].sval = NULL; |
239 | ret[3].ival = 0; |
1d8e8ad8 |
240 | |
241 | return ret; |
242 | } |
243 | |
244 | static game_params *custom_params(config_item *cfg) |
245 | { |
246 | game_params *ret = snew(game_params); |
247 | |
c1f743c8 |
248 | ret->c = atoi(cfg[0].sval); |
249 | ret->r = atoi(cfg[1].sval); |
ef57b17d |
250 | ret->symm = cfg[2].ival; |
1d8e8ad8 |
251 | |
252 | return ret; |
253 | } |
254 | |
255 | static char *validate_params(game_params *params) |
256 | { |
257 | if (params->c < 2 || params->r < 2) |
258 | return "Both dimensions must be at least 2"; |
259 | if (params->c > ORDER_MAX || params->r > ORDER_MAX) |
260 | return "Dimensions greater than "STR(ORDER_MAX)" are not supported"; |
261 | return NULL; |
262 | } |
263 | |
264 | /* ---------------------------------------------------------------------- |
265 | * Full recursive Solo solver. |
266 | * |
267 | * The algorithm for this solver is shamelessly copied from a |
268 | * Python solver written by Andrew Wilkinson (which is GPLed, but |
269 | * I've reused only ideas and no code). It mostly just does the |
270 | * obvious recursive thing: pick an empty square, put one of the |
271 | * possible digits in it, recurse until all squares are filled, |
272 | * backtrack and change some choices if necessary. |
273 | * |
274 | * The clever bit is that every time it chooses which square to |
275 | * fill in next, it does so by counting the number of _possible_ |
276 | * numbers that can go in each square, and it prioritises so that |
277 | * it picks a square with the _lowest_ number of possibilities. The |
278 | * idea is that filling in lots of the obvious bits (particularly |
279 | * any squares with only one possibility) will cut down on the list |
280 | * of possibilities for other squares and hence reduce the enormous |
281 | * search space as much as possible as early as possible. |
282 | * |
283 | * In practice the algorithm appeared to work very well; run on |
284 | * sample problems from the Times it completed in well under a |
285 | * second on my G5 even when written in Python, and given an empty |
286 | * grid (so that in principle it would enumerate _all_ solved |
287 | * grids!) it found the first valid solution just as quickly. So |
288 | * with a bit more randomisation I see no reason not to use this as |
289 | * my grid generator. |
290 | */ |
291 | |
292 | /* |
293 | * Internal data structure used in solver to keep track of |
294 | * progress. |
295 | */ |
296 | struct rsolve_coord { int x, y, r; }; |
297 | struct rsolve_usage { |
298 | int c, r, cr; /* cr == c*r */ |
299 | /* grid is a copy of the input grid, modified as we go along */ |
300 | digit *grid; |
301 | /* row[y*cr+n-1] TRUE if digit n has been placed in row y */ |
302 | unsigned char *row; |
303 | /* col[x*cr+n-1] TRUE if digit n has been placed in row x */ |
304 | unsigned char *col; |
305 | /* blk[(y*c+x)*cr+n-1] TRUE if digit n has been placed in block (x,y) */ |
306 | unsigned char *blk; |
307 | /* This lists all the empty spaces remaining in the grid. */ |
308 | struct rsolve_coord *spaces; |
309 | int nspaces; |
310 | /* If we need randomisation in the solve, this is our random state. */ |
311 | random_state *rs; |
312 | /* Number of solutions so far found, and maximum number we care about. */ |
313 | int solns, maxsolns; |
314 | }; |
315 | |
316 | /* |
317 | * The real recursive step in the solving function. |
318 | */ |
319 | static void rsolve_real(struct rsolve_usage *usage, digit *grid) |
320 | { |
321 | int c = usage->c, r = usage->r, cr = usage->cr; |
322 | int i, j, n, sx, sy, bestm, bestr; |
323 | int *digits; |
324 | |
325 | /* |
326 | * Firstly, check for completion! If there are no spaces left |
327 | * in the grid, we have a solution. |
328 | */ |
329 | if (usage->nspaces == 0) { |
330 | if (!usage->solns) { |
331 | /* |
332 | * This is our first solution, so fill in the output grid. |
333 | */ |
334 | memcpy(grid, usage->grid, cr * cr); |
335 | } |
336 | usage->solns++; |
337 | return; |
338 | } |
339 | |
340 | /* |
341 | * Otherwise, there must be at least one space. Find the most |
342 | * constrained space, using the `r' field as a tie-breaker. |
343 | */ |
344 | bestm = cr+1; /* so that any space will beat it */ |
345 | bestr = 0; |
346 | i = sx = sy = -1; |
347 | for (j = 0; j < usage->nspaces; j++) { |
348 | int x = usage->spaces[j].x, y = usage->spaces[j].y; |
349 | int m; |
350 | |
351 | /* |
352 | * Find the number of digits that could go in this space. |
353 | */ |
354 | m = 0; |
355 | for (n = 0; n < cr; n++) |
356 | if (!usage->row[y*cr+n] && !usage->col[x*cr+n] && |
357 | !usage->blk[((y/c)*c+(x/r))*cr+n]) |
358 | m++; |
359 | |
360 | if (m < bestm || (m == bestm && usage->spaces[j].r < bestr)) { |
361 | bestm = m; |
362 | bestr = usage->spaces[j].r; |
363 | sx = x; |
364 | sy = y; |
365 | i = j; |
366 | } |
367 | } |
368 | |
369 | /* |
370 | * Swap that square into the final place in the spaces array, |
371 | * so that decrementing nspaces will remove it from the list. |
372 | */ |
373 | if (i != usage->nspaces-1) { |
374 | struct rsolve_coord t; |
375 | t = usage->spaces[usage->nspaces-1]; |
376 | usage->spaces[usage->nspaces-1] = usage->spaces[i]; |
377 | usage->spaces[i] = t; |
378 | } |
379 | |
380 | /* |
381 | * Now we've decided which square to start our recursion at, |
382 | * simply go through all possible values, shuffling them |
383 | * randomly first if necessary. |
384 | */ |
385 | digits = snewn(bestm, int); |
386 | j = 0; |
387 | for (n = 0; n < cr; n++) |
388 | if (!usage->row[sy*cr+n] && !usage->col[sx*cr+n] && |
389 | !usage->blk[((sy/c)*c+(sx/r))*cr+n]) { |
390 | digits[j++] = n+1; |
391 | } |
392 | |
393 | if (usage->rs) { |
394 | /* shuffle */ |
395 | for (i = j; i > 1; i--) { |
396 | int p = random_upto(usage->rs, i); |
397 | if (p != i-1) { |
398 | int t = digits[p]; |
399 | digits[p] = digits[i-1]; |
400 | digits[i-1] = t; |
401 | } |
402 | } |
403 | } |
404 | |
405 | /* And finally, go through the digit list and actually recurse. */ |
406 | for (i = 0; i < j; i++) { |
407 | n = digits[i]; |
408 | |
409 | /* Update the usage structure to reflect the placing of this digit. */ |
410 | usage->row[sy*cr+n-1] = usage->col[sx*cr+n-1] = |
411 | usage->blk[((sy/c)*c+(sx/r))*cr+n-1] = TRUE; |
412 | usage->grid[sy*cr+sx] = n; |
413 | usage->nspaces--; |
414 | |
415 | /* Call the solver recursively. */ |
416 | rsolve_real(usage, grid); |
417 | |
418 | /* |
419 | * If we have seen as many solutions as we need, terminate |
420 | * all processing immediately. |
421 | */ |
422 | if (usage->solns >= usage->maxsolns) |
423 | break; |
424 | |
425 | /* Revert the usage structure. */ |
426 | usage->row[sy*cr+n-1] = usage->col[sx*cr+n-1] = |
427 | usage->blk[((sy/c)*c+(sx/r))*cr+n-1] = FALSE; |
428 | usage->grid[sy*cr+sx] = 0; |
429 | usage->nspaces++; |
430 | } |
431 | |
432 | sfree(digits); |
433 | } |
434 | |
435 | /* |
436 | * Entry point to solver. You give it dimensions and a starting |
437 | * grid, which is simply an array of N^4 digits. In that array, 0 |
438 | * means an empty square, and 1..N mean a clue square. |
439 | * |
440 | * Return value is the number of solutions found; searching will |
441 | * stop after the provided `max'. (Thus, you can pass max==1 to |
442 | * indicate that you only care about finding _one_ solution, or |
443 | * max==2 to indicate that you want to know the difference between |
444 | * a unique and non-unique solution.) The input parameter `grid' is |
445 | * also filled in with the _first_ (or only) solution found by the |
446 | * solver. |
447 | */ |
448 | static int rsolve(int c, int r, digit *grid, random_state *rs, int max) |
449 | { |
450 | struct rsolve_usage *usage; |
451 | int x, y, cr = c*r; |
452 | int ret; |
453 | |
454 | /* |
455 | * Create an rsolve_usage structure. |
456 | */ |
457 | usage = snew(struct rsolve_usage); |
458 | |
459 | usage->c = c; |
460 | usage->r = r; |
461 | usage->cr = cr; |
462 | |
463 | usage->grid = snewn(cr * cr, digit); |
464 | memcpy(usage->grid, grid, cr * cr); |
465 | |
466 | usage->row = snewn(cr * cr, unsigned char); |
467 | usage->col = snewn(cr * cr, unsigned char); |
468 | usage->blk = snewn(cr * cr, unsigned char); |
469 | memset(usage->row, FALSE, cr * cr); |
470 | memset(usage->col, FALSE, cr * cr); |
471 | memset(usage->blk, FALSE, cr * cr); |
472 | |
473 | usage->spaces = snewn(cr * cr, struct rsolve_coord); |
474 | usage->nspaces = 0; |
475 | |
476 | usage->solns = 0; |
477 | usage->maxsolns = max; |
478 | |
479 | usage->rs = rs; |
480 | |
481 | /* |
482 | * Now fill it in with data from the input grid. |
483 | */ |
484 | for (y = 0; y < cr; y++) { |
485 | for (x = 0; x < cr; x++) { |
486 | int v = grid[y*cr+x]; |
487 | if (v == 0) { |
488 | usage->spaces[usage->nspaces].x = x; |
489 | usage->spaces[usage->nspaces].y = y; |
490 | if (rs) |
491 | usage->spaces[usage->nspaces].r = random_bits(rs, 31); |
492 | else |
493 | usage->spaces[usage->nspaces].r = usage->nspaces; |
494 | usage->nspaces++; |
495 | } else { |
496 | usage->row[y*cr+v-1] = TRUE; |
497 | usage->col[x*cr+v-1] = TRUE; |
498 | usage->blk[((y/c)*c+(x/r))*cr+v-1] = TRUE; |
499 | } |
500 | } |
501 | } |
502 | |
503 | /* |
504 | * Run the real recursive solving function. |
505 | */ |
506 | rsolve_real(usage, grid); |
507 | ret = usage->solns; |
508 | |
509 | /* |
510 | * Clean up the usage structure now we have our answer. |
511 | */ |
512 | sfree(usage->spaces); |
513 | sfree(usage->blk); |
514 | sfree(usage->col); |
515 | sfree(usage->row); |
516 | sfree(usage->grid); |
517 | sfree(usage); |
518 | |
519 | /* |
520 | * And return. |
521 | */ |
522 | return ret; |
523 | } |
524 | |
525 | /* ---------------------------------------------------------------------- |
526 | * End of recursive solver code. |
527 | */ |
528 | |
529 | /* ---------------------------------------------------------------------- |
530 | * Less capable non-recursive solver. This one is used to check |
531 | * solubility of a grid as we gradually remove numbers from it: by |
532 | * verifying a grid using this solver we can ensure it isn't _too_ |
533 | * hard (e.g. does not actually require guessing and backtracking). |
534 | * |
535 | * It supports a variety of specific modes of reasoning. By |
536 | * enabling or disabling subsets of these modes we can arrange a |
537 | * range of difficulty levels. |
538 | */ |
539 | |
540 | /* |
541 | * Modes of reasoning currently supported: |
542 | * |
543 | * - Positional elimination: a number must go in a particular |
544 | * square because all the other empty squares in a given |
545 | * row/col/blk are ruled out. |
546 | * |
547 | * - Numeric elimination: a square must have a particular number |
548 | * in because all the other numbers that could go in it are |
549 | * ruled out. |
550 | * |
551 | * More advanced modes of reasoning I'd like to support in future: |
552 | * |
553 | * - Intersectional elimination: given two domains which overlap |
554 | * (hence one must be a block, and the other can be a row or |
555 | * col), if the possible locations for a particular number in |
556 | * one of the domains can be narrowed down to the overlap, then |
557 | * that number can be ruled out everywhere but the overlap in |
558 | * the other domain too. |
559 | * |
560 | * - Setwise numeric elimination: if there is a subset of the |
561 | * empty squares within a domain such that the union of the |
562 | * possible numbers in that subset has the same size as the |
563 | * subset itself, then those numbers can be ruled out everywhere |
564 | * else in the domain. (For example, if there are five empty |
565 | * squares and the possible numbers in each are 12, 23, 13, 134 |
566 | * and 1345, then the first three empty squares form such a |
567 | * subset: the numbers 1, 2 and 3 _must_ be in those three |
568 | * squares in some permutation, and hence we can deduce none of |
569 | * them can be in the fourth or fifth squares.) |
570 | */ |
571 | |
4846f788 |
572 | /* |
573 | * Within this solver, I'm going to transform all y-coordinates by |
574 | * inverting the significance of the block number and the position |
575 | * within the block. That is, we will start with the top row of |
576 | * each block in order, then the second row of each block in order, |
577 | * etc. |
578 | * |
579 | * This transformation has the enormous advantage that it means |
580 | * every row, column _and_ block is described by an arithmetic |
581 | * progression of coordinates within the cubic array, so that I can |
582 | * use the same very simple function to do blockwise, row-wise and |
583 | * column-wise elimination. |
584 | */ |
585 | #define YTRANS(y) (((y)%c)*r+(y)/c) |
586 | #define YUNTRANS(y) (((y)%r)*c+(y)/r) |
587 | |
1d8e8ad8 |
588 | struct nsolve_usage { |
589 | int c, r, cr; |
590 | /* |
591 | * We set up a cubic array, indexed by x, y and digit; each |
592 | * element of this array is TRUE or FALSE according to whether |
593 | * or not that digit _could_ in principle go in that position. |
594 | * |
595 | * The way to index this array is cube[(x*cr+y)*cr+n-1]. |
4846f788 |
596 | * y-coordinates in here are transformed. |
1d8e8ad8 |
597 | */ |
598 | unsigned char *cube; |
599 | /* |
600 | * This is the grid in which we write down our final |
4846f788 |
601 | * deductions. y-coordinates in here are _not_ transformed. |
1d8e8ad8 |
602 | */ |
603 | digit *grid; |
604 | /* |
605 | * Now we keep track, at a slightly higher level, of what we |
606 | * have yet to work out, to prevent doing the same deduction |
607 | * many times. |
608 | */ |
609 | /* row[y*cr+n-1] TRUE if digit n has been placed in row y */ |
610 | unsigned char *row; |
611 | /* col[x*cr+n-1] TRUE if digit n has been placed in row x */ |
612 | unsigned char *col; |
613 | /* blk[(y*c+x)*cr+n-1] TRUE if digit n has been placed in block (x,y) */ |
614 | unsigned char *blk; |
615 | }; |
4846f788 |
616 | #define cubepos(x,y,n) (((x)*usage->cr+(y))*usage->cr+(n)-1) |
617 | #define cube(x,y,n) (usage->cube[cubepos(x,y,n)]) |
1d8e8ad8 |
618 | |
619 | /* |
620 | * Function called when we are certain that a particular square has |
4846f788 |
621 | * a particular number in it. The y-coordinate passed in here is |
622 | * transformed. |
1d8e8ad8 |
623 | */ |
624 | static void nsolve_place(struct nsolve_usage *usage, int x, int y, int n) |
625 | { |
626 | int c = usage->c, r = usage->r, cr = usage->cr; |
627 | int i, j, bx, by; |
628 | |
629 | assert(cube(x,y,n)); |
630 | |
631 | /* |
632 | * Rule out all other numbers in this square. |
633 | */ |
634 | for (i = 1; i <= cr; i++) |
635 | if (i != n) |
636 | cube(x,y,i) = FALSE; |
637 | |
638 | /* |
639 | * Rule out this number in all other positions in the row. |
640 | */ |
641 | for (i = 0; i < cr; i++) |
642 | if (i != y) |
643 | cube(x,i,n) = FALSE; |
644 | |
645 | /* |
646 | * Rule out this number in all other positions in the column. |
647 | */ |
648 | for (i = 0; i < cr; i++) |
649 | if (i != x) |
650 | cube(i,y,n) = FALSE; |
651 | |
652 | /* |
653 | * Rule out this number in all other positions in the block. |
654 | */ |
655 | bx = (x/r)*r; |
4846f788 |
656 | by = y % r; |
1d8e8ad8 |
657 | for (i = 0; i < r; i++) |
658 | for (j = 0; j < c; j++) |
4846f788 |
659 | if (bx+i != x || by+j*r != y) |
660 | cube(bx+i,by+j*r,n) = FALSE; |
1d8e8ad8 |
661 | |
662 | /* |
663 | * Enter the number in the result grid. |
664 | */ |
4846f788 |
665 | usage->grid[YUNTRANS(y)*cr+x] = n; |
1d8e8ad8 |
666 | |
667 | /* |
668 | * Cross out this number from the list of numbers left to place |
669 | * in its row, its column and its block. |
670 | */ |
671 | usage->row[y*cr+n-1] = usage->col[x*cr+n-1] = |
672 | usage->blk[((y/c)*c+(x/r))*cr+n-1] = TRUE; |
673 | } |
674 | |
4846f788 |
675 | static int nsolve_elim(struct nsolve_usage *usage, int start, int step) |
1d8e8ad8 |
676 | { |
4846f788 |
677 | int c = usage->c, r = usage->r, cr = c*r; |
678 | int fpos, m, i; |
1d8e8ad8 |
679 | |
680 | /* |
4846f788 |
681 | * Count the number of set bits within this section of the |
682 | * cube. |
1d8e8ad8 |
683 | */ |
684 | m = 0; |
4846f788 |
685 | fpos = -1; |
686 | for (i = 0; i < cr; i++) |
687 | if (usage->cube[start+i*step]) { |
688 | fpos = start+i*step; |
1d8e8ad8 |
689 | m++; |
690 | } |
691 | |
692 | if (m == 1) { |
4846f788 |
693 | int x, y, n; |
694 | assert(fpos >= 0); |
1d8e8ad8 |
695 | |
4846f788 |
696 | n = 1 + fpos % cr; |
697 | y = fpos / cr; |
698 | x = y / cr; |
699 | y %= cr; |
1d8e8ad8 |
700 | |
3ddae0ff |
701 | if (!usage->grid[YUNTRANS(y)*cr+x]) { |
702 | nsolve_place(usage, x, y, n); |
703 | return TRUE; |
704 | } |
1d8e8ad8 |
705 | } |
706 | |
707 | return FALSE; |
708 | } |
709 | |
710 | static int nsolve(int c, int r, digit *grid) |
711 | { |
712 | struct nsolve_usage *usage; |
713 | int cr = c*r; |
714 | int x, y, n; |
715 | |
716 | /* |
717 | * Set up a usage structure as a clean slate (everything |
718 | * possible). |
719 | */ |
720 | usage = snew(struct nsolve_usage); |
721 | usage->c = c; |
722 | usage->r = r; |
723 | usage->cr = cr; |
724 | usage->cube = snewn(cr*cr*cr, unsigned char); |
725 | usage->grid = grid; /* write straight back to the input */ |
726 | memset(usage->cube, TRUE, cr*cr*cr); |
727 | |
728 | usage->row = snewn(cr * cr, unsigned char); |
729 | usage->col = snewn(cr * cr, unsigned char); |
730 | usage->blk = snewn(cr * cr, unsigned char); |
731 | memset(usage->row, FALSE, cr * cr); |
732 | memset(usage->col, FALSE, cr * cr); |
733 | memset(usage->blk, FALSE, cr * cr); |
734 | |
735 | /* |
736 | * Place all the clue numbers we are given. |
737 | */ |
738 | for (x = 0; x < cr; x++) |
739 | for (y = 0; y < cr; y++) |
740 | if (grid[y*cr+x]) |
4846f788 |
741 | nsolve_place(usage, x, YTRANS(y), grid[y*cr+x]); |
1d8e8ad8 |
742 | |
743 | /* |
744 | * Now loop over the grid repeatedly trying all permitted modes |
745 | * of reasoning. The loop terminates if we complete an |
746 | * iteration without making any progress; we then return |
747 | * failure or success depending on whether the grid is full or |
748 | * not. |
749 | */ |
750 | while (1) { |
3ddae0ff |
751 | cont: |
752 | |
1d8e8ad8 |
753 | /* |
754 | * Blockwise positional elimination. |
755 | */ |
4846f788 |
756 | for (x = 0; x < cr; x += r) |
1d8e8ad8 |
757 | for (y = 0; y < r; y++) |
758 | for (n = 1; n <= cr; n++) |
4846f788 |
759 | if (!usage->blk[(y*c+(x/r))*cr+n-1] && |
760 | nsolve_elim(usage, cubepos(x,y,n), r*cr)) |
3ddae0ff |
761 | goto cont; |
1d8e8ad8 |
762 | |
763 | /* |
764 | * Row-wise positional elimination. |
765 | */ |
766 | for (y = 0; y < cr; y++) |
767 | for (n = 1; n <= cr; n++) |
768 | if (!usage->row[y*cr+n-1] && |
4846f788 |
769 | nsolve_elim(usage, cubepos(0,y,n), cr*cr)) |
3ddae0ff |
770 | goto cont; |
1d8e8ad8 |
771 | /* |
772 | * Column-wise positional elimination. |
773 | */ |
774 | for (x = 0; x < cr; x++) |
775 | for (n = 1; n <= cr; n++) |
776 | if (!usage->col[x*cr+n-1] && |
4846f788 |
777 | nsolve_elim(usage, cubepos(x,0,n), cr)) |
3ddae0ff |
778 | goto cont; |
1d8e8ad8 |
779 | |
780 | /* |
781 | * Numeric elimination. |
782 | */ |
783 | for (x = 0; x < cr; x++) |
784 | for (y = 0; y < cr; y++) |
4846f788 |
785 | if (!usage->grid[YUNTRANS(y)*cr+x] && |
786 | nsolve_elim(usage, cubepos(x,y,1), 1)) |
3ddae0ff |
787 | goto cont; |
1d8e8ad8 |
788 | |
789 | /* |
790 | * If we reach here, we have made no deductions in this |
791 | * iteration, so the algorithm terminates. |
792 | */ |
793 | break; |
794 | } |
795 | |
796 | sfree(usage->cube); |
797 | sfree(usage->row); |
798 | sfree(usage->col); |
799 | sfree(usage->blk); |
800 | sfree(usage); |
801 | |
802 | for (x = 0; x < cr; x++) |
803 | for (y = 0; y < cr; y++) |
804 | if (!grid[y*cr+x]) |
805 | return FALSE; |
806 | return TRUE; |
807 | } |
808 | |
809 | /* ---------------------------------------------------------------------- |
810 | * End of non-recursive solver code. |
811 | */ |
812 | |
813 | /* |
814 | * Check whether a grid contains a valid complete puzzle. |
815 | */ |
816 | static int check_valid(int c, int r, digit *grid) |
817 | { |
818 | int cr = c*r; |
819 | unsigned char *used; |
820 | int x, y, n; |
821 | |
822 | used = snewn(cr, unsigned char); |
823 | |
824 | /* |
825 | * Check that each row contains precisely one of everything. |
826 | */ |
827 | for (y = 0; y < cr; y++) { |
828 | memset(used, FALSE, cr); |
829 | for (x = 0; x < cr; x++) |
830 | if (grid[y*cr+x] > 0 && grid[y*cr+x] <= cr) |
831 | used[grid[y*cr+x]-1] = TRUE; |
832 | for (n = 0; n < cr; n++) |
833 | if (!used[n]) { |
834 | sfree(used); |
835 | return FALSE; |
836 | } |
837 | } |
838 | |
839 | /* |
840 | * Check that each column contains precisely one of everything. |
841 | */ |
842 | for (x = 0; x < cr; x++) { |
843 | memset(used, FALSE, cr); |
844 | for (y = 0; y < cr; y++) |
845 | if (grid[y*cr+x] > 0 && grid[y*cr+x] <= cr) |
846 | used[grid[y*cr+x]-1] = TRUE; |
847 | for (n = 0; n < cr; n++) |
848 | if (!used[n]) { |
849 | sfree(used); |
850 | return FALSE; |
851 | } |
852 | } |
853 | |
854 | /* |
855 | * Check that each block contains precisely one of everything. |
856 | */ |
857 | for (x = 0; x < cr; x += r) { |
858 | for (y = 0; y < cr; y += c) { |
859 | int xx, yy; |
860 | memset(used, FALSE, cr); |
861 | for (xx = x; xx < x+r; xx++) |
862 | for (yy = 0; yy < y+c; yy++) |
863 | if (grid[yy*cr+xx] > 0 && grid[yy*cr+xx] <= cr) |
864 | used[grid[yy*cr+xx]-1] = TRUE; |
865 | for (n = 0; n < cr; n++) |
866 | if (!used[n]) { |
867 | sfree(used); |
868 | return FALSE; |
869 | } |
870 | } |
871 | } |
872 | |
873 | sfree(used); |
874 | return TRUE; |
875 | } |
876 | |
ef57b17d |
877 | static void symmetry_limit(game_params *params, int *xlim, int *ylim, int s) |
878 | { |
879 | int c = params->c, r = params->r, cr = c*r; |
880 | |
881 | switch (s) { |
882 | case SYMM_NONE: |
883 | *xlim = *ylim = cr; |
884 | break; |
885 | case SYMM_ROT2: |
886 | *xlim = (cr+1) / 2; |
887 | *ylim = cr; |
888 | break; |
889 | case SYMM_REF4: |
890 | case SYMM_ROT4: |
891 | *xlim = *ylim = (cr+1) / 2; |
892 | break; |
893 | } |
894 | } |
895 | |
896 | static int symmetries(game_params *params, int x, int y, int *output, int s) |
897 | { |
898 | int c = params->c, r = params->r, cr = c*r; |
899 | int i = 0; |
900 | |
901 | *output++ = x; |
902 | *output++ = y; |
903 | i++; |
904 | |
905 | switch (s) { |
906 | case SYMM_NONE: |
907 | break; /* just x,y is all we need */ |
908 | case SYMM_REF4: |
909 | case SYMM_ROT4: |
910 | switch (s) { |
911 | case SYMM_REF4: |
912 | *output++ = cr - 1 - x; |
913 | *output++ = y; |
914 | i++; |
915 | |
916 | *output++ = x; |
917 | *output++ = cr - 1 - y; |
918 | i++; |
919 | break; |
920 | case SYMM_ROT4: |
921 | *output++ = cr - 1 - y; |
922 | *output++ = x; |
923 | i++; |
924 | |
925 | *output++ = y; |
926 | *output++ = cr - 1 - x; |
927 | i++; |
928 | break; |
929 | } |
930 | /* fall through */ |
931 | case SYMM_ROT2: |
932 | *output++ = cr - 1 - x; |
933 | *output++ = cr - 1 - y; |
934 | i++; |
935 | break; |
936 | } |
937 | |
938 | return i; |
939 | } |
940 | |
1d8e8ad8 |
941 | static char *new_game_seed(game_params *params, random_state *rs) |
942 | { |
943 | int c = params->c, r = params->r, cr = c*r; |
944 | int area = cr*cr; |
945 | digit *grid, *grid2; |
946 | struct xy { int x, y; } *locs; |
947 | int nlocs; |
948 | int ret; |
949 | char *seed; |
ef57b17d |
950 | int coords[16], ncoords; |
951 | int xlim, ylim; |
1d8e8ad8 |
952 | |
953 | /* |
954 | * Start the recursive solver with an empty grid to generate a |
955 | * random solved state. |
956 | */ |
957 | grid = snewn(area, digit); |
958 | memset(grid, 0, area); |
959 | ret = rsolve(c, r, grid, rs, 1); |
960 | assert(ret == 1); |
961 | assert(check_valid(c, r, grid)); |
962 | |
963 | #ifdef DEBUG |
964 | memcpy(grid, |
965 | "\x0\x1\x0\x0\x6\x0\x0\x0\x0" |
966 | "\x5\x0\x0\x7\x0\x4\x0\x2\x0" |
967 | "\x0\x0\x6\x1\x0\x0\x0\x0\x0" |
968 | "\x8\x9\x7\x0\x0\x0\x0\x0\x0" |
969 | "\x0\x0\x3\x0\x4\x0\x9\x0\x0" |
970 | "\x0\x0\x0\x0\x0\x0\x8\x7\x6" |
971 | "\x0\x0\x0\x0\x0\x9\x1\x0\x0" |
972 | "\x0\x3\x0\x6\x0\x5\x0\x0\x7" |
973 | "\x0\x0\x0\x0\x8\x0\x0\x5\x0" |
974 | , area); |
975 | |
976 | { |
977 | int y, x; |
978 | for (y = 0; y < cr; y++) { |
979 | for (x = 0; x < cr; x++) { |
980 | printf("%2.0d", grid[y*cr+x]); |
981 | } |
982 | printf("\n"); |
983 | } |
984 | printf("\n"); |
985 | } |
986 | |
987 | nsolve(c, r, grid); |
988 | |
989 | { |
990 | int y, x; |
991 | for (y = 0; y < cr; y++) { |
992 | for (x = 0; x < cr; x++) { |
993 | printf("%2.0d", grid[y*cr+x]); |
994 | } |
995 | printf("\n"); |
996 | } |
997 | printf("\n"); |
998 | } |
999 | #endif |
1000 | |
1001 | /* |
1002 | * Now we have a solved grid, start removing things from it |
1003 | * while preserving solubility. |
1004 | */ |
ef57b17d |
1005 | locs = snewn(area, struct xy); |
1d8e8ad8 |
1006 | grid2 = snewn(area, digit); |
ef57b17d |
1007 | symmetry_limit(params, &xlim, &ylim, params->symm); |
1d8e8ad8 |
1008 | while (1) { |
ef57b17d |
1009 | int x, y, i, j; |
1d8e8ad8 |
1010 | |
1011 | /* |
ef57b17d |
1012 | * Iterate over the grid and enumerate all the filled |
1013 | * squares we could empty. |
1d8e8ad8 |
1014 | */ |
1015 | nlocs = 0; |
1016 | |
ef57b17d |
1017 | for (x = 0; x < xlim; x++) |
1018 | for (y = 0; y < ylim; y++) |
1d8e8ad8 |
1019 | if (grid[y*cr+x]) { |
1020 | locs[nlocs].x = x; |
1021 | locs[nlocs].y = y; |
1022 | nlocs++; |
1023 | } |
1024 | |
1025 | /* |
1026 | * Now shuffle that list. |
1027 | */ |
1028 | for (i = nlocs; i > 1; i--) { |
1029 | int p = random_upto(rs, i); |
1030 | if (p != i-1) { |
1031 | struct xy t = locs[p]; |
1032 | locs[p] = locs[i-1]; |
1033 | locs[i-1] = t; |
1034 | } |
1035 | } |
1036 | |
1037 | /* |
1038 | * Now loop over the shuffled list and, for each element, |
1039 | * see whether removing that element (and its reflections) |
1040 | * from the grid will still leave the grid soluble by |
1041 | * nsolve. |
1042 | */ |
1043 | for (i = 0; i < nlocs; i++) { |
1044 | x = locs[i].x; |
1045 | y = locs[i].y; |
1046 | |
1047 | memcpy(grid2, grid, area); |
ef57b17d |
1048 | ncoords = symmetries(params, x, y, coords, params->symm); |
1049 | for (j = 0; j < ncoords; j++) |
1050 | grid2[coords[2*j+1]*cr+coords[2*j]] = 0; |
1d8e8ad8 |
1051 | |
1052 | if (nsolve(c, r, grid2)) { |
ef57b17d |
1053 | for (j = 0; j < ncoords; j++) |
1054 | grid[coords[2*j+1]*cr+coords[2*j]] = 0; |
1d8e8ad8 |
1055 | break; |
1056 | } |
1057 | } |
1058 | |
1059 | if (i == nlocs) { |
1060 | /* |
1061 | * There was nothing we could remove without destroying |
1062 | * solvability. |
1063 | */ |
1064 | break; |
1065 | } |
1066 | } |
1067 | sfree(grid2); |
1068 | sfree(locs); |
1069 | |
1070 | #ifdef DEBUG |
1071 | { |
1072 | int y, x; |
1073 | for (y = 0; y < cr; y++) { |
1074 | for (x = 0; x < cr; x++) { |
1075 | printf("%2.0d", grid[y*cr+x]); |
1076 | } |
1077 | printf("\n"); |
1078 | } |
1079 | printf("\n"); |
1080 | } |
1081 | #endif |
1082 | |
1083 | /* |
1084 | * Now we have the grid as it will be presented to the user. |
1085 | * Encode it in a game seed. |
1086 | */ |
1087 | { |
1088 | char *p; |
1089 | int run, i; |
1090 | |
1091 | seed = snewn(5 * area, char); |
1092 | p = seed; |
1093 | run = 0; |
1094 | for (i = 0; i <= area; i++) { |
1095 | int n = (i < area ? grid[i] : -1); |
1096 | |
1097 | if (!n) |
1098 | run++; |
1099 | else { |
1100 | if (run) { |
1101 | while (run > 0) { |
1102 | int c = 'a' - 1 + run; |
1103 | if (run > 26) |
1104 | c = 'z'; |
1105 | *p++ = c; |
1106 | run -= c - ('a' - 1); |
1107 | } |
1108 | } else { |
1109 | /* |
1110 | * If there's a number in the very top left or |
1111 | * bottom right, there's no point putting an |
1112 | * unnecessary _ before or after it. |
1113 | */ |
1114 | if (p > seed && n > 0) |
1115 | *p++ = '_'; |
1116 | } |
1117 | if (n > 0) |
1118 | p += sprintf(p, "%d", n); |
1119 | run = 0; |
1120 | } |
1121 | } |
1122 | assert(p - seed < 5 * area); |
1123 | *p++ = '\0'; |
1124 | seed = sresize(seed, p - seed, char); |
1125 | } |
1126 | |
1127 | sfree(grid); |
1128 | |
1129 | return seed; |
1130 | } |
1131 | |
1132 | static char *validate_seed(game_params *params, char *seed) |
1133 | { |
1134 | int area = params->r * params->r * params->c * params->c; |
1135 | int squares = 0; |
1136 | |
1137 | while (*seed) { |
1138 | int n = *seed++; |
1139 | if (n >= 'a' && n <= 'z') { |
1140 | squares += n - 'a' + 1; |
1141 | } else if (n == '_') { |
1142 | /* do nothing */; |
1143 | } else if (n > '0' && n <= '9') { |
1144 | squares++; |
1145 | while (*seed >= '0' && *seed <= '9') |
1146 | seed++; |
1147 | } else |
1148 | return "Invalid character in game specification"; |
1149 | } |
1150 | |
1151 | if (squares < area) |
1152 | return "Not enough data to fill grid"; |
1153 | |
1154 | if (squares > area) |
1155 | return "Too much data to fit in grid"; |
1156 | |
1157 | return NULL; |
1158 | } |
1159 | |
1160 | static game_state *new_game(game_params *params, char *seed) |
1161 | { |
1162 | game_state *state = snew(game_state); |
1163 | int c = params->c, r = params->r, cr = c*r, area = cr * cr; |
1164 | int i; |
1165 | |
1166 | state->c = params->c; |
1167 | state->r = params->r; |
1168 | |
1169 | state->grid = snewn(area, digit); |
1170 | state->immutable = snewn(area, unsigned char); |
1171 | memset(state->immutable, FALSE, area); |
1172 | |
1173 | state->completed = FALSE; |
1174 | |
1175 | i = 0; |
1176 | while (*seed) { |
1177 | int n = *seed++; |
1178 | if (n >= 'a' && n <= 'z') { |
1179 | int run = n - 'a' + 1; |
1180 | assert(i + run <= area); |
1181 | while (run-- > 0) |
1182 | state->grid[i++] = 0; |
1183 | } else if (n == '_') { |
1184 | /* do nothing */; |
1185 | } else if (n > '0' && n <= '9') { |
1186 | assert(i < area); |
1187 | state->immutable[i] = TRUE; |
1188 | state->grid[i++] = atoi(seed-1); |
1189 | while (*seed >= '0' && *seed <= '9') |
1190 | seed++; |
1191 | } else { |
1192 | assert(!"We can't get here"); |
1193 | } |
1194 | } |
1195 | assert(i == area); |
1196 | |
1197 | return state; |
1198 | } |
1199 | |
1200 | static game_state *dup_game(game_state *state) |
1201 | { |
1202 | game_state *ret = snew(game_state); |
1203 | int c = state->c, r = state->r, cr = c*r, area = cr * cr; |
1204 | |
1205 | ret->c = state->c; |
1206 | ret->r = state->r; |
1207 | |
1208 | ret->grid = snewn(area, digit); |
1209 | memcpy(ret->grid, state->grid, area); |
1210 | |
1211 | ret->immutable = snewn(area, unsigned char); |
1212 | memcpy(ret->immutable, state->immutable, area); |
1213 | |
1214 | ret->completed = state->completed; |
1215 | |
1216 | return ret; |
1217 | } |
1218 | |
1219 | static void free_game(game_state *state) |
1220 | { |
1221 | sfree(state->immutable); |
1222 | sfree(state->grid); |
1223 | sfree(state); |
1224 | } |
1225 | |
1226 | struct game_ui { |
1227 | /* |
1228 | * These are the coordinates of the currently highlighted |
1229 | * square on the grid, or -1,-1 if there isn't one. When there |
1230 | * is, pressing a valid number or letter key or Space will |
1231 | * enter that number or letter in the grid. |
1232 | */ |
1233 | int hx, hy; |
1234 | }; |
1235 | |
1236 | static game_ui *new_ui(game_state *state) |
1237 | { |
1238 | game_ui *ui = snew(game_ui); |
1239 | |
1240 | ui->hx = ui->hy = -1; |
1241 | |
1242 | return ui; |
1243 | } |
1244 | |
1245 | static void free_ui(game_ui *ui) |
1246 | { |
1247 | sfree(ui); |
1248 | } |
1249 | |
1250 | static game_state *make_move(game_state *from, game_ui *ui, int x, int y, |
1251 | int button) |
1252 | { |
1253 | int c = from->c, r = from->r, cr = c*r; |
1254 | int tx, ty; |
1255 | game_state *ret; |
1256 | |
1257 | tx = (x - BORDER) / TILE_SIZE; |
1258 | ty = (y - BORDER) / TILE_SIZE; |
1259 | |
1260 | if (tx >= 0 && tx < cr && ty >= 0 && ty < cr && button == LEFT_BUTTON) { |
1261 | if (tx == ui->hx && ty == ui->hy) { |
1262 | ui->hx = ui->hy = -1; |
1263 | } else { |
1264 | ui->hx = tx; |
1265 | ui->hy = ty; |
1266 | } |
1267 | return from; /* UI activity occurred */ |
1268 | } |
1269 | |
1270 | if (ui->hx != -1 && ui->hy != -1 && |
1271 | ((button >= '1' && button <= '9' && button - '0' <= cr) || |
1272 | (button >= 'a' && button <= 'z' && button - 'a' + 10 <= cr) || |
1273 | (button >= 'A' && button <= 'Z' && button - 'A' + 10 <= cr) || |
1274 | button == ' ')) { |
1275 | int n = button - '0'; |
1276 | if (button >= 'A' && button <= 'Z') |
1277 | n = button - 'A' + 10; |
1278 | if (button >= 'a' && button <= 'z') |
1279 | n = button - 'a' + 10; |
1280 | if (button == ' ') |
1281 | n = 0; |
1282 | |
1283 | if (from->immutable[ui->hy*cr+ui->hx]) |
1284 | return NULL; /* can't overwrite this square */ |
1285 | |
1286 | ret = dup_game(from); |
1287 | ret->grid[ui->hy*cr+ui->hx] = n; |
1288 | ui->hx = ui->hy = -1; |
1289 | |
1290 | /* |
1291 | * We've made a real change to the grid. Check to see |
1292 | * if the game has been completed. |
1293 | */ |
1294 | if (!ret->completed && check_valid(c, r, ret->grid)) { |
1295 | ret->completed = TRUE; |
1296 | } |
1297 | |
1298 | return ret; /* made a valid move */ |
1299 | } |
1300 | |
1301 | return NULL; |
1302 | } |
1303 | |
1304 | /* ---------------------------------------------------------------------- |
1305 | * Drawing routines. |
1306 | */ |
1307 | |
1308 | struct game_drawstate { |
1309 | int started; |
1310 | int c, r, cr; |
1311 | digit *grid; |
1312 | unsigned char *hl; |
1313 | }; |
1314 | |
1315 | #define XSIZE(cr) ((cr) * TILE_SIZE + 2*BORDER + 1) |
1316 | #define YSIZE(cr) ((cr) * TILE_SIZE + 2*BORDER + 1) |
1317 | |
1318 | static void game_size(game_params *params, int *x, int *y) |
1319 | { |
1320 | int c = params->c, r = params->r, cr = c*r; |
1321 | |
1322 | *x = XSIZE(cr); |
1323 | *y = YSIZE(cr); |
1324 | } |
1325 | |
1326 | static float *game_colours(frontend *fe, game_state *state, int *ncolours) |
1327 | { |
1328 | float *ret = snewn(3 * NCOLOURS, float); |
1329 | |
1330 | frontend_default_colour(fe, &ret[COL_BACKGROUND * 3]); |
1331 | |
1332 | ret[COL_GRID * 3 + 0] = 0.0F; |
1333 | ret[COL_GRID * 3 + 1] = 0.0F; |
1334 | ret[COL_GRID * 3 + 2] = 0.0F; |
1335 | |
1336 | ret[COL_CLUE * 3 + 0] = 0.0F; |
1337 | ret[COL_CLUE * 3 + 1] = 0.0F; |
1338 | ret[COL_CLUE * 3 + 2] = 0.0F; |
1339 | |
1340 | ret[COL_USER * 3 + 0] = 0.0F; |
1341 | ret[COL_USER * 3 + 1] = 0.6F * ret[COL_BACKGROUND * 3 + 1]; |
1342 | ret[COL_USER * 3 + 2] = 0.0F; |
1343 | |
1344 | ret[COL_HIGHLIGHT * 3 + 0] = 0.85F * ret[COL_BACKGROUND * 3 + 0]; |
1345 | ret[COL_HIGHLIGHT * 3 + 1] = 0.85F * ret[COL_BACKGROUND * 3 + 1]; |
1346 | ret[COL_HIGHLIGHT * 3 + 2] = 0.85F * ret[COL_BACKGROUND * 3 + 2]; |
1347 | |
1348 | *ncolours = NCOLOURS; |
1349 | return ret; |
1350 | } |
1351 | |
1352 | static game_drawstate *game_new_drawstate(game_state *state) |
1353 | { |
1354 | struct game_drawstate *ds = snew(struct game_drawstate); |
1355 | int c = state->c, r = state->r, cr = c*r; |
1356 | |
1357 | ds->started = FALSE; |
1358 | ds->c = c; |
1359 | ds->r = r; |
1360 | ds->cr = cr; |
1361 | ds->grid = snewn(cr*cr, digit); |
1362 | memset(ds->grid, 0, cr*cr); |
1363 | ds->hl = snewn(cr*cr, unsigned char); |
1364 | memset(ds->hl, 0, cr*cr); |
1365 | |
1366 | return ds; |
1367 | } |
1368 | |
1369 | static void game_free_drawstate(game_drawstate *ds) |
1370 | { |
1371 | sfree(ds->hl); |
1372 | sfree(ds->grid); |
1373 | sfree(ds); |
1374 | } |
1375 | |
1376 | static void draw_number(frontend *fe, game_drawstate *ds, game_state *state, |
1377 | int x, int y, int hl) |
1378 | { |
1379 | int c = state->c, r = state->r, cr = c*r; |
1380 | int tx, ty; |
1381 | int cx, cy, cw, ch; |
1382 | char str[2]; |
1383 | |
1384 | if (ds->grid[y*cr+x] == state->grid[y*cr+x] && ds->hl[y*cr+x] == hl) |
1385 | return; /* no change required */ |
1386 | |
1387 | tx = BORDER + x * TILE_SIZE + 2; |
1388 | ty = BORDER + y * TILE_SIZE + 2; |
1389 | |
1390 | cx = tx; |
1391 | cy = ty; |
1392 | cw = TILE_SIZE-3; |
1393 | ch = TILE_SIZE-3; |
1394 | |
1395 | if (x % r) |
1396 | cx--, cw++; |
1397 | if ((x+1) % r) |
1398 | cw++; |
1399 | if (y % c) |
1400 | cy--, ch++; |
1401 | if ((y+1) % c) |
1402 | ch++; |
1403 | |
1404 | clip(fe, cx, cy, cw, ch); |
1405 | |
1406 | /* background needs erasing? */ |
1407 | if (ds->grid[y*cr+x] || ds->hl[y*cr+x] != hl) |
1408 | draw_rect(fe, cx, cy, cw, ch, hl ? COL_HIGHLIGHT : COL_BACKGROUND); |
1409 | |
1410 | /* new number needs drawing? */ |
1411 | if (state->grid[y*cr+x]) { |
1412 | str[1] = '\0'; |
1413 | str[0] = state->grid[y*cr+x] + '0'; |
1414 | if (str[0] > '9') |
1415 | str[0] += 'a' - ('9'+1); |
1416 | draw_text(fe, tx + TILE_SIZE/2, ty + TILE_SIZE/2, |
1417 | FONT_VARIABLE, TILE_SIZE/2, ALIGN_VCENTRE | ALIGN_HCENTRE, |
1418 | state->immutable[y*cr+x] ? COL_CLUE : COL_USER, str); |
1419 | } |
1420 | |
1421 | unclip(fe); |
1422 | |
1423 | draw_update(fe, cx, cy, cw, ch); |
1424 | |
1425 | ds->grid[y*cr+x] = state->grid[y*cr+x]; |
1426 | ds->hl[y*cr+x] = hl; |
1427 | } |
1428 | |
1429 | static void game_redraw(frontend *fe, game_drawstate *ds, game_state *oldstate, |
1430 | game_state *state, int dir, game_ui *ui, |
1431 | float animtime, float flashtime) |
1432 | { |
1433 | int c = state->c, r = state->r, cr = c*r; |
1434 | int x, y; |
1435 | |
1436 | if (!ds->started) { |
1437 | /* |
1438 | * The initial contents of the window are not guaranteed |
1439 | * and can vary with front ends. To be on the safe side, |
1440 | * all games should start by drawing a big |
1441 | * background-colour rectangle covering the whole window. |
1442 | */ |
1443 | draw_rect(fe, 0, 0, XSIZE(cr), YSIZE(cr), COL_BACKGROUND); |
1444 | |
1445 | /* |
1446 | * Draw the grid. |
1447 | */ |
1448 | for (x = 0; x <= cr; x++) { |
1449 | int thick = (x % r ? 0 : 1); |
1450 | draw_rect(fe, BORDER + x*TILE_SIZE - thick, BORDER-1, |
1451 | 1+2*thick, cr*TILE_SIZE+3, COL_GRID); |
1452 | } |
1453 | for (y = 0; y <= cr; y++) { |
1454 | int thick = (y % c ? 0 : 1); |
1455 | draw_rect(fe, BORDER-1, BORDER + y*TILE_SIZE - thick, |
1456 | cr*TILE_SIZE+3, 1+2*thick, COL_GRID); |
1457 | } |
1458 | } |
1459 | |
1460 | /* |
1461 | * Draw any numbers which need redrawing. |
1462 | */ |
1463 | for (x = 0; x < cr; x++) { |
1464 | for (y = 0; y < cr; y++) { |
1465 | draw_number(fe, ds, state, x, y, |
1466 | (x == ui->hx && y == ui->hy) || |
1467 | (flashtime > 0 && |
1468 | (flashtime <= FLASH_TIME/3 || |
1469 | flashtime >= FLASH_TIME*2/3))); |
1470 | } |
1471 | } |
1472 | |
1473 | /* |
1474 | * Update the _entire_ grid if necessary. |
1475 | */ |
1476 | if (!ds->started) { |
1477 | draw_update(fe, 0, 0, XSIZE(cr), YSIZE(cr)); |
1478 | ds->started = TRUE; |
1479 | } |
1480 | } |
1481 | |
1482 | static float game_anim_length(game_state *oldstate, game_state *newstate, |
1483 | int dir) |
1484 | { |
1485 | return 0.0F; |
1486 | } |
1487 | |
1488 | static float game_flash_length(game_state *oldstate, game_state *newstate, |
1489 | int dir) |
1490 | { |
1491 | if (!oldstate->completed && newstate->completed) |
1492 | return FLASH_TIME; |
1493 | return 0.0F; |
1494 | } |
1495 | |
1496 | static int game_wants_statusbar(void) |
1497 | { |
1498 | return FALSE; |
1499 | } |
1500 | |
1501 | #ifdef COMBINED |
1502 | #define thegame solo |
1503 | #endif |
1504 | |
1505 | const struct game thegame = { |
1506 | "Solo", "games.solo", TRUE, |
1507 | default_params, |
1508 | game_fetch_preset, |
1509 | decode_params, |
1510 | encode_params, |
1511 | free_params, |
1512 | dup_params, |
1513 | game_configure, |
1514 | custom_params, |
1515 | validate_params, |
1516 | new_game_seed, |
1517 | validate_seed, |
1518 | new_game, |
1519 | dup_game, |
1520 | free_game, |
1521 | new_ui, |
1522 | free_ui, |
1523 | make_move, |
1524 | game_size, |
1525 | game_colours, |
1526 | game_new_drawstate, |
1527 | game_free_drawstate, |
1528 | game_redraw, |
1529 | game_anim_length, |
1530 | game_flash_length, |
1531 | game_wants_statusbar, |
1532 | }; |
3ddae0ff |
1533 | |
1534 | #ifdef STANDALONE_SOLVER |
1535 | |
1536 | void frontend_default_colour(frontend *fe, float *output) {} |
1537 | void draw_text(frontend *fe, int x, int y, int fonttype, int fontsize, |
1538 | int align, int colour, char *text) {} |
1539 | void draw_rect(frontend *fe, int x, int y, int w, int h, int colour) {} |
1540 | void draw_line(frontend *fe, int x1, int y1, int x2, int y2, int colour) {} |
1541 | void draw_polygon(frontend *fe, int *coords, int npoints, |
1542 | int fill, int colour) {} |
1543 | void clip(frontend *fe, int x, int y, int w, int h) {} |
1544 | void unclip(frontend *fe) {} |
1545 | void start_draw(frontend *fe) {} |
1546 | void draw_update(frontend *fe, int x, int y, int w, int h) {} |
1547 | void end_draw(frontend *fe) {} |
1548 | |
1549 | #include <stdarg.h> |
1550 | |
1551 | void fatal(char *fmt, ...) |
1552 | { |
1553 | va_list ap; |
1554 | |
1555 | fprintf(stderr, "fatal error: "); |
1556 | |
1557 | va_start(ap, fmt); |
1558 | vfprintf(stderr, fmt, ap); |
1559 | va_end(ap); |
1560 | |
1561 | fprintf(stderr, "\n"); |
1562 | exit(1); |
1563 | } |
1564 | |
1565 | int main(int argc, char **argv) |
1566 | { |
1567 | game_params *p; |
1568 | game_state *s; |
1569 | int recurse = FALSE; |
1570 | char *id = NULL, *seed, *err; |
1571 | int y, x; |
1572 | |
1573 | while (--argc > 0) { |
1574 | char *p = *++argv; |
1575 | if (!strcmp(p, "-r")) { |
1576 | recurse = TRUE; |
1577 | } else if (!strcmp(p, "-n")) { |
1578 | recurse = FALSE; |
1579 | } else if (*p == '-') { |
1580 | fprintf(stderr, "%s: unrecognised option `%s'\n", argv[0]); |
1581 | return 1; |
1582 | } else { |
1583 | id = p; |
1584 | } |
1585 | } |
1586 | |
1587 | if (!id) { |
1588 | fprintf(stderr, "usage: %s [-n | -r] <game_id>\n", argv[0]); |
1589 | return 1; |
1590 | } |
1591 | |
1592 | seed = strchr(id, ':'); |
1593 | if (!seed) { |
1594 | fprintf(stderr, "%s: game id expects a colon in it\n", argv[0]); |
1595 | return 1; |
1596 | } |
1597 | *seed++ = '\0'; |
1598 | |
1599 | p = decode_params(id); |
1600 | err = validate_seed(p, seed); |
1601 | if (err) { |
1602 | fprintf(stderr, "%s: %s\n", argv[0], err); |
1603 | return 1; |
1604 | } |
1605 | s = new_game(p, seed); |
1606 | |
1607 | if (recurse) { |
1608 | int ret = rsolve(p->c, p->r, s->grid, NULL, 2); |
1609 | if (ret > 1) { |
1610 | printf("multiple solutions detected; only first one output\n"); |
1611 | } |
1612 | } else { |
1613 | nsolve(p->c, p->r, s->grid); |
1614 | } |
1615 | |
1616 | for (y = 0; y < p->c * p->r; y++) { |
1617 | for (x = 0; x < p->c * p->r; x++) { |
1618 | printf("%2.0d", s->grid[y * p->c * p->r + x]); |
1619 | } |
1620 | printf("\n"); |
1621 | } |
1622 | printf("\n"); |
1623 | |
1624 | return 0; |
1625 | } |
1626 | |
1627 | #endif |