~mdw / sgt / puzzles / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
Typo fix (from Debian).
[sgt/puzzles] / signpost.c
CommitLineData
4cbcbfca 1/*
2 * signpost.c: implementation of the janko game 'arrow path'
4cbcbfca 3 */
4
5#include <stdio.h>
6#include <stdlib.h>
7#include <string.h>
8#include <assert.h>
9#include <ctype.h>
10#include <math.h>
11
12#include "puzzles.h"
13
14#define PREFERRED_TILE_SIZE 48
15#define TILE_SIZE (ds->tilesize)
16#define BLITTER_SIZE TILE_SIZE
17#define BORDER (TILE_SIZE / 2)
18
19#define COORD(x) ( (x) * TILE_SIZE + BORDER )
20#define FROMCOORD(x) ( ((x) - BORDER + TILE_SIZE) / TILE_SIZE - 1 )
21
22#define INGRID(s,x,y) ((x) >= 0 && (x) < (s)->w && (y) >= 0 && (y) < (s)->h)
23
24#define FLASH_SPIN 0.7F
25
26#define NBACKGROUNDS 16
27
28enum {
29 COL_BACKGROUND, COL_HIGHLIGHT, COL_LOWLIGHT,
30 COL_GRID, COL_CURSOR, COL_ERROR, COL_DRAG_ORIGIN,
31 COL_ARROW, COL_ARROW_BG_DIM,
32 COL_NUMBER, COL_NUMBER_SET, COL_NUMBER_SET_MID,
33 COL_B0, /* background colours */
34 COL_M0 = COL_B0 + 1*NBACKGROUNDS, /* mid arrow colours */
35 COL_D0 = COL_B0 + 2*NBACKGROUNDS, /* dim arrow colours */
36 COL_X0 = COL_B0 + 3*NBACKGROUNDS, /* dim arrow colours */
37 NCOLOURS = COL_B0 + 4*NBACKGROUNDS
38};
39
40struct game_params {
41 int w, h;
42 int force_corner_start;
43};
44
45enum { DIR_N = 0, DIR_NE, DIR_E, DIR_SE, DIR_S, DIR_SW, DIR_W, DIR_NW, DIR_MAX };
46static const char *dirstrings[8] = { "N ", "NE", "E ", "SE", "S ", "SW", "W ", "NW" };
47
48static const int dxs[DIR_MAX] = { 0, 1, 1, 1, 0, -1, -1, -1 };
49static const int dys[DIR_MAX] = { -1, -1, 0, 1, 1, 1, 0, -1 };
50
51#define DIR_OPPOSITE(d) ((d+4)%8)
52
53struct game_state {
54 int w, h, n;
55 int completed, used_solve, impossible;
56 int *dirs; /* direction enums, size n */
57 int *nums; /* numbers, size n */
58 unsigned int *flags; /* flags, size n */
59 int *next, *prev; /* links to other cell indexes, size n (-1 absent) */
60 int *dsf; /* connects regions with a dsf. */
61 int *numsi; /* for each number, which index is it in? (-1 absent) */
62};
63
64#define FLAG_IMMUTABLE 1
65#define FLAG_ERROR 2
66
67/* --- Generally useful functions --- */
68
69#define ISREALNUM(state, num) ((num) > 0 && (num) <= (state)->n)
70
71static int whichdir(int fromx, int fromy, int tox, int toy)
72{
73 int i, dx, dy;
74
75 dx = tox - fromx;
76 dy = toy - fromy;
77
78 if (dx && dy && abs(dx) != abs(dy)) return -1;
79
80 if (dx) dx = dx / abs(dx); /* limit to (-1, 0, 1) */
81 if (dy) dy = dy / abs(dy); /* ditto */
82
83 for (i = 0; i < DIR_MAX; i++) {
84 if (dx == dxs[i] && dy == dys[i]) return i;
85 }
86 return -1;
87}
88
89static int whichdiri(game_state *state, int fromi, int toi)
90{
91 int w = state->w;
92 return whichdir(fromi%w, fromi/w, toi%w, toi/w);
93}
94
95static int ispointing(game_state *state, int fromx, int fromy, int tox, int toy)
96{
97 int w = state->w, dir = state->dirs[fromy*w+fromx];
98
99 /* (by convention) squares do not point to themselves. */
100 if (fromx == tox && fromy == toy) return 0;
101
102 /* the final number points to nothing. */
103 if (state->nums[fromy*w + fromx] == state->n) return 0;
104
105 while (1) {
106 if (!INGRID(state, fromx, fromy)) return 0;
107 if (fromx == tox && fromy == toy) return 1;
108 fromx += dxs[dir]; fromy += dys[dir];
109 }
110 return 0; /* not reached */
111}
112
113static int ispointingi(game_state *state, int fromi, int toi)
114{
115 int w = state->w;
116 return ispointing(state, fromi%w, fromi/w, toi%w, toi/w);
117}
118
119/* Taking the number 'num', work out the gap between it and the next
120 * available number up or down (depending on d). Return 1 if the region
121 * at (x,y) will fit in that gap, or 0 otherwise. */
122static int move_couldfit(game_state *state, int num, int d, int x, int y)
123{
124 int n, gap, i = y*state->w+x, sz;
125
126 assert(d != 0);
127 /* The 'gap' is the number of missing numbers in the grid between
128 * our number and the next one in the sequence (up or down), or
129 * the end of the sequence (if we happen not to have 1/n present) */
130 for (n = num + d, gap = 0;
131 ISREALNUM(state, n) && state->numsi[n] == -1;
132 n += d, gap++) ; /* empty loop */
133
134 if (gap == 0) {
135 /* no gap, so the only allowable move is that that directly
136 * links the two numbers. */
137 n = state->nums[i];
138 return (n == num+d) ? 0 : 1;
139 }
140 if (state->prev[i] == -1 && state->next[i] == -1)
141 return 1; /* single unconnected square, always OK */
142
143 sz = dsf_size(state->dsf, i);
144 return (sz > gap) ? 0 : 1;
145}
146
147static int isvalidmove(game_state *state, int clever,
148 int fromx, int fromy, int tox, int toy)
149{
150 int w = state->w, from = fromy*w+fromx, to = toy*w+tox;
151 int nfrom, nto;
152
153 if (!INGRID(state, fromx, fromy) || !INGRID(state, tox, toy))
154 return 0;
155
156 /* can only move where we point */
157 if (!ispointing(state, fromx, fromy, tox, toy))
158 return 0;
159
160 nfrom = state->nums[from]; nto = state->nums[to];
161
162 /* can't move _from_ the final number, or _to_ the 1. */
163 if (nfrom == state->n || nto == 1)
164 return 0;
165
166 /* can't create a new connection between cells in the same region
167 * as that would create a loop. */
168 if (dsf_canonify(state->dsf, from) == dsf_canonify(state->dsf, to))
169 return 0;
170
171 /* if both cells are actual numbers, can't drag if we're not
172 * one digit apart. */
173 if (ISREALNUM(state, nfrom) && ISREALNUM(state, nto)) {
174 if (nfrom != nto-1)
175 return 0;
176 } else if (clever && ISREALNUM(state, nfrom)) {
177 if (!move_couldfit(state, nfrom, +1, tox, toy))
178 return 0;
179 } else if (clever && ISREALNUM(state, nto)) {
180 if (!move_couldfit(state, nto, -1, fromx, fromy))
181 return 0;
182 }
183
184 return 1;
185}
186
187static void makelink(game_state *state, int from, int to)
188{
189 if (state->next[from] != -1)
190 state->prev[state->next[from]] = -1;
191 state->next[from] = to;
192
193 if (state->prev[to] != -1)
194 state->next[state->prev[to]] = -1;
195 state->prev[to] = from;
196}
197
198static int game_can_format_as_text_now(game_params *params)
199{
200 if (params->w * params->h >= 100) return 0;
201 return 1;
202}
203
204static char *game_text_format(game_state *state)
205{
206 int len = state->h * 2 * (4*state->w + 1) + state->h + 2;
207 int x, y, i, num, n, set;
208 char *ret, *p;
209
210 p = ret = snewn(len, char);
211
212 for (y = 0; y < state->h; y++) {
213 for (x = 0; x < state->h; x++) {
214 i = y*state->w+x;
215 *p++ = dirstrings[state->dirs[i]][0];
216 *p++ = dirstrings[state->dirs[i]][1];
217 *p++ = (state->flags[i] & FLAG_IMMUTABLE) ? 'I' : ' ';
218 *p++ = ' ';
219 }
220 *p++ = '\n';
221 for (x = 0; x < state->h; x++) {
222 i = y*state->w+x;
223 num = state->nums[i];
224 if (num == 0) {
225 *p++ = ' ';
226 *p++ = ' ';
227 *p++ = ' ';
228 } else {
229 n = num % (state->n+1);
230 set = num / (state->n+1);
231
232 assert(n <= 99); /* two digits only! */
233
234 if (set != 0)
235 *p++ = set+'a'-1;
236
237 *p++ = (n >= 10) ? ('0' + (n/10)) : ' ';
238 *p++ = '0' + (n%10);
239
240 if (set == 0)
241 *p++ = ' ';
242 }
243 *p++ = ' ';
244 }
245 *p++ = '\n';
246 *p++ = '\n';
247 }
248 *p++ = '\0';
249
250 return ret;
251}
252
253static void debug_state(const char *desc, game_state *state)
254{
255#ifdef DEBUGGING
256 char *dbg;
257 if (state->n >= 100) {
258 debug(("[ no game_text_format for this size ]"));
259 return;
260 }
261 dbg = game_text_format(state);
262 debug(("%s\n%s", desc, dbg));
263 sfree(dbg);
264#endif
265}
266
267
268static void strip_nums(game_state *state) {
269 int i;
270 for (i = 0; i < state->n; i++) {
271 if (!(state->flags[i] & FLAG_IMMUTABLE))
272 state->nums[i] = 0;
273 }
274 memset(state->next, -1, state->n*sizeof(int));
275 memset(state->prev, -1, state->n*sizeof(int));
276 memset(state->numsi, -1, (state->n+1)*sizeof(int));
277 dsf_init(state->dsf, state->n);
278}
279
280static int check_nums(game_state *orig, game_state *copy, int only_immutable)
281{
282 int i, ret = 1;
283 assert(copy->n == orig->n);
284 for (i = 0; i < copy->n; i++) {
285 if (only_immutable && !copy->flags[i] & FLAG_IMMUTABLE) continue;
286 assert(copy->nums[i] >= 0);
287 assert(copy->nums[i] <= copy->n);
288 if (copy->nums[i] != orig->nums[i]) {
289 debug(("check_nums: (%d,%d) copy=%d, orig=%d.",
290 i%orig->w, i/orig->w, copy->nums[i], orig->nums[i]));
291 ret = 0;
292 }
293 }
294 return ret;
295}
296
297/* --- Game parameter/presets functions --- */
298
299static game_params *default_params(void)
300{
301 game_params *ret = snew(game_params);
302 ret->w = ret->h = 4;
303 ret->force_corner_start = 1;
304
305 return ret;
306}
307
308static const struct game_params signpost_presets[] = {
309 { 4, 4, 1 },
310 { 4, 4, 0 },
311 { 5, 5, 1 },
312 { 5, 5, 0 },
313 { 6, 6, 1 },
314 { 7, 7, 1 }
315};
316
317static int game_fetch_preset(int i, char **name, game_params **params)
318{
319 game_params *ret;
320 char buf[80];
321
322 if (i < 0 || i >= lenof(signpost_presets))
323 return FALSE;
324
325 ret = default_params();
326 *ret = signpost_presets[i];
327 *params = ret;
328
329 sprintf(buf, "%dx%d%s", ret->w, ret->h,
330 ret->force_corner_start ? "" : ", free ends");
331 *name = dupstr(buf);
332
333 return TRUE;
334}
335
336static void free_params(game_params *params)
337{
338 sfree(params);
339}
340
341static game_params *dup_params(game_params *params)
342{
343 game_params *ret = snew(game_params);
344 *ret = *params; /* structure copy */
345 return ret;
346}
347
348static void decode_params(game_params *ret, char const *string)
349{
350 ret->w = ret->h = atoi(string);
351 while (*string && isdigit((unsigned char)*string)) string++;
352 if (*string == 'x') {
353 string++;
354 ret->h = atoi(string);
355 while (*string && isdigit((unsigned char)*string)) string++;
356 }
357 ret->force_corner_start = 0;
358 if (*string == 'c') {
359 string++;
360 ret->force_corner_start = 1;
361 }
362
363}
364
365static char *encode_params(game_params *params, int full)
366{
367 char data[256];
368
369 if (full)
370 sprintf(data, "%dx%d%s", params->w, params->h,
371 params->force_corner_start ? "c" : "");
372 else
373 sprintf(data, "%dx%d", params->w, params->h);
374
375 return dupstr(data);
376}
377
378static config_item *game_configure(game_params *params)
379{
380 config_item *ret;
381 char buf[80];
382
383 ret = snewn(4, config_item);
384
385 ret[0].name = "Width";
386 ret[0].type = C_STRING;
387 sprintf(buf, "%d", params->w);
388 ret[0].sval = dupstr(buf);
389 ret[0].ival = 0;
390
391 ret[1].name = "Height";
392 ret[1].type = C_STRING;
393 sprintf(buf, "%d", params->h);
394 ret[1].sval = dupstr(buf);
395 ret[1].ival = 0;
396
397 ret[2].name = "Start and end in corners";
398 ret[2].type = C_BOOLEAN;
399 ret[2].sval = NULL;
400 ret[2].ival = params->force_corner_start;
401
402 ret[3].name = NULL;
403 ret[3].type = C_END;
404 ret[3].sval = NULL;
405 ret[3].ival = 0;
406
407 return ret;
408}
409
410static game_params *custom_params(config_item *cfg)
411{
412 game_params *ret = snew(game_params);
413
414 ret->w = atoi(cfg[0].sval);
415 ret->h = atoi(cfg[1].sval);
416 ret->force_corner_start = cfg[2].ival;
417
418 return ret;
419}
420
421static char *validate_params(game_params *params, int full)
422{
423 if (params->w < 2 || params->h < 2)
424 return "Width and height must both be at least two";
425
426 return NULL;
427}
428
429/* --- Game description string generation and unpicking --- */
430
431static void blank_game_into(game_state *state)
432{
433 memset(state->dirs, 0, state->n*sizeof(int));
434 memset(state->nums, 0, state->n*sizeof(int));
435 memset(state->flags, 0, state->n*sizeof(unsigned int));
436 memset(state->next, -1, state->n*sizeof(int));
437 memset(state->prev, -1, state->n*sizeof(int));
438 memset(state->numsi, -1, (state->n+1)*sizeof(int));
439}
440
441static game_state *blank_game(int w, int h)
442{
443 game_state *state = snew(game_state);
444
445 memset(state, 0, sizeof(game_state));
446 state->w = w;
447 state->h = h;
448 state->n = w*h;
449
450 state->dirs = snewn(state->n, int);
451 state->nums = snewn(state->n, int);
452 state->flags = snewn(state->n, unsigned int);
453 state->next = snewn(state->n, int);
454 state->prev = snewn(state->n, int);
455 state->dsf = snew_dsf(state->n);
456 state->numsi = snewn(state->n+1, int);
457
458 blank_game_into(state);
459
460 return state;
461}
462
463static void dup_game_to(game_state *to, game_state *from)
464{
465 to->completed = from->completed;
466 to->used_solve = from->used_solve;
467 to->impossible = from->impossible;
468
469 memcpy(to->dirs, from->dirs, to->n*sizeof(int));
470 memcpy(to->flags, from->flags, to->n*sizeof(unsigned int));
471 memcpy(to->nums, from->nums, to->n*sizeof(int));
472
473 memcpy(to->next, from->next, to->n*sizeof(int));
474 memcpy(to->prev, from->prev, to->n*sizeof(int));
475
476 memcpy(to->dsf, from->dsf, to->n*sizeof(int));
477 memcpy(to->numsi, from->numsi, (to->n+1)*sizeof(int));
478}
479
480static game_state *dup_game(game_state *state)
481{
482 game_state *ret = blank_game(state->w, state->h);
483 dup_game_to(ret, state);
484 return ret;
485}
486
487static void free_game(game_state *state)
488{
489 sfree(state->dirs);
490 sfree(state->nums);
491 sfree(state->flags);
492 sfree(state->next);
493 sfree(state->prev);
494 sfree(state->dsf);
495 sfree(state->numsi);
496 sfree(state);
497}
498
499static void unpick_desc(game_params *params, char *desc,
500 game_state **sout, char **mout)
501{
502 game_state *state = blank_game(params->w, params->h);
503 char *msg = NULL, c;
504 int num = 0, i = 0;
505
506 while (*desc) {
507 if (i >= state->n) {
508 msg = "Game description longer than expected";
509 goto done;
510 }
511
512 c = *desc;
513 if (isdigit(c)) {
514 num = (num*10) + (int)(c-'0');
515 if (num > state->n) {
516 msg = "Number too large";
517 goto done;
518 }
519 } else if ((c-'a') >= 0 && (c-'a') < DIR_MAX) {
520 state->nums[i] = num;
521 state->flags[i] = num ? FLAG_IMMUTABLE : 0;
522 num = 0;
523
524 state->dirs[i] = c - 'a';
525 i++;
526 } else if (!*desc) {
527 msg = "Game description shorter than expected";
528 goto done;
529 } else {
530 msg = "Game description contains unexpected characters";
531 goto done;
532 }
533 desc++;
534 }
535 if (i < state->n) {
536 msg = "Game description shorter than expected";
537 goto done;
538 }
539
540done:
541 if (msg) { /* sth went wrong. */
542 if (mout) *mout = msg;
543 free_game(state);
544 } else {
545 if (mout) *mout = NULL;
546 if (sout) *sout = state;
547 else free_game(state);
548 }
549}
550
551static char *generate_desc(game_state *state, int issolve)
552{
553 char *ret, buf[80];
554 int retlen, i, k;
555
556 ret = NULL; retlen = 0;
557 if (issolve) {
558 ret = sresize(ret, 2, char);
559 ret[0] = 'S'; ret[1] = '\0';
560 retlen += 1;
561 }
562 for (i = 0; i < state->n; i++) {
563 if (state->nums[i])
564 k = sprintf(buf, "%d%c", state->nums[i], (int)(state->dirs[i]+'a'));
565 else
566 k = sprintf(buf, "%c", (int)(state->dirs[i]+'a'));
567 ret = sresize(ret, retlen + k + 1, char);
568 strcpy(ret + retlen, buf);
569 retlen += k;
570 }
571 return ret;
572}
573
574/* --- Game generation --- */
575
576/* Fills in preallocated arrays ai (indices) and ad (directions)
577 * showing all non-numbered cells adjacent to index i, returns length */
578/* This function has been somewhat optimised... */
579static int cell_adj(game_state *state, int i, int *ai, int *ad)
580{
581 int n = 0, a, x, y, sx, sy, dx, dy, newi;
582 int w = state->w, h = state->h;
583
584 sx = i % w; sy = i / w;
585
586 for (a = 0; a < DIR_MAX; a++) {
587 x = sx; y = sy;
588 dx = dxs[a]; dy = dys[a];
589 while (1) {
590 x += dx; y += dy;
591 if (x < 0 || y < 0 || x >= w || y >= h) break;
592
593 newi = y*w + x;
594 if (state->nums[newi] == 0) {
595 ai[n] = newi;
596 ad[n] = a;
597 n++;
598 }
599 }
600 }
601 return n;
602}
603
604static int new_game_fill(game_state *state, random_state *rs,
605 int headi, int taili)
606{
607 int nfilled, an, ret = 0, j;
608 int *aidx, *adir;
609
610 aidx = snewn(state->n, int);
611 adir = snewn(state->n, int);
612
613 debug(("new_game_fill: headi=%d, taili=%d.", headi, taili));
614
615 memset(state->nums, 0, state->n*sizeof(int));
616
617 state->nums[headi] = 1;
618 state->nums[taili] = state->n;
619
620 state->dirs[taili] = 0;
621 nfilled = 2;
622
623 while (nfilled < state->n) {
624 /* Try and expand _from_ headi; keep going if there's only one
625 * place to go to. */
626 an = cell_adj(state, headi, aidx, adir);
627 do {
628 if (an == 0) goto done;
629 j = random_upto(rs, an);
630 state->dirs[headi] = adir[j];
631 state->nums[aidx[j]] = state->nums[headi] + 1;
632 nfilled++;
633 headi = aidx[j];
634 an = cell_adj(state, headi, aidx, adir);
635 } while (an == 1);
636
637 /* Try and expand _to_ taili; keep going if there's only one
638 * place to go to. */
639 an = cell_adj(state, taili, aidx, adir);
640 do {
641 if (an == 0) goto done;
642 j = random_upto(rs, an);
643 state->dirs[aidx[j]] = DIR_OPPOSITE(adir[j]);
644 state->nums[aidx[j]] = state->nums[taili] - 1;
645 nfilled++;
646 taili = aidx[j];
647 an = cell_adj(state, taili, aidx, adir);
648 } while (an == 1);
649 }
650 /* If we get here we have headi and taili set but unconnected
651 * by direction: we need to set headi's direction so as to point
652 * at taili. */
653 state->dirs[headi] = whichdiri(state, headi, taili);
654
655 /* it could happen that our last two weren't in line; if that's the
656 * case, we have to start again. */
657 if (state->dirs[headi] != -1) ret = 1;
658
659done:
660 sfree(aidx);
661 sfree(adir);
662 return ret;
663}
664
665/* Better generator: with the 'generate, sprinkle numbers, solve,
666 * repeat' algorithm we're _never_ generating anything greater than
667 * 6x6, and spending all of our time in new_game_fill (and very little
668 * in solve_state).
669 *
670 * So, new generator steps:
671 * generate the grid, at random (same as now). Numbers 1 and N get
672 immutable flag immediately.
673 * squirrel that away for the solved state.
674 *
675 * (solve:) Try and solve it.
676 * If we solved it, we're done:
677 * generate the description from current immutable numbers,
678 * free stuff that needs freeing,
679 * return description + solved state.
680 * If we didn't solve it:
681 * count #tiles in state we've made deductions about.
682 * while (1):
683 * randomise a scratch array.
684 * for each index in scratch (in turn):
685 * if the cell isn't empty, continue (through scratch array)
686 * set number + immutable in state.
687 * try and solve state.
688 * if we've solved it, we're done.
689 * otherwise, count #tiles. If it's more than we had before:
690 * good, break from this loop and re-randomise.
691 * otherwise (number didn't help):
692 * remove number and try next in scratch array.
693 * if we've got to the end of the scratch array, no luck:
694 free everything we need to, and go back to regenerate the grid.
695 */
696
697static int solve_state(game_state *state);
698
699static void debug_desc(const char *what, game_state *state)
700{
701#if DEBUGGING
702 {
703 char *desc = generate_desc(state, 0);
704 debug(("%s game state: %dx%d:%s", what, state->w, state->h, desc));
705 sfree(desc);
706 }
707#endif
708}
709
710/* Expects a fully-numbered game_state on input, and makes sure
711 * FLAG_IMMUTABLE is only set on those numbers we need to solve
712 * (as for a real new-game); returns 1 if it managed
713 * this (such that it could solve it), or 0 if not. */
714static int new_game_strip(game_state *state, random_state *rs)
715{
716 int *scratch, i, j, ret = 1;
717 game_state *copy = dup_game(state);
718
719 debug(("new_game_strip."));
720
721 strip_nums(copy);
722 debug_desc("Stripped", copy);
723
724 if (solve_state(copy) > 0) {
725 debug(("new_game_strip: soluble immediately after strip."));
726 free_game(copy);
727 return 1;
728 }
729
730 scratch = snewn(state->n, int);
731 for (i = 0; i < state->n; i++) scratch[i] = i;
732 shuffle(scratch, state->n, sizeof(int), rs);
733
734 /* This is scungy. It might just be quick enough.
735 * It goes through, adding set numbers in empty squares
736 * until either we run out of empty squares (in the one
737 * we're half-solving) or else we solve it properly.
738 * NB that we run the entire solver each time, which
739 * strips the grid beforehand; we will save time if we
740 * avoid that. */
741 for (i = 0; i < state->n; i++) {
742 j = scratch[i];
743 if (copy->nums[j] > 0 && copy->nums[j] <= state->n)
744 continue; /* already solved to a real number here. */
745 assert(state->nums[j] <= state->n);
746 debug(("new_game_strip: testing add IMMUTABLE number %d at square (%d,%d).",
747 state->nums[j], j%state->w, j/state->w));
748 copy->nums[j] = state->nums[j];
749 copy->flags[j] |= FLAG_IMMUTABLE;
750 state->flags[j] |= FLAG_IMMUTABLE;
751 debug_state("Copy of state: ", copy);
752 if (solve_state(copy) > 0) goto solved;
753 assert(check_nums(state, copy, 1));
754 }
755 ret = 0;
756 goto done;
757
758solved:
759 debug(("new_game_strip: now solved."));
760 /* Since we added basically at random, try now to remove numbers
761 * and see if we can still solve it; if we can (still), really
762 * remove the number. Make sure we don't remove the anchor numbers
763 * 1 and N. */
764 for (i = 0; i < state->n; i++) {
765 j = scratch[i];
766 if ((state->flags[j] & FLAG_IMMUTABLE) &&
767 (state->nums[j] != 1 && state->nums[j] != state->n)) {
768 debug(("new_game_strip: testing remove IMMUTABLE number %d at square (%d,%d).",
769 state->nums[j], j%state->w, j/state->w));
770 state->flags[j] &= ~FLAG_IMMUTABLE;
771 dup_game_to(copy, state);
772 strip_nums(copy);
773 if (solve_state(copy) > 0) {
774 assert(check_nums(state, copy, 0));
775 debug(("new_game_strip: OK, removing number"));
776 } else {
777 assert(state->nums[j] <= state->n);
778 debug(("new_game_strip: cannot solve, putting IMMUTABLE back."));
779 copy->nums[j] = state->nums[j];
780 state->flags[j] |= FLAG_IMMUTABLE;
781 }
782 }
783 }
784
785done:
786 debug(("new_game_strip: %ssuccessful.", ret ? "" : "not "));
787 sfree(scratch);
788 free_game(copy);
789 return ret;
790}
791
792static char *new_game_desc(game_params *params, random_state *rs,
793 char **aux, int interactive)
794{
795 game_state *state = blank_game(params->w, params->h);
796 char *ret;
797 int headi, taili;
798
799generate:
800 blank_game_into(state);
801
802 /* keep trying until we fill successfully. */
803 do {
804 if (params->force_corner_start) {
805 headi = 0;
806 taili = state->n-1;
807 } else {
808 do {
809 headi = random_upto(rs, state->n);
810 taili = random_upto(rs, state->n);
811 } while (headi == taili);
812 }
813 } while (!new_game_fill(state, rs, headi, taili));
814
815 debug_state("Filled game:", state);
816
817 assert(state->nums[headi] <= state->n);
818 assert(state->nums[taili] <= state->n);
819
820 state->flags[headi] |= FLAG_IMMUTABLE;
821 state->flags[taili] |= FLAG_IMMUTABLE;
822
823 /* This will have filled in directions and _all_ numbers.
824 * Store the game definition for this, as the solved-state. */
825 if (!new_game_strip(state, rs)) {
826 goto generate;
827 }
828 strip_nums(state);
829 {
830 game_state *tosolve = dup_game(state);
831 assert(solve_state(tosolve) > 0);
832 free_game(tosolve);
833 }
834 ret = generate_desc(state, 0);
835 free_game(state);
836 return ret;
837}
838
839static char *validate_desc(game_params *params, char *desc)
840{
841 char *ret = NULL;
842
843 unpick_desc(params, desc, NULL, &ret);
844 return ret;
845}
846
847/* --- Linked-list and numbers array --- */
848
849/* Assuming numbers are always up-to-date, there are only four possibilities
850 * for regions changing:
851 *
852 * 1) two differently-coloured regions being combined (the resulting colouring
853 * should be based on the larger of the two regions)
854 * 2) a numbered region having a single number added to the start (the
855 * region's colour will remain, and the numbers will shift by 1)
856 * 3) a numbered region having a single number added to the end (the
857 * region's colour and numbering remains as-is)
858 * 4) two unnumbered squares being joined (will pick the smallest unused set
859 * of colours to use for the new region).
860 *
861 * There should never be any complications with regions containing 3 colours
862 * being combined, since two of those colours should have been merged on a
863 * previous move.
864 */
865
866/* New algorithm for working out numbering:
867 *
868 * At start, only remove numbers from cells with neither prev nor next.
869 * Search for all cells with !prev && next (head of chain); for each one:
870 * Search the group for a 'real' number: if we find one the num. for
871 the head of the chain is trivial.
872 * Otherwise, if we _don't_ have a number already:
873 * If head->next has a number, that number is the one we should use
874 * Otherwise pick the smallest unused colour set.
875 * and if we _do_ have a number already:
876 * Work out the size of this group (the dsf must already have been set up)
877 * Start enumerating through the group counting squares that have the
878 same colouring as us
879 * If we reach a square with a different colour, work out which set is
880 bigger (ncol1 vs ncol2 == sz-ncol1), and use that colour
881 * If we reached a square with no colour (or the end of the group, which
882 would be weird under the circumstances) just keep the existing colour.
883 */
884
885#define COLOUR(a) ((a) / (state->n+1))
886#define START(c) ((c) * (state->n+1))
887
888static int lowest_start(game_state *state, int *scratch)
889{
890 int i, c;
891
892 /* Fill in 'scratch' array with the currently-used colours... */
893 memset(scratch, 0, state->n * sizeof(int));
894 for (i = 0; i < state->n; i++) {
895 if (state->nums[i] != 0)
896 scratch[COLOUR(state->nums[i])] = 1;
897 }
898 /* ... and return the first one that was unused. */
899 for (c = 1; c < state->n; c++) { /* NB start at 1 */
900 if (scratch[c] == 0)
901 return START(c);
902 }
903 assert(!"shouldn't get here");
904 return -1; /* suyb */
905}
906
907static int used_colour(game_state *state, int i, int start)
908{
909 int j;
910 for (j = 0; j < i; j++) {
911 if (state->nums[j] == start)
912 return 1;
913 }
914 return 0;
915}
916
917static int head_number(game_state *state, int i, int *scratch)
918{
919 int off = 0, start = -1, ss, j = i, c, n, sz;
920 const char *why = NULL;
921
922 assert(state->prev[i] == -1 && state->next[i] != -1);
923
924 /* Search through this chain looking for real numbers, checking that
925 * they match up (if there are more than one). */
926 while (j != -1) {
927 if (state->flags[j] & FLAG_IMMUTABLE) {
928 ss = state->nums[j] - off;
929 if (start == -1) {
930 start = ss;
931 why = "contains cell with immutable number";
932 } else if (start != ss) {
933 debug(("head_number: chain with non-sequential numbers."));
934 state->impossible = 1;
935 }
936 }
937 off++;
938 j = state->next[j];
939 assert(j != i); /* we have created a loop, obviously wrong */
940 }
941 if (start != -1) goto found;
942
943 if (state->nums[i] == 0) {
944 if (state->nums[state->next[i]] != 0) {
945 /* make sure we start at a 0 offset. */
946 start = START(COLOUR(state->nums[state->next[i]]));
947 why = "adding blank cell to head of numbered region";
948 } else {
949 start = lowest_start(state, scratch);
950 why = "lowest available colour group";
951 }
952 } else {
953 c = COLOUR(state->nums[i]);
954 n = 1;
955 sz = dsf_size(state->dsf, i);
956 j = i;
957 while (state->next[j] != -1) {
958 j = state->next[j];
959 if (state->nums[j] == 0) {
960 start = START(c);
961 why = "adding blank cell to end of numbered region";
962 break;
963 }
964 if (COLOUR(state->nums[j]) == c)
965 n++;
966 else {
967 int start_alternate = START(COLOUR(state->nums[j]));
968 if (n < (sz - n) && !used_colour(state, i, start_alternate)) {
969 start = start_alternate;
970 why = "joining two coloured regions, swapping to larger colour";
971 } else {
972 start = START(c);
973 why = "joining two coloured regions, taking largest";
974 }
975 break;
976 }
977 }
978 /* If we got here then we may have split a region into
979 * two; make sure we don't assign a colour we've already used. */
980 if (start == -1) {
981 start = (c == 0) ? lowest_start(state, scratch) : START(c);
982 why = "got to end of coloured region";
983 }
984 if (used_colour(state, i, start)) {
985 start = lowest_start(state, scratch);
986 why = "split region in two, lowest available colour group";
987 }
988 }
989
990found:
991 assert(start != -1 && why != NULL);
992 debug(("Chain at (%d,%d) numbered at %d: %s.",
993 i%state->w, i/state->w, start, why));
994 return start;
995}
996
997#if 0
998static void debug_numbers(game_state *state)
999{
1000 int i, w=state->w;
1001
1002 for (i = 0; i < state->n; i++) {
1003 debug(("(%d,%d) --> (%d,%d) --> (%d,%d)",
1004 state->prev[i]==-1 ? -1 : state->prev[i]%w,
1005 state->prev[i]==-1 ? -1 : state->prev[i]/w,
1006 i%w, i/w,
1007 state->next[i]==-1 ? -1 : state->next[i]%w,
1008 state->next[i]==-1 ? -1 : state->next[i]/w));
1009 }
1010 w = w+1;
1011}
1012#endif
1013
1014static void connect_numbers(game_state *state)
1015{
1016 int i, di, dni;
1017
1018 dsf_init(state->dsf, state->n);
1019 for (i = 0; i < state->n; i++) {
1020 if (state->next[i] != -1) {
1021 assert(state->prev[state->next[i]] == i);
1022 di = dsf_canonify(state->dsf, i);
1023 dni = dsf_canonify(state->dsf, state->next[i]);
1024 if (di == dni) {
1025 debug(("connect_numbers: chain forms a loop."));
1026 state->impossible = 1;
1027 }
1028 dsf_merge(state->dsf, di, dni);
1029 }
1030 }
1031}
1032
1033static void update_numbers(game_state *state)
1034{
1035 int i, j, nnum;
1036 int *scratch = snewn(state->n, int);
1037
1038 for (i = 0; i < state->n; i++) {
1039 assert(state->nums[i] >= 0);
1040 state->numsi[i] = -1;
1041 }
1042
1043 for (i = 0; i < state->n; i++) {
1044 if (state->flags[i] & FLAG_IMMUTABLE) {
1045 assert(state->nums[i] >= 0);
1046 assert(state->nums[i] <= state->n);
1047 state->numsi[state->nums[i]] = i;
1048 }
1049 else if (state->prev[i] == -1 && state->next[i] == -1)
1050 state->nums[i] = 0;
1051 }
1052 connect_numbers(state);
1053
1054 for (i = 0; i < state->n; i++) {
1055 /* Look for a cell that is the start of a chain
1056 * (has a next but no prev). */
1057 if (state->prev[i] != -1 || state->next[i] == -1) continue;
1058
1059 nnum = head_number(state, i, scratch);
1060 j = i;
1061 while (j != -1) {
1062 if (nnum > 0 && nnum <= state->n)
1063 state->numsi[nnum] = j;
1064 state->nums[j] = nnum++;
1065 j = state->next[j];
1066 assert(j != i); /* loop?! */
1067 }
1068 }
1069 /*debug_numbers(state);*/
1070 sfree(scratch);
1071}
1072
1073static int check_completion(game_state *state, int mark_errors)
1074{
1075 int n, j, k, error = 0, complete;
1076
1077 /* NB This only marks errors that are possible to perpetrate with
1078 * the current UI in interpret_move. Things like forming loops in
1079 * linked sections and having numbers not add up should be forbidden
1080 * by the code elsewhere, so we don't bother marking those (because
1081 * it would add lots of tricky drawing code for very little gain). */
1082 if (mark_errors) {
1083 for (j = 0; j < state->n; j++)
1084 state->flags[j] &= ~FLAG_ERROR;
1085 }
1086
1087 /* Search for repeated numbers. */
1088 for (j = 0; j < state->n; j++) {
1089 if (state->nums[j] > 0 && state->nums[j] <= state->n) {
1090 for (k = j+1; k < state->n; k++) {
1091 if (state->nums[k] == state->nums[j]) {
1092 if (mark_errors) {
1093 state->flags[j] |= FLAG_ERROR;
1094 state->flags[k] |= FLAG_ERROR;
1095 }
1096 error = 1;
1097 }
1098 }
1099 }
1100 }
1101
1102 /* Search and mark numbers n not pointing to n+1; if any numbers
1103 * are missing we know we've not completed. */
1104 complete = 1;
1105 for (n = 1; n < state->n; n++) {
1106 if (state->numsi[n] == -1 || state->numsi[n+1] == -1)
1107 complete = 0;
1108 else if (!ispointingi(state, state->numsi[n], state->numsi[n+1])) {
1109 if (mark_errors) {
1110 state->flags[state->numsi[n]] |= FLAG_ERROR;
1111 state->flags[state->numsi[n+1]] |= FLAG_ERROR;
1112 }
1113 error = 1;
1114 } else {
1115 /* make sure the link is explicitly made here; for instance, this
1116 * is nice if the user drags from 2 out (making 3) and a 4 is also
1117 * visible; this ensures that the link from 3 to 4 is also made. */
1118 if (mark_errors)
1119 makelink(state, state->numsi[n], state->numsi[n+1]);
1120 }
1121 }
1122
1123 if (error) return 0;
1124 return complete;
1125}
1126static game_state *new_game(midend *me, game_params *params, char *desc)
1127{
1128 game_state *state = NULL;
1129
1130 unpick_desc(params, desc, &state, NULL);
1131 if (!state) assert(!"new_game failed to unpick");
1132
1133 update_numbers(state);
1134 check_completion(state, 1); /* update any auto-links */
1135
1136 return state;
1137}
1138
1139/* --- Solver --- */
1140
1141/* If a tile has a single tile it can link _to_, or there's only a single
1142 * location that can link to a given tile, fill that link in. */
1143static int solve_single(game_state *state, game_state *copy, int *from)
1144{
1145 int i, j, sx, sy, x, y, d, poss, w=state->w, nlinks = 0;
1146
1147 /* The from array is a list of 'which square can link _to_ us';
1148 * we start off with from as '-1' (meaning 'not found'); if we find
1149 * something that can link to us it is set to that index, and then if
1150 * we find another we set it to -2. */
1151
1152 memset(from, -1, state->n*sizeof(int));
1153
1154 /* poss is 'can I link to anything' with the same meanings. */
1155
1156 for (i = 0; i < state->n; i++) {
1157 if (state->next[i] != -1) continue;
1158 if (state->nums[i] == state->n) continue; /* no next from last no. */
1159
1160 d = state->dirs[i];
1161 poss = -1;
1162 sx = x = i%w; sy = y = i/w;
1163 while (1) {
1164 x += dxs[d]; y += dys[d];
1165 if (!INGRID(state, x, y)) break;
1166 if (!isvalidmove(state, 1, sx, sy, x, y)) continue;
1167
1168 /* can't link to somewhere with a back-link we would have to
1169 * break (the solver just doesn't work like this). */
1170 j = y*w+x;
1171 if (state->prev[j] != -1) continue;
1172
1173 if (state->nums[i] > 0 && state->nums[j] > 0 &&
1174 state->nums[i] <= state->n && state->nums[j] <= state->n &&
1175 state->nums[j] == state->nums[i]+1) {
1176 debug(("Solver: forcing link through existing consecutive numbers."));
1177 poss = j;
1178 from[j] = i;
1179 break;
1180 }
1181
1182 /* if there's been a valid move already, we have to move on;
1183 * we can't make any deductions here. */
1184 poss = (poss == -1) ? j : -2;
1185
1186 /* Modify the from array as described above (which is enumerating
1187 * what points to 'j' in a similar way). */
1188 from[j] = (from[j] == -1) ? i : -2;
1189 }
1190 if (poss == -2) {
1191 /*debug(("Solver: (%d,%d) has multiple possible next squares.", sx, sy));*/
1192 ;
1193 } else if (poss == -1) {
1194 debug(("Solver: nowhere possible for (%d,%d) to link to.", sx, sy));
1195 copy->impossible = 1;
1196 return -1;
1197 } else {
1198 debug(("Solver: linking (%d,%d) to only possible next (%d,%d).",
1199 sx, sy, poss%w, poss/w));
1200 makelink(copy, i, poss);
1201 nlinks++;
1202 }
1203 }
1204
1205 for (i = 0; i < state->n; i++) {
1206 if (state->prev[i] != -1) continue;
1207 if (state->nums[i] == 1) continue; /* no prev from 1st no. */
1208
1209 x = i%w; y = i/w;
1210 if (from[i] == -1) {
1211 debug(("Solver: nowhere possible to link to (%d,%d)", x, y));
1212 copy->impossible = 1;
1213 return -1;
1214 } else if (from[i] == -2) {
1215 /*debug(("Solver: (%d,%d) has multiple possible prev squares.", x, y));*/
1216 ;
1217 } else {
1218 debug(("Solver: linking only possible prev (%d,%d) to (%d,%d).",
1219 from[i]%w, from[i]/w, x, y));
1220 makelink(copy, from[i], i);
1221 nlinks++;
1222 }
1223 }
1224
1225 return nlinks;
1226}
1227
1228/* Returns 1 if we managed to solve it, 0 otherwise. */
1229static int solve_state(game_state *state)
1230{
1231 game_state *copy = dup_game(state);
1232 int *scratch = snewn(state->n, int), ret;
1233
1234 debug_state("Before solver: ", state);
1235
1236 while (1) {
1237 update_numbers(state);
1238
1239 if (solve_single(state, copy, scratch)) {
1240 dup_game_to(state, copy);
1241 if (state->impossible) break; else continue;
1242 }
1243 break;
1244 }
1245 free_game(copy);
1246 sfree(scratch);
1247
1248 update_numbers(state);
1249 ret = state->impossible ? -1 : check_completion(state, 0);
1250 debug(("Solver finished: %s",
1251 ret < 0 ? "impossible" : ret > 0 ? "solved" : "not solved"));
1252 debug_state("After solver: ", state);
1253 return ret;
1254}
1255
1256static char *solve_game(game_state *state, game_state *currstate,
1257 char *aux, char **error)
1258{
1259 game_state *tosolve;
1260 char *ret = NULL;
1261 int result;
1262
1263 tosolve = dup_game(currstate);
1264 result = solve_state(tosolve);
1265 if (result > 0)
1266 ret = generate_desc(tosolve, 1);
1267 free_game(tosolve);
1268 if (ret) return ret;
1269
1270 tosolve = dup_game(state);
1271 result = solve_state(tosolve);
1272 if (result < 0)
1273 *error = "Puzzle is impossible.";
1274 else if (result == 0)
1275 *error = "Unable to solve puzzle.";
1276 else
1277 ret = generate_desc(tosolve, 1);
1278
1279 free_game(tosolve);
1280
1281 return ret;
1282}
1283
1284/* --- UI and move routines. --- */
1285
1286
1287struct game_ui {
1288 int cx, cy, cshow;
1289
1290 int dragging, drag_is_from;
1291 int sx, sy; /* grid coords of start cell */
1292 int dx, dy; /* pixel coords of drag posn */
1293};
1294
1295static game_ui *new_ui(game_state *state)
1296{
1297 game_ui *ui = snew(game_ui);
1298
1299 /* NB: if this is ever changed to as to require more than a structure
1300 * copy to clone, there's code that needs fixing in game_redraw too. */
1301
1302 ui->cx = ui->cy = ui->cshow = 0;
1303
1304 ui->dragging = 0;
1305 ui->sx = ui->sy = ui->dx = ui->dy = 0;
1306
1307 return ui;
1308}
1309
1310static void free_ui(game_ui *ui)
1311{
1312 sfree(ui);
1313}
1314
1315static char *encode_ui(game_ui *ui)
1316{
1317 return NULL;
1318}
1319
1320static void decode_ui(game_ui *ui, char *encoding)
1321{
1322}
1323
1324static void game_changed_state(game_ui *ui, game_state *oldstate,
1325 game_state *newstate)
1326{
1327 if (!oldstate->completed && newstate->completed)
1328 ui->cshow = ui->dragging = 0;
1329}
1330
1331struct game_drawstate {
1332 int tilesize, started, solved;
1333 int w, h, n;
1334 int *nums, *dirp;
1335 unsigned int *f;
1336 double angle_offset;
1337
1338 int dragging, dx, dy;
1339 blitter *dragb;
1340};
1341
1342static char *interpret_move(game_state *state, game_ui *ui, game_drawstate *ds,
1343 int mx, int my, int button)
1344{
1345 int x = FROMCOORD(mx), y = FROMCOORD(my), w = state->w;
1346 char buf[80];
1347
1348 if (IS_CURSOR_MOVE(button)) {
1349 move_cursor(button, &ui->cx, &ui->cy, state->w, state->h, 0);
1350 ui->cshow = 1;
1351 if (ui->dragging) {
1352 ui->dx = COORD(ui->cx) + TILE_SIZE/2;
1353 ui->dy = COORD(ui->cy) + TILE_SIZE/2;
1354 }
1355 return "";
1356 } else if (IS_CURSOR_SELECT(button)) {
1357 if (!ui->cshow)
1358 ui->cshow = 1;
1359 else if (ui->dragging) {
1360 ui->dragging = FALSE;
1361 if (ui->sx == ui->cx && ui->sy == ui->cy) return "";
1362 if (ui->drag_is_from) {
1363 if (!isvalidmove(state, 0, ui->sx, ui->sy, ui->cx, ui->cy)) return "";
1364 sprintf(buf, "L%d,%d-%d,%d", ui->sx, ui->sy, ui->cx, ui->cy);
1365 } else {
1366 if (!isvalidmove(state, 0, ui->cx, ui->cy, ui->sx, ui->sy)) return "";
1367 sprintf(buf, "L%d,%d-%d,%d", ui->cx, ui->cy, ui->sx, ui->sy);
1368 }
1369 return dupstr(buf);
1370 } else {
1371 ui->dragging = TRUE;
1372 ui->sx = ui->cx;
1373 ui->sy = ui->cy;
1374 ui->dx = COORD(ui->cx) + TILE_SIZE/2;
1375 ui->dy = COORD(ui->cy) + TILE_SIZE/2;
1376 ui->drag_is_from = (button == CURSOR_SELECT) ? 1 : 0;
1377 }
1378 return "";
1379 }
1380 if (IS_MOUSE_DOWN(button)) {
1381 if (ui->cshow) {
1382 ui->cshow = ui->dragging = 0;
1383 }
1384 assert(!ui->dragging);
1385 if (!INGRID(state, x, y)) return NULL;
1386
1387 if (button == LEFT_BUTTON) {
1388 /* disallow dragging from the final number. */
1389 if (state->nums[y*w+x] == state->n) return NULL;
1390 } else if (button == RIGHT_BUTTON) {
1391 /* disallow dragging to the first number. */
1392 if (state->nums[y*w+x] == 1) return NULL;
1393 }
1394
1395 ui->dragging = TRUE;
1396 ui->drag_is_from = (button == LEFT_BUTTON) ? 1 : 0;
1397 ui->sx = x;
1398 ui->sy = y;
1399 ui->dx = mx;
1400 ui->dy = my;
1401 ui->cshow = 0;
1402 return "";
1403 } else if (IS_MOUSE_DRAG(button) && ui->dragging) {
1404 ui->dx = mx;
1405 ui->dy = my;
1406 return "";
1407 } else if (IS_MOUSE_RELEASE(button) && ui->dragging) {
1408 ui->dragging = FALSE;
1409 if (ui->sx == x && ui->sy == y) return ""; /* single click */
1410
1411 if (!INGRID(state, x, y)) {
1412 int si = ui->sy*w+ui->sx;
1413 if (state->prev[si] == -1 && state->next[si] == -1)
1414 return "";
1415 sprintf(buf, "%c%d,%d",
1416 ui->drag_is_from ? 'C' : 'X', ui->sx, ui->sy);
1417 return dupstr(buf);
1418 }
1419
1420 if (ui->drag_is_from) {
1421 if (!isvalidmove(state, 0, ui->sx, ui->sy, x, y)) return "";
1422 sprintf(buf, "L%d,%d-%d,%d", ui->sx, ui->sy, x, y);
1423 } else {
1424 if (!isvalidmove(state, 0, x, y, ui->sx, ui->sy)) return "";
1425 sprintf(buf, "L%d,%d-%d,%d", x, y, ui->sx, ui->sy);
1426 }
1427 return dupstr(buf);
1428 } /* else if (button == 'H' || button == 'h')
1429 return dupstr("H"); */
1430 else if ((button == 'x' || button == 'X') && ui->cshow) {
1431 int si = ui->cy*w + ui->cx;
1432 if (state->prev[si] == -1 && state->next[si] == -1)
1433 return "";
1434 sprintf(buf, "%c%d,%d",
1435 (button == 'x') ? 'C' : 'X', ui->cx, ui->cy);
1436 return dupstr(buf);
1437 }
1438
1439 return NULL;
1440}
1441
1442static void unlink_cell(game_state *state, int si)
1443{
1444 debug(("Unlinking (%d,%d).", si%state->w, si/state->w));
1445 if (state->prev[si] != -1) {
1446 debug((" ... removing prev link from (%d,%d).",
1447 state->prev[si]%state->w, state->prev[si]/state->w));
1448 state->next[state->prev[si]] = -1;
1449 state->prev[si] = -1;
1450 }
1451 if (state->next[si] != -1) {
1452 debug((" ... removing next link to (%d,%d).",
1453 state->next[si]%state->w, state->next[si]/state->w));
1454 state->prev[state->next[si]] = -1;
1455 state->next[si] = -1;
1456 }
1457}
1458
1459static game_state *execute_move(game_state *state, char *move)
1460{
1461 game_state *ret = NULL;
1462 int sx, sy, ex, ey, si, ei, w = state->w;
1463 char c;
1464
1465 debug(("move: %s", move));
1466
1467 if (move[0] == 'S') {
1468 game_params p;
1469 game_state *tmp;
1470 char *valid;
1471 int i;
1472
1473 p.w = state->w; p.h = state->h;
1474 valid = validate_desc(&p, move+1);
1475 if (valid) {
1476 debug(("execute_move: move not valid: %s", valid));
1477 return NULL;
1478 }
1479 ret = dup_game(state);
1480 tmp = new_game(NULL, &p, move+1);
1481 for (i = 0; i < state->n; i++) {
1482 ret->prev[i] = tmp->prev[i];
1483 ret->next[i] = tmp->next[i];
1484 }
1485 free_game(tmp);
1486 ret->used_solve = 1;
1487 } else if (sscanf(move, "L%d,%d-%d,%d", &sx, &sy, &ex, &ey) == 4) {
1488 if (!isvalidmove(state, 0, sx, sy, ex, ey)) return NULL;
1489
1490 ret = dup_game(state);
1491
1492 si = sy*w+sx; ei = ey*w+ex;
1493 makelink(ret, si, ei);
1494 } else if (sscanf(move, "%c%d,%d", &c, &sx, &sy) == 3) {
1495 if (c != 'C' && c != 'X') return NULL;
1496 if (!INGRID(state, sx, sy)) return NULL;
1497 si = sy*w+sx;
1498 if (state->prev[si] == -1 && state->next[si] == -1)
1499 return NULL;
1500
1501 ret = dup_game(state);
1502
1503 if (c == 'C') {
1504 /* Unlink the single cell we dragged from the board. */
1505 unlink_cell(ret, si);
1506 } else {
1507 int i, set, sset = state->nums[si] / (state->n+1);
1508 for (i = 0; i < state->n; i++) {
1509 /* Unlink all cells in the same set as the one we dragged
1510 * from the board. */
1511
1512 if (state->nums[i] == 0) continue;
1513 set = state->nums[i] / (state->n+1);
1514 if (set != sset) continue;
1515
1516 unlink_cell(ret, i);
1517 }
1518 }
1519 } else if (strcmp(move, "H") == 0) {
1520 ret = dup_game(state);
1521 solve_state(ret);
1522 }
1523 if (ret) {
1524 update_numbers(ret);
1525 if (check_completion(ret, 1)) ret->completed = 1;
1526 }
1527
1528 return ret;
1529}
1530
1531/* ----------------------------------------------------------------------
1532 * Drawing routines.
1533 */
1534
1535static void game_compute_size(game_params *params, int tilesize,
1536 int *x, int *y)
1537{
1538 /* Ick: fake up `ds->tilesize' for macro expansion purposes */
1539 struct { int tilesize, order; } ads, *ds = &ads;
1540 ads.tilesize = tilesize;
1541
1542 *x = TILE_SIZE * params->w + 2 * BORDER;
1543 *y = TILE_SIZE * params->h + 2 * BORDER;
1544}
1545
1546static void game_set_size(drawing *dr, game_drawstate *ds,
1547 game_params *params, int tilesize)
1548{
1549 ds->tilesize = tilesize;
1550 assert(TILE_SIZE > 0);
1551
1552 assert(!ds->dragb);
1553 ds->dragb = blitter_new(dr, BLITTER_SIZE, BLITTER_SIZE);
1554}
1555
1556/* Colours chosen from the webby palette to work as a background to black text,
1557 * W then some plausible approximation to pastelly ROYGBIV; we then interpolate
1558 * between consecutive pairs to give another 8 (and then the drawing routine
1559 * will reuse backgrounds). */
1560static const unsigned long bgcols[8] = {
1561 0xffffff, /* white */
1562 0xffa07a, /* lightsalmon */
1563 0x98fb98, /* green */
1564 0x7fffd4, /* aquamarine */
1565 0x9370db, /* medium purple */
1566 0xffa500, /* orange */
1567 0x87cefa, /* lightskyblue */
1568 0xffff00, /* yellow */
1569};
1570
1571static float *game_colours(frontend *fe, int *ncolours)
1572{
1573 float *ret = snewn(3 * NCOLOURS, float);
1574 int c, i;
1575
1576 game_mkhighlight(fe, ret, COL_BACKGROUND, COL_HIGHLIGHT, COL_LOWLIGHT);
1577
1578 for (i = 0; i < 3; i++) {
1579 ret[COL_NUMBER * 3 + i] = 0.0F;
1580 ret[COL_ARROW * 3 + i] = 0.0F;
1581 ret[COL_CURSOR * 3 + i] = ret[COL_BACKGROUND * 3 + i] / 2.0F;
1582 ret[COL_GRID * 3 + i] = ret[COL_BACKGROUND * 3 + i] / 1.3F;
1583 }
1584 ret[COL_NUMBER_SET * 3 + 0] = 0.0F;
1585 ret[COL_NUMBER_SET * 3 + 1] = 0.0F;
1586 ret[COL_NUMBER_SET * 3 + 2] = 0.9F;
1587
1588 ret[COL_ERROR * 3 + 0] = 1.0F;
1589 ret[COL_ERROR * 3 + 1] = 0.0F;
1590 ret[COL_ERROR * 3 + 2] = 0.0F;
1591
1592 ret[COL_DRAG_ORIGIN * 3 + 0] = 0.2F;
1593 ret[COL_DRAG_ORIGIN * 3 + 1] = 1.0F;
1594 ret[COL_DRAG_ORIGIN * 3 + 2] = 0.2F;
1595
1596 for (c = 0; c < 8; c++) {
1597 ret[(COL_B0 + c) * 3 + 0] = (float)((bgcols[c] & 0xff0000) >> 16) / 256.0F;
1598 ret[(COL_B0 + c) * 3 + 1] = (float)((bgcols[c] & 0xff00) >> 8) / 256.0F;
1599 ret[(COL_B0 + c) * 3 + 2] = (float)((bgcols[c] & 0xff)) / 256.0F;
1600 }
1601 for (c = 0; c < 8; c++) {
1602 for (i = 0; i < 3; i++) {
1603 ret[(COL_B0 + 8 + c) * 3 + i] =
1604 (ret[(COL_B0 + c) * 3 + i] + ret[(COL_B0 + c + 1) * 3 + i]) / 2.0F;
1605 }
1606 }
1607
1608#define average(r,a,b,w) do { \
1609 for (i = 0; i < 3; i++) \
1610 ret[(r)*3+i] = ret[(a)*3+i] + w * (ret[(b)*3+i] - ret[(a)*3+i]); \
1611} while (0)
1612 average(COL_ARROW_BG_DIM, COL_BACKGROUND, COL_ARROW, 0.1F);
1613 average(COL_NUMBER_SET_MID, COL_B0, COL_NUMBER_SET, 0.3F);
1614 for (c = 0; c < NBACKGROUNDS; c++) {
1615 /* I assume here that COL_ARROW and COL_NUMBER are the same.
1616 * Otherwise I'd need two sets of COL_M*. */
1617 average(COL_M0 + c, COL_B0 + c, COL_NUMBER, 0.3F);
1618 average(COL_D0 + c, COL_B0 + c, COL_NUMBER, 0.1F);
1619 average(COL_X0 + c, COL_BACKGROUND, COL_B0 + c, 0.5F);
1620 }
1621
1622 *ncolours = NCOLOURS;
1623 return ret;
1624}
1625
1626static game_drawstate *game_new_drawstate(drawing *dr, game_state *state)
1627{
1628 struct game_drawstate *ds = snew(struct game_drawstate);
1629 int i;
1630
1631 ds->tilesize = ds->started = ds->solved = 0;
1632 ds->w = state->w;
1633 ds->h = state->h;
1634 ds->n = state->n;
1635
1636 ds->nums = snewn(state->n, int);
1637 ds->dirp = snewn(state->n, int);
1638 ds->f = snewn(state->n, unsigned int);
1639 for (i = 0; i < state->n; i++) {
1640 ds->nums[i] = 0;
1641 ds->dirp[i] = -1;
1642 ds->f[i] = 0;
1643 }
1644
1645 ds->angle_offset = 0.0F;
1646
1647 ds->dragging = ds->dx = ds->dy = 0;
1648 ds->dragb = NULL;
1649
1650 return ds;
1651}
1652
1653static void game_free_drawstate(drawing *dr, game_drawstate *ds)
1654{
1655 sfree(ds->nums);
1656 sfree(ds->dirp);
1657 sfree(ds->f);
1658 if (ds->dragb) blitter_free(dr, ds->dragb);
1659
1660 sfree(ds);
1661}
1662
1663/* cx, cy are top-left corner. sz is the 'radius' of the arrow.
1664 * ang is in radians, clockwise from 0 == straight up. */
1665static void draw_arrow(drawing *dr, int cx, int cy, int sz, double ang,
1666 int cfill, int cout)
1667{
1668 int coords[14];
1669 int xdx, ydx, xdy, ydy, xdx3, xdy3;
1670 double s = sin(ang), c = cos(ang);
1671
1672 xdx3 = (int)(sz * (c/3 + 1) + 0.5) - sz;
1673 xdy3 = (int)(sz * (s/3 + 1) + 0.5) - sz;
1674 xdx = (int)(sz * (c + 1) + 0.5) - sz;
1675 xdy = (int)(sz * (s + 1) + 0.5) - sz;
1676 ydx = -xdy;
1677 ydy = xdx;
1678
1679
1680 coords[2*0 + 0] = cx - ydx;
1681 coords[2*0 + 1] = cy - ydy;
1682 coords[2*1 + 0] = cx + xdx;
1683 coords[2*1 + 1] = cy + xdy;
1684 coords[2*2 + 0] = cx + xdx3;
1685 coords[2*2 + 1] = cy + xdy3;
1686 coords[2*3 + 0] = cx + xdx3 + ydx;
1687 coords[2*3 + 1] = cy + xdy3 + ydy;
1688 coords[2*4 + 0] = cx - xdx3 + ydx;
1689 coords[2*4 + 1] = cy - xdy3 + ydy;
1690 coords[2*5 + 0] = cx - xdx3;
1691 coords[2*5 + 1] = cy - xdy3;
1692 coords[2*6 + 0] = cx - xdx;
1693 coords[2*6 + 1] = cy - xdy;
1694
1695 draw_polygon(dr, coords, 7, cfill, cout);
1696}
1697
1698static void draw_arrow_dir(drawing *dr, int cx, int cy, int sz, int dir,
1699 int cfill, int cout, double angle_offset)
1700{
1701 double ang = 2.0 * PI * (double)dir / 8.0 + angle_offset;
1702 draw_arrow(dr, cx, cy, sz, ang, cfill, cout);
1703}
1704
1705/* cx, cy are centre coordinates.. */
1706static void draw_star(drawing *dr, int cx, int cy, int rad, int npoints,
1707 int cfill, int cout, double angle_offset)
1708{
1709 int *coords, n;
1710 double a, r;
1711
1712 assert(npoints > 0);
1713
1714 coords = snewn(npoints * 2 * 2, int);
1715
1716 for (n = 0; n < npoints * 2; n++) {
1717 a = 2.0 * PI * ((double)n / ((double)npoints * 2.0)) + angle_offset;
1718 r = (n % 2) ? (double)rad/2.0 : (double)rad;
1719
1720 /* We're rotating the point at (0, -r) by a degrees */
1721 coords[2*n+0] = cx + (int)( r * sin(a));
1722 coords[2*n+1] = cy + (int)(-r * cos(a));
1723 }
1724 draw_polygon(dr, coords, npoints*2, cfill, cout);
1725 sfree(coords);
1726}
1727
1728static int num2col(game_drawstate *ds, int num)
1729{
1730 int set = num / (ds->n+1);
1731
1732 if (num <= 0) return COL_BACKGROUND;
1733 return COL_B0 + (set % 16);
1734}
1735
1736#define ARROW_HALFSZ (7 * TILE_SIZE / 32)
1737
1738#define F_CUR 0x001 /* Cursor on this tile. */
1739#define F_DRAG_SRC 0x002 /* Tile is source of a drag. */
1740#define F_ERROR 0x004 /* Tile marked in error. */
1741#define F_IMMUTABLE 0x008 /* Tile (number) is immutable. */
1742#define F_ARROW_POINT 0x010 /* Tile points to other tile */
1743#define F_ARROW_INPOINT 0x020 /* Other tile points in here. */
1744#define F_DIM 0x040 /* Tile is dim */
1745
1746static void tile_redraw(drawing *dr, game_drawstate *ds, int tx, int ty,
1747 int dir, int dirp, int num, unsigned int f,
1748 double angle_offset, int print_ink)
1749{
1750 int cb = TILE_SIZE / 16, textsz;
1751 char buf[20];
1752 int arrowcol, sarrowcol, setcol, textcol;
1753 int n = num % (ds->n+1), set = num / (ds->n+1);
1754 int acx, acy, asz;
1755
1756 /* Calculate colours. */
1757
1758 if (print_ink >= 0) {
1759 /*
1760 * We're printing, so just do everything in black.
1761 */
1762 arrowcol = textcol = print_ink;
1763 setcol = sarrowcol = -1; /* placate optimiser */
1764 } else {
1765
1766 setcol = num2col(ds, num);
1767
1768#define dim(fg,bg) ( \
1769 (bg)==COL_BACKGROUND ? COL_ARROW_BG_DIM : \
1770 (bg) + COL_D0 - COL_B0 \
1771 )
1772
1773#define mid(fg,bg) ( \
1774 (fg)==COL_NUMBER_SET ? COL_NUMBER_SET_MID : \
1775 (bg) + COL_M0 - COL_B0 \
1776 )
1777
1778#define dimbg(bg) ( \
1779 (bg)==COL_BACKGROUND ? COL_BACKGROUND : \
1780 (bg) + COL_X0 - COL_B0 \
1781 )
1782
1783 if (f & F_DRAG_SRC) arrowcol = COL_DRAG_ORIGIN;
1784 else if (f & F_DIM) arrowcol = dim(COL_ARROW, setcol);
1785 else if (f & F_ARROW_POINT) arrowcol = mid(COL_ARROW, setcol);
1786 else arrowcol = COL_ARROW;
1787
1788 if (f & (F_ERROR)) textcol = COL_ERROR;
1789 else {
1790 if (f & F_IMMUTABLE) textcol = COL_NUMBER_SET;
1791 else textcol = COL_NUMBER;
1792
1793 if (f & F_DIM) textcol = dim(textcol, setcol);
1794 else if (((f & F_ARROW_POINT) || num==ds->n) &&
1795 ((f & F_ARROW_INPOINT) || num==1))
1796 textcol = mid(textcol, setcol);
1797 }
1798
1799 if (f & F_DIM) sarrowcol = dim(COL_ARROW, setcol);
1800 else sarrowcol = COL_ARROW;
1801 }
1802
1803 /* Clear tile background */
1804
1805 if (print_ink < 0) {
1806 draw_rect(dr, tx, ty, TILE_SIZE, TILE_SIZE,
1807 (f & F_DIM) ? dimbg(setcol) : setcol);
1808 }
1809
1810 /* Draw large (outwards-pointing) arrow. */
1811
1812 asz = ARROW_HALFSZ; /* 'radius' of arrow/star. */
1813 acx = tx+TILE_SIZE/2+asz; /* centre x */
1814 acy = ty+TILE_SIZE/2+asz; /* centre y */
1815
1816 if (num == ds->n && (f & F_IMMUTABLE))
1817 draw_star(dr, acx, acy, asz, 5, arrowcol, arrowcol, angle_offset);
1818 else
1819 draw_arrow_dir(dr, acx, acy, asz, dir, arrowcol, arrowcol, angle_offset);
1820 if (print_ink < 0 && (f & F_CUR))
1821 draw_rect_corners(dr, acx, acy, asz+1, COL_CURSOR);
1822
1823 /* Draw dot iff this tile requires a predecessor and doesn't have one. */
1824
1825 if (print_ink < 0) {
1826 acx = tx+TILE_SIZE/2-asz;
1827 acy = ty+TILE_SIZE/2+asz;
1828
1829 if (!(f & F_ARROW_INPOINT) && num != 1) {
1830 draw_circle(dr, acx, acy, asz / 4, sarrowcol, sarrowcol);
1831 }
1832 }
1833
1834 /* Draw text (number or set). */
1835
1836 if (num != 0) {
f867188f 1837 /* assert(num > 0); - actually, no, this obstructs legal play */
4cbcbfca 1838 if (set == 0) {
1839 sprintf(buf, "%d", n);
1840 } else {
1841 if (n == 0)
1842 sprintf(buf, "%c", (int)(set+'a'-1));
1843 else
1844 sprintf(buf, "%c+%d", (int)(set+'a'-1), n);
1845 }
1846 textsz = min(2*asz, (TILE_SIZE - 2 * cb) / (int)strlen(buf));
1847 draw_text(dr, tx + cb, ty + TILE_SIZE/4, FONT_VARIABLE, textsz,
1848 ALIGN_VCENTRE | ALIGN_HLEFT, textcol, buf);
1849 }
1850
1851 if (print_ink < 0) {
1852 draw_rect_outline(dr, tx, ty, TILE_SIZE, TILE_SIZE, COL_GRID);
1853 draw_update(dr, tx, ty, TILE_SIZE, TILE_SIZE);
1854 }
1855}
1856
1857static void draw_drag_indicator(drawing *dr, game_drawstate *ds,
1858 game_state *state, game_ui *ui, int validdrag)
1859{
1860 int dir, w = ds->w, acol = COL_ARROW;
1861 int fx = FROMCOORD(ui->dx), fy = FROMCOORD(ui->dy);
1862 double ang;
1863
1864 if (validdrag) {
1865 /* If we could move here, lock the arrow to the appropriate direction. */
1866 dir = ui->drag_is_from ? state->dirs[ui->sy*w+ui->sx] : state->dirs[fy*w+fx];
1867
1868 ang = (2.0 * PI * dir) / 8.0; /* similar to calculation in draw_arrow_dir. */
1869 } else {
1870 /* Draw an arrow pointing away from/towards the origin cell. */
1871 int ox = COORD(ui->sx) + TILE_SIZE/2, oy = COORD(ui->sy) + TILE_SIZE/2;
1872 double tana, offset;
1873 double xdiff = fabs(ox - ui->dx), ydiff = fabs(oy - ui->dy);
1874
1875 if (xdiff == 0) {
1876 ang = (oy > ui->dy) ? 0.0F : PI;
1877 } else if (ydiff == 0) {
1878 ang = (ox > ui->dx) ? 3.0F*PI/2.0F : PI/2.0F;
1879 } else {
1880 if (ui->dx > ox && ui->dy < oy) {
1881 tana = xdiff / ydiff;
1882 offset = 0.0F;
1883 } else if (ui->dx > ox && ui->dy > oy) {
1884 tana = ydiff / xdiff;
1885 offset = PI/2.0F;
1886 } else if (ui->dx < ox && ui->dy > oy) {
1887 tana = xdiff / ydiff;
1888 offset = PI;
1889 } else {
1890 tana = ydiff / xdiff;
1891 offset = 3.0F * PI / 2.0F;
1892 }
1893 ang = atan(tana) + offset;
1894 }
1895
1896 if (!ui->drag_is_from) ang += PI; /* point to origin, not away from. */
1897
1898 }
1899 draw_arrow(dr, ui->dx, ui->dy, ARROW_HALFSZ, ang, acol, acol);
1900}
1901
1902static void game_redraw(drawing *dr, game_drawstate *ds, game_state *oldstate,
1903 game_state *state, int dir, game_ui *ui,
1904 float animtime, float flashtime)
1905{
1906 int x, y, i, w = ds->w, dirp, force = 0;
1907 unsigned int f;
1908 double angle_offset = 0.0;
1909 game_state *postdrop = NULL;
1910
1911 if (flashtime > 0.0F)
1912 angle_offset = 2.0 * PI * (flashtime / FLASH_SPIN);
1913 if (angle_offset != ds->angle_offset) {
1914 ds->angle_offset = angle_offset;
1915 force = 1;
1916 }
1917
1918 if (ds->dragging) {
1919 assert(ds->dragb);
1920 blitter_load(dr, ds->dragb, ds->dx, ds->dy);
1921 draw_update(dr, ds->dx, ds->dy, BLITTER_SIZE, BLITTER_SIZE);
1922 ds->dragging = FALSE;
1923 }
1924
1925 /* If an in-progress drag would make a valid move if finished, we
1926 * reflect that move in the board display. We let interpret_move do
1927 * most of the heavy lifting for us: we have to copy the game_ui so
1928 * as not to stomp on the real UI's drag state. */
1929 if (ui->dragging) {
1930 game_ui uicopy = *ui;
1931 char *movestr = interpret_move(state, &uicopy, ds, ui->dx, ui->dy, LEFT_RELEASE);
1932
1933 if (movestr != NULL && strcmp(movestr, "") != 0) {
1934 postdrop = execute_move(state, movestr);
1935 sfree(movestr);
1936
1937 state = postdrop;
1938 }
1939 }
1940
1941 if (!ds->started) {
1942 int aw = TILE_SIZE * state->w;
1943 int ah = TILE_SIZE * state->h;
1944 draw_rect(dr, 0, 0, aw + 2 * BORDER, ah + 2 * BORDER, COL_BACKGROUND);
1945 draw_rect_outline(dr, BORDER - 1, BORDER - 1, aw + 2, ah + 2, COL_GRID);
1946 draw_update(dr, 0, 0, aw + 2 * BORDER, ah + 2 * BORDER);
1947 }
1948 for (x = 0; x < state->w; x++) {
1949 for (y = 0; y < state->h; y++) {
1950 i = y*w + x;
1951 f = 0;
1952 dirp = -1;
1953
1954 if (ui->cshow && x == ui->cx && y == ui->cy)
1955 f |= F_CUR;
1956
1957 if (ui->dragging) {
1958 if (x == ui->sx && y == ui->sy)
1959 f |= F_DRAG_SRC;
1960 else if (ui->drag_is_from) {
1961 if (!ispointing(state, ui->sx, ui->sy, x, y))
1962 f |= F_DIM;
1963 } else {
1964 if (!ispointing(state, x, y, ui->sx, ui->sy))
1965 f |= F_DIM;
1966 }
1967 }
1968
1969 if (state->impossible ||
1970 state->nums[i] < 0 || state->flags[i] & FLAG_ERROR)
1971 f |= F_ERROR;
1972 if (state->flags[i] & FLAG_IMMUTABLE)
1973 f |= F_IMMUTABLE;
1974
1975 if (state->next[i] != -1)
1976 f |= F_ARROW_POINT;
1977
1978 if (state->prev[i] != -1) {
1979 /* Currently the direction here is from our square _back_
1980 * to its previous. We could change this to give the opposite
1981 * sense to the direction. */
1982 f |= F_ARROW_INPOINT;
1983 dirp = whichdir(x, y, state->prev[i]%w, state->prev[i]/w);
1984 }
1985
1986 if (state->nums[i] != ds->nums[i] ||
1987 f != ds->f[i] || dirp != ds->dirp[i] ||
1988 force || !ds->started) {
1989 tile_redraw(dr, ds,
1990 BORDER + x * TILE_SIZE,
1991 BORDER + y * TILE_SIZE,
1992 state->dirs[i], dirp, state->nums[i], f,
1993 angle_offset, -1);
1994 ds->nums[i] = state->nums[i];
1995 ds->f[i] = f;
1996 ds->dirp[i] = dirp;
1997 }
1998 }
1999 }
2000 if (ui->dragging) {
2001 ds->dragging = TRUE;
2002 ds->dx = ui->dx - BLITTER_SIZE/2;
2003 ds->dy = ui->dy - BLITTER_SIZE/2;
2004 blitter_save(dr, ds->dragb, ds->dx, ds->dy);
2005
2006 draw_drag_indicator(dr, ds, state, ui, postdrop ? 1 : 0);
2007 }
2008 if (postdrop) free_game(postdrop);
2009 if (!ds->started) ds->started = TRUE;
2010}
2011
2012static float game_anim_length(game_state *oldstate, game_state *newstate,
2013 int dir, game_ui *ui)
2014{
2015 return 0.0F;
2016}
2017
2018static float game_flash_length(game_state *oldstate, game_state *newstate,
2019 int dir, game_ui *ui)
2020{
2021 if (!oldstate->completed &&
2022 newstate->completed && !newstate->used_solve)
2023 return FLASH_SPIN;
2024 else
2025 return 0.0F;
2026}
2027
2028static int game_timing_state(game_state *state, game_ui *ui)
2029{
2030 return TRUE;
2031}
2032
2033static void game_print_size(game_params *params, float *x, float *y)
2034{
2035 int pw, ph;
2036
2037 game_compute_size(params, 1300, &pw, &ph);
2038 *x = pw / 100.0F;
2039 *y = ph / 100.0F;
2040}
2041
2042static void game_print(drawing *dr, game_state *state, int tilesize)
2043{
2044 int ink = print_mono_colour(dr, 0);
2045 int x, y;
2046
2047 /* Fake up just enough of a drawstate */
2048 game_drawstate ads, *ds = &ads;
2049 ds->tilesize = tilesize;
2050 ds->n = state->n;
2051
2052 /*
2053 * Border and grid.
2054 */
2055 print_line_width(dr, TILE_SIZE / 40);
2056 for (x = 1; x < state->w; x++)
2057 draw_line(dr, COORD(x), COORD(0), COORD(x), COORD(state->h), ink);
2058 for (y = 1; y < state->h; y++)
2059 draw_line(dr, COORD(0), COORD(y), COORD(state->w), COORD(y), ink);
2060 print_line_width(dr, 2*TILE_SIZE / 40);
2061 draw_rect_outline(dr, COORD(0), COORD(0), TILE_SIZE*state->w,
2062 TILE_SIZE*state->h, ink);
2063
2064 /*
2065 * Arrows and numbers.
2066 */
2067 print_line_width(dr, 0);
2068 for (y = 0; y < state->h; y++)
2069 for (x = 0; x < state->w; x++)
2070 tile_redraw(dr, ds, COORD(x), COORD(y), state->dirs[y*state->w+x],
2071 0, state->nums[y*state->w+x], 0, 0.0, ink);
2072}
2073
2074#ifdef COMBINED
2075#define thegame signpost
2076#endif
2077
2078const struct game thegame = {
2079 "Signpost", "games.signpost", "signpost",
2080 default_params,
2081 game_fetch_preset,
2082 decode_params,
2083 encode_params,
2084 free_params,
2085 dup_params,
2086 TRUE, game_configure, custom_params,
2087 validate_params,
2088 new_game_desc,
2089 validate_desc,
2090 new_game,
2091 dup_game,
2092 free_game,
2093 TRUE, solve_game,
2094 TRUE, game_can_format_as_text_now, game_text_format,
2095 new_ui,
2096 free_ui,
2097 encode_ui,
2098 decode_ui,
2099 game_changed_state,
2100 interpret_move,
2101 execute_move,
2102 PREFERRED_TILE_SIZE, game_compute_size, game_set_size,
2103 game_colours,
2104 game_new_drawstate,
2105 game_free_drawstate,
2106 game_redraw,
2107 game_anim_length,
2108 game_flash_length,
2109 TRUE, FALSE, game_print_size, game_print,
2110 FALSE, /* wants_statusbar */
2111 FALSE, game_timing_state,
2112 REQUIRE_RBUTTON | REQUIRE_NUMPAD, /* flags */
2113};
2114
2115#ifdef STANDALONE_SOLVER
2116
2117#include <time.h>
2118#include <stdarg.h>
2119
2120const char *quis = NULL;
2121int verbose = 0;
2122
2123void usage(FILE *out) {
2124 fprintf(out, "usage: %s [--stdin] [--soak] [--seed SEED] <params>|<game id>\n", quis);
2125}
2126
2127static void cycle_seed(char **seedstr, random_state *rs)
2128{
2129 char newseed[16];
2130 int j;
2131
2132 newseed[15] = '\0';
2133 newseed[0] = '1' + (char)random_upto(rs, 9);
2134 for (j = 1; j < 15; j++)
2135 newseed[j] = '0' + (char)random_upto(rs, 10);
2136 sfree(*seedstr);
2137 *seedstr = dupstr(newseed);
2138}
2139
2140static void start_soak(game_params *p, char *seedstr)
2141{
2142 time_t tt_start, tt_now, tt_last;
2143 char *desc, *aux;
2144 random_state *rs;
2145 long n = 0, nnums = 0, i;
2146 game_state *state;
2147
2148 tt_start = tt_now = time(NULL);
2149 printf("Soak-generating a %dx%d grid.\n", p->w, p->h);
2150
2151 while (1) {
2152 rs = random_new(seedstr, strlen(seedstr));
2153 desc = thegame.new_desc(p, rs, &aux, 0);
2154
2155 state = thegame.new_game(NULL, p, desc);
2156 for (i = 0; i < state->n; i++) {
2157 if (state->flags[i] & FLAG_IMMUTABLE)
2158 nnums++;
2159 }
2160 thegame.free_game(state);
2161
2162 sfree(desc);
2163 cycle_seed(&seedstr, rs);
2164 random_free(rs);
2165
2166 n++;
2167 tt_last = time(NULL);
2168 if (tt_last > tt_now) {
2169 tt_now = tt_last;
2170 printf("%ld total, %3.1f/s, %3.1f nums/grid (%3.1f%%).\n",
2171 n,
2172 (double)n / ((double)tt_now - tt_start),
2173 (double)nnums / (double)n,
2174 ((double)nnums * 100.0) / ((double)n * (double)p->w * (double)p->h) );
2175 }
2176 }
2177}
2178
2179static void process_desc(char *id)
2180{
2181 char *desc, *err, *solvestr;
2182 game_params *p;
2183 game_state *s;
2184
2185 printf("%s\n ", id);
2186
2187 desc = strchr(id, ':');
2188 if (!desc) {
2189 fprintf(stderr, "%s: expecting game description.", quis);
2190 exit(1);
2191 }
2192
2193 *desc++ = '\0';
2194
2195 p = thegame.default_params();
2196 thegame.decode_params(p, id);
2197 err = thegame.validate_params(p, 1);
2198 if (err) {
2199 fprintf(stderr, "%s: %s", quis, err);
2200 thegame.free_params(p);
2201 return;
2202 }
2203
2204 err = thegame.validate_desc(p, desc);
2205 if (err) {
2206 fprintf(stderr, "%s: %s\nDescription: %s\n", quis, err, desc);
2207 thegame.free_params(p);
2208 return;
2209 }
2210
2211 s = thegame.new_game(NULL, p, desc);
2212
2213 solvestr = thegame.solve(s, s, NULL, &err);
2214 if (!solvestr)
2215 fprintf(stderr, "%s\n", err);
2216 else
2217 printf("Puzzle is soluble.\n");
2218
2219 thegame.free_game(s);
2220 thegame.free_params(p);
2221}
2222
2223int main(int argc, const char *argv[])
2224{
2225 char *id = NULL, *desc, *err, *aux = NULL;
2226 int soak = 0, verbose = 0, stdin_desc = 0, n = 1, i;
2227 char *seedstr = NULL, newseed[16];
2228
2229 setvbuf(stdout, NULL, _IONBF, 0);
2230
2231 quis = argv[0];
2232 while (--argc > 0) {
2233 char *p = (char*)(*++argv);
2234 if (!strcmp(p, "-v") || !strcmp(p, "--verbose"))
2235 verbose = 1;
2236 else if (!strcmp(p, "--stdin"))
2237 stdin_desc = 1;
2238 else if (!strcmp(p, "-e") || !strcmp(p, "--seed")) {
2239 seedstr = dupstr(*++argv);
2240 argc--;
2241 } else if (!strcmp(p, "-n") || !strcmp(p, "--number")) {
2242 n = atoi(*++argv);
2243 argc--;
2244 } else if (!strcmp(p, "-s") || !strcmp(p, "--soak")) {
2245 soak = 1;
2246 } else if (*p == '-') {
2247 fprintf(stderr, "%s: unrecognised option `%s'\n", argv[0], p);
2248 usage(stderr);
2249 exit(1);
2250 } else {
2251 id = p;
2252 }
2253 }
2254
2255 sprintf(newseed, "%lu", time(NULL));
2256 seedstr = dupstr(newseed);
2257
2258 if (id || !stdin_desc) {
2259 if (id && strchr(id, ':')) {
2260 /* Parameters and description passed on cmd-line:
2261 * try and solve it. */
2262 process_desc(id);
2263 } else {
2264 /* No description passed on cmd-line: decode parameters
2265 * (with optional seed too) */
2266
2267 game_params *p = thegame.default_params();
2268
2269 if (id) {
2270 char *cmdseed = strchr(id, '#');
2271 if (cmdseed) {
2272 *cmdseed++ = '\0';
2273 sfree(seedstr);
2274 seedstr = dupstr(cmdseed);
2275 }
2276
2277 thegame.decode_params(p, id);
2278 }
2279
2280 err = thegame.validate_params(p, 1);
2281 if (err) {
2282 fprintf(stderr, "%s: %s", quis, err);
2283 thegame.free_params(p);
2284 exit(1);
2285 }
2286
2287 /* We have a set of valid parameters; either soak with it
2288 * or generate a single game description and print to stdout. */
2289 if (soak)
2290 start_soak(p, seedstr);
2291 else {
2292 char *pstring = thegame.encode_params(p, 0);
2293
2294 for (i = 0; i < n; i++) {
2295 random_state *rs = random_new(seedstr, strlen(seedstr));
2296
2297 if (verbose) printf("%s#%s\n", pstring, seedstr);
2298 desc = thegame.new_desc(p, rs, &aux, 0);
2299 printf("%s:%s\n", pstring, desc);
2300 sfree(desc);
2301
2302 cycle_seed(&seedstr, rs);
2303
2304 random_free(rs);
2305 }
2306
2307 sfree(pstring);
2308 }
2309 thegame.free_params(p);
2310 }
2311 }
2312
2313 if (stdin_desc) {
2314 char buf[4096];
2315
2316 while (fgets(buf, sizeof(buf), stdin)) {
2317 buf[strcspn(buf, "\r\n")] = '\0';
2318 process_desc(buf);
2319 }
2320 }
2321 sfree(seedstr);
2322
2323 return 0;
2324}
2325
2326#endif
2327
2328
2329/* vim: set shiftwidth=4 tabstop=8: */
Simon Tatham's portable puzzles collection; import of svn://svn.tartarus.org/sgt/puzzles