Optionally label the colours in Guess with letters of the alphabet.
[sgt/puzzles] / guess.c
1 /*
2 * guess.c: Mastermind clone.
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 FLASH_FRAME 0.5F
15
16 enum {
17 COL_BACKGROUND,
18 COL_FRAME, COL_CURSOR, COL_FLASH, COL_HOLD,
19 COL_EMPTY, /* must be COL_1 - 1 */
20 COL_1, COL_2, COL_3, COL_4, COL_5, COL_6, COL_7, COL_8, COL_9, COL_10,
21 COL_CORRECTPLACE, COL_CORRECTCOLOUR,
22 NCOLOURS
23 };
24
25 struct game_params {
26 int ncolours, npegs, nguesses;
27 int allow_blank, allow_multiple;
28 };
29
30 #define FEEDBACK_CORRECTPLACE 1
31 #define FEEDBACK_CORRECTCOLOUR 2
32
33 typedef struct pegrow {
34 int npegs;
35 int *pegs; /* 0 is 'empty' */
36 int *feedback; /* may well be unused */
37 } *pegrow;
38
39 struct game_state {
40 game_params params;
41 pegrow *guesses; /* length params->nguesses */
42 int *holds;
43 pegrow solution;
44 int next_go; /* from 0 to nguesses-1;
45 if next_go == nguesses then they've lost. */
46 int solved;
47 };
48
49 static game_params *default_params(void)
50 {
51 game_params *ret = snew(game_params);
52
53 /* AFAIK this is the canonical Mastermind ruleset. */
54 ret->ncolours = 6;
55 ret->npegs = 4;
56 ret->nguesses = 10;
57
58 ret->allow_blank = 0;
59 ret->allow_multiple = 1;
60
61 return ret;
62 }
63
64 static void free_params(game_params *params)
65 {
66 sfree(params);
67 }
68
69 static game_params *dup_params(game_params *params)
70 {
71 game_params *ret = snew(game_params);
72 *ret = *params; /* structure copy */
73 return ret;
74 }
75
76 static const struct {
77 char *name;
78 game_params params;
79 } guess_presets[] = {
80 {"Standard", {6, 4, 10, FALSE, TRUE}},
81 {"Super", {8, 5, 12, FALSE, TRUE}},
82 };
83
84
85 static int game_fetch_preset(int i, char **name, game_params **params)
86 {
87 if (i < 0 || i >= lenof(guess_presets))
88 return FALSE;
89
90 *name = dupstr(guess_presets[i].name);
91 /*
92 * get round annoying const issues
93 */
94 {
95 game_params tmp = guess_presets[i].params;
96 *params = dup_params(&tmp);
97 }
98
99 return TRUE;
100 }
101
102 static void decode_params(game_params *params, char const *string)
103 {
104 char const *p = string;
105 game_params *defs = default_params();
106
107 *params = *defs; free_params(defs);
108
109 while (*p) {
110 switch (*p++) {
111 case 'c':
112 params->ncolours = atoi(p);
113 while (*p && isdigit((unsigned char)*p)) p++;
114 break;
115
116 case 'p':
117 params->npegs = atoi(p);
118 while (*p && isdigit((unsigned char)*p)) p++;
119 break;
120
121 case 'g':
122 params->nguesses = atoi(p);
123 while (*p && isdigit((unsigned char)*p)) p++;
124 break;
125
126 case 'b':
127 params->allow_blank = 1;
128 break;
129
130 case 'B':
131 params->allow_blank = 0;
132 break;
133
134 case 'm':
135 params->allow_multiple = 1;
136 break;
137
138 case 'M':
139 params->allow_multiple = 0;
140 break;
141
142 default:
143 ;
144 }
145 }
146 }
147
148 static char *encode_params(game_params *params, int full)
149 {
150 char data[256];
151
152 sprintf(data, "c%dp%dg%d%s%s",
153 params->ncolours, params->npegs, params->nguesses,
154 params->allow_blank ? "b" : "B", params->allow_multiple ? "m" : "M");
155
156 return dupstr(data);
157 }
158
159 static config_item *game_configure(game_params *params)
160 {
161 config_item *ret;
162 char buf[80];
163
164 ret = snewn(6, config_item);
165
166 ret[0].name = "Colours";
167 ret[0].type = C_STRING;
168 sprintf(buf, "%d", params->ncolours);
169 ret[0].sval = dupstr(buf);
170 ret[0].ival = 0;
171
172 ret[1].name = "Pegs per guess";
173 ret[1].type = C_STRING;
174 sprintf(buf, "%d", params->npegs);
175 ret[1].sval = dupstr(buf);
176 ret[1].ival = 0;
177
178 ret[2].name = "Guesses";
179 ret[2].type = C_STRING;
180 sprintf(buf, "%d", params->nguesses);
181 ret[2].sval = dupstr(buf);
182 ret[2].ival = 0;
183
184 ret[3].name = "Allow blanks";
185 ret[3].type = C_BOOLEAN;
186 ret[3].sval = NULL;
187 ret[3].ival = params->allow_blank;
188
189 ret[4].name = "Allow duplicates";
190 ret[4].type = C_BOOLEAN;
191 ret[4].sval = NULL;
192 ret[4].ival = params->allow_multiple;
193
194 ret[5].name = NULL;
195 ret[5].type = C_END;
196 ret[5].sval = NULL;
197 ret[5].ival = 0;
198
199 return ret;
200 }
201
202 static game_params *custom_params(config_item *cfg)
203 {
204 game_params *ret = snew(game_params);
205
206 ret->ncolours = atoi(cfg[0].sval);
207 ret->npegs = atoi(cfg[1].sval);
208 ret->nguesses = atoi(cfg[2].sval);
209
210 ret->allow_blank = cfg[3].ival;
211 ret->allow_multiple = cfg[4].ival;
212
213 return ret;
214 }
215
216 static char *validate_params(game_params *params, int full)
217 {
218 if (params->ncolours < 2 || params->npegs < 2)
219 return "Trivial solutions are uninteresting";
220 /* NB as well as the no. of colours we define, max(ncolours) must
221 * also fit in an unsigned char; see new_game_desc. */
222 if (params->ncolours > 10)
223 return "Too many colours";
224 if (params->nguesses < 1)
225 return "Must have at least one guess";
226 if (!params->allow_multiple && params->ncolours < params->npegs)
227 return "Disallowing multiple colours requires at least as many colours as pegs";
228 return NULL;
229 }
230
231 static pegrow new_pegrow(int npegs)
232 {
233 pegrow pegs = snew(struct pegrow);
234
235 pegs->npegs = npegs;
236 pegs->pegs = snewn(pegs->npegs, int);
237 memset(pegs->pegs, 0, pegs->npegs * sizeof(int));
238 pegs->feedback = snewn(pegs->npegs, int);
239 memset(pegs->feedback, 0, pegs->npegs * sizeof(int));
240
241 return pegs;
242 }
243
244 static pegrow dup_pegrow(pegrow pegs)
245 {
246 pegrow newpegs = new_pegrow(pegs->npegs);
247
248 memcpy(newpegs->pegs, pegs->pegs, newpegs->npegs * sizeof(int));
249 memcpy(newpegs->feedback, pegs->feedback, newpegs->npegs * sizeof(int));
250
251 return newpegs;
252 }
253
254 static void invalidate_pegrow(pegrow pegs)
255 {
256 memset(pegs->pegs, -1, pegs->npegs * sizeof(int));
257 memset(pegs->feedback, -1, pegs->npegs * sizeof(int));
258 }
259
260 static void free_pegrow(pegrow pegs)
261 {
262 sfree(pegs->pegs);
263 sfree(pegs->feedback);
264 sfree(pegs);
265 }
266
267 static char *new_game_desc(game_params *params, random_state *rs,
268 char **aux, int interactive)
269 {
270 unsigned char *bmp = snewn(params->npegs, unsigned char);
271 char *ret;
272 int i, c;
273 pegrow colcount = new_pegrow(params->ncolours);
274
275 for (i = 0; i < params->npegs; i++) {
276 newcol:
277 c = random_upto(rs, params->ncolours);
278 if (!params->allow_multiple && colcount->pegs[c]) goto newcol;
279 colcount->pegs[c]++;
280 bmp[i] = (unsigned char)(c+1);
281 }
282 obfuscate_bitmap(bmp, params->npegs*8, FALSE);
283
284 ret = bin2hex(bmp, params->npegs);
285 sfree(bmp);
286 free_pegrow(colcount);
287 return ret;
288 }
289
290 static char *validate_desc(game_params *params, char *desc)
291 {
292 unsigned char *bmp;
293 int i;
294
295 /* desc is just an (obfuscated) bitmap of the solution; check that
296 * it's the correct length and (when unobfuscated) contains only
297 * sensible colours. */
298 if (strlen(desc) != params->npegs * 2)
299 return "Game description is wrong length";
300 bmp = hex2bin(desc, params->npegs);
301 obfuscate_bitmap(bmp, params->npegs*8, TRUE);
302 for (i = 0; i < params->npegs; i++) {
303 if (bmp[i] < 1 || bmp[i] > params->ncolours) {
304 sfree(bmp);
305 return "Game description is corrupted";
306 }
307 }
308 sfree(bmp);
309
310 return NULL;
311 }
312
313 static game_state *new_game(midend *me, game_params *params, char *desc)
314 {
315 game_state *state = snew(game_state);
316 unsigned char *bmp;
317 int i;
318
319 state->params = *params;
320 state->guesses = snewn(params->nguesses, pegrow);
321 for (i = 0; i < params->nguesses; i++)
322 state->guesses[i] = new_pegrow(params->npegs);
323 state->holds = snewn(params->npegs, int);
324 state->solution = new_pegrow(params->npegs);
325
326 bmp = hex2bin(desc, params->npegs);
327 obfuscate_bitmap(bmp, params->npegs*8, TRUE);
328 for (i = 0; i < params->npegs; i++)
329 state->solution->pegs[i] = (int)bmp[i];
330 sfree(bmp);
331
332 memset(state->holds, 0, sizeof(int) * params->npegs);
333 state->next_go = state->solved = 0;
334
335 return state;
336 }
337
338 static game_state *dup_game(game_state *state)
339 {
340 game_state *ret = snew(game_state);
341 int i;
342
343 *ret = *state;
344
345 ret->guesses = snewn(state->params.nguesses, pegrow);
346 for (i = 0; i < state->params.nguesses; i++)
347 ret->guesses[i] = dup_pegrow(state->guesses[i]);
348 ret->holds = snewn(state->params.npegs, int);
349 memcpy(ret->holds, state->holds, sizeof(int) * state->params.npegs);
350 ret->solution = dup_pegrow(state->solution);
351
352 return ret;
353 }
354
355 static void free_game(game_state *state)
356 {
357 int i;
358
359 free_pegrow(state->solution);
360 for (i = 0; i < state->params.nguesses; i++)
361 free_pegrow(state->guesses[i]);
362 sfree(state->holds);
363 sfree(state->guesses);
364
365 sfree(state);
366 }
367
368 static char *solve_game(game_state *state, game_state *currstate,
369 char *aux, char **error)
370 {
371 return dupstr("S");
372 }
373
374 static char *game_text_format(game_state *state)
375 {
376 return NULL;
377 }
378
379 static int is_markable(game_params *params, pegrow pegs)
380 {
381 int i, nset = 0, nrequired, ret = 0;
382 pegrow colcount = new_pegrow(params->ncolours);
383
384 nrequired = params->allow_blank ? 1 : params->npegs;
385
386 for (i = 0; i < params->npegs; i++) {
387 int c = pegs->pegs[i];
388 if (c > 0) {
389 colcount->pegs[c-1]++;
390 nset++;
391 }
392 }
393 if (nset < nrequired) goto done;
394
395 if (!params->allow_multiple) {
396 for (i = 0; i < params->ncolours; i++) {
397 if (colcount->pegs[i] > 1) goto done;
398 }
399 }
400 ret = 1;
401 done:
402 free_pegrow(colcount);
403 return ret;
404 }
405
406 struct game_ui {
407 game_params params;
408 pegrow curr_pegs; /* half-finished current move */
409 int *holds;
410 int colour_cur; /* position of up-down colour picker cursor */
411 int peg_cur; /* position of left-right peg picker cursor */
412 int display_cur, markable;
413
414 int drag_col, drag_x, drag_y; /* x and y are *center* of peg! */
415 int drag_opeg; /* peg index, if dragged from a peg (from current guess), otherwise -1 */
416
417 int show_labels; /* label the colours with letters */
418 };
419
420 static game_ui *new_ui(game_state *state)
421 {
422 game_ui *ui = snew(game_ui);
423 memset(ui, 0, sizeof(game_ui));
424 ui->params = state->params; /* structure copy */
425 ui->curr_pegs = new_pegrow(state->params.npegs);
426 ui->holds = snewn(state->params.npegs, int);
427 memset(ui->holds, 0, sizeof(int)*state->params.npegs);
428 ui->drag_opeg = -1;
429 return ui;
430 }
431
432 static void free_ui(game_ui *ui)
433 {
434 free_pegrow(ui->curr_pegs);
435 sfree(ui->holds);
436 sfree(ui);
437 }
438
439 static char *encode_ui(game_ui *ui)
440 {
441 char *ret, *p, *sep;
442 int i;
443
444 /*
445 * For this game it's worth storing the contents of the current
446 * guess, and the current set of holds.
447 */
448 ret = snewn(40 * ui->curr_pegs->npegs, char);
449 p = ret;
450 sep = "";
451 for (i = 0; i < ui->curr_pegs->npegs; i++) {
452 p += sprintf(p, "%s%d%s", sep, ui->curr_pegs->pegs[i],
453 ui->holds[i] ? "_" : "");
454 sep = ",";
455 }
456 *p++ = '\0';
457 assert(p - ret < 40 * ui->curr_pegs->npegs);
458 return sresize(ret, p - ret, char);
459 }
460
461 static void decode_ui(game_ui *ui, char *encoding)
462 {
463 int i;
464 char *p = encoding;
465 for (i = 0; i < ui->curr_pegs->npegs; i++) {
466 ui->curr_pegs->pegs[i] = atoi(p);
467 while (*p && isdigit((unsigned char)*p)) p++;
468 if (*p == '_') {
469 /* NB: old versions didn't store holds */
470 ui->holds[i] = 1;
471 p++;
472 } else
473 ui->holds[i] = 0;
474 if (*p == ',') p++;
475 }
476 ui->markable = is_markable(&ui->params, ui->curr_pegs);
477 }
478
479 static void game_changed_state(game_ui *ui, game_state *oldstate,
480 game_state *newstate)
481 {
482 int i;
483
484 /* Implement holds, clear other pegs.
485 * This does something that is arguably the Right Thing even
486 * for undo. */
487 for (i = 0; i < newstate->solution->npegs; i++) {
488 if (newstate->solved)
489 ui->holds[i] = 0;
490 else
491 ui->holds[i] = newstate->holds[i];
492 if (newstate->solved || (newstate->next_go == 0) || !ui->holds[i]) {
493 ui->curr_pegs->pegs[i] = 0;
494 } else
495 ui->curr_pegs->pegs[i] =
496 newstate->guesses[newstate->next_go-1]->pegs[i];
497 }
498 ui->markable = is_markable(&newstate->params, ui->curr_pegs);
499 /* Clean up cursor position */
500 if (!ui->markable && ui->peg_cur == newstate->solution->npegs)
501 ui->peg_cur--;
502 }
503
504 #define PEGSZ (ds->pegsz)
505 #define PEGOFF (ds->pegsz + ds->gapsz)
506 #define HINTSZ (ds->hintsz)
507 #define HINTOFF (ds->hintsz + ds->gapsz)
508
509 #define GAP (ds->gapsz)
510 #define CGAP (ds->gapsz / 2)
511
512 #define PEGRAD (ds->pegrad)
513 #define HINTRAD (ds->hintrad)
514
515 #define COL_OX (ds->colx)
516 #define COL_OY (ds->coly)
517 #define COL_X(c) (COL_OX)
518 #define COL_Y(c) (COL_OY + (c)*PEGOFF)
519 #define COL_W PEGOFF
520 #define COL_H (ds->colours->npegs*PEGOFF)
521
522 #define GUESS_OX (ds->guessx)
523 #define GUESS_OY (ds->guessy)
524 #define GUESS_X(g,p) (GUESS_OX + (p)*PEGOFF)
525 #define GUESS_Y(g,p) (GUESS_OY + (g)*PEGOFF)
526 #define GUESS_W (ds->solution->npegs*PEGOFF)
527 #define GUESS_H (ds->nguesses*PEGOFF)
528
529 #define HINT_OX (GUESS_OX + GUESS_W + ds->gapsz)
530 #define HINT_OY (GUESS_OY + (PEGSZ - HINTOFF - HINTSZ) / 2)
531 #define HINT_X(g) HINT_OX
532 #define HINT_Y(g) (HINT_OY + (g)*PEGOFF)
533 #define HINT_W ((ds->hintw*HINTOFF) - GAP)
534 #define HINT_H GUESS_H
535
536 #define SOLN_OX GUESS_OX
537 #define SOLN_OY (GUESS_OY + GUESS_H + ds->gapsz + 2)
538 #define SOLN_W GUESS_W
539 #define SOLN_H PEGOFF
540
541 struct game_drawstate {
542 int nguesses;
543 pegrow *guesses; /* same size as state->guesses */
544 pegrow solution; /* only displayed if state->solved */
545 pegrow colours; /* length ncolours, not npegs */
546
547 int pegsz, hintsz, gapsz; /* peg size (diameter), etc. */
548 int pegrad, hintrad; /* radius of peg, hint */
549 int border;
550 int colx, coly; /* origin of colours vertical bar */
551 int guessx, guessy; /* origin of guesses */
552 int solnx, solny; /* origin of solution */
553 int hintw; /* no. of hint tiles we're wide per row */
554 int w, h, started, solved;
555
556 int next_go;
557
558 blitter *blit_peg;
559 int drag_col, blit_ox, blit_oy;
560 };
561
562 static void set_peg(game_params *params, game_ui *ui, int peg, int col)
563 {
564 ui->curr_pegs->pegs[peg] = col;
565 ui->markable = is_markable(params, ui->curr_pegs);
566 }
567
568 static int mark_pegs(pegrow guess, pegrow solution, int ncols)
569 {
570 int nc_place = 0, nc_colour = 0, i, j;
571
572 assert(guess && solution && (guess->npegs == solution->npegs));
573
574 for (i = 0; i < guess->npegs; i++) {
575 if (guess->pegs[i] == solution->pegs[i]) nc_place++;
576 }
577
578 /* slight bit of cleverness: we have the following formula, from
579 * http://mathworld.wolfram.com/Mastermind.html that gives:
580 *
581 * nc_colour = sum(colours, min(#solution, #guess)) - nc_place
582 *
583 * I think this is due to Knuth.
584 */
585 for (i = 1; i <= ncols; i++) {
586 int n_guess = 0, n_solution = 0;
587 for (j = 0; j < guess->npegs; j++) {
588 if (guess->pegs[j] == i) n_guess++;
589 if (solution->pegs[j] == i) n_solution++;
590 }
591 nc_colour += min(n_guess, n_solution);
592 }
593 nc_colour -= nc_place;
594
595 debug(("mark_pegs, %d pegs, %d right place, %d right colour",
596 guess->npegs, nc_place, nc_colour));
597 assert((nc_colour + nc_place) <= guess->npegs);
598
599 memset(guess->feedback, 0, guess->npegs*sizeof(int));
600 for (i = 0, j = 0; i < nc_place; i++)
601 guess->feedback[j++] = FEEDBACK_CORRECTPLACE;
602 for (i = 0; i < nc_colour; i++)
603 guess->feedback[j++] = FEEDBACK_CORRECTCOLOUR;
604
605 return nc_place;
606 }
607
608 static char *encode_move(game_state *from, game_ui *ui)
609 {
610 char *buf, *p, *sep;
611 int len, i;
612
613 len = ui->curr_pegs->npegs * 20 + 2;
614 buf = snewn(len, char);
615 p = buf;
616 *p++ = 'G';
617 sep = "";
618 for (i = 0; i < ui->curr_pegs->npegs; i++) {
619 p += sprintf(p, "%s%d%s", sep, ui->curr_pegs->pegs[i],
620 ui->holds[i] ? "_" : "");
621 sep = ",";
622 }
623 *p++ = '\0';
624 assert(p - buf <= len);
625 buf = sresize(buf, len, char);
626
627 return buf;
628 }
629
630 static char *interpret_move(game_state *from, game_ui *ui, game_drawstate *ds,
631 int x, int y, int button)
632 {
633 int over_col = 0; /* one-indexed */
634 int over_guess = -1; /* zero-indexed */
635 int over_past_guess_y = -1; /* zero-indexed */
636 int over_past_guess_x = -1; /* zero-indexed */
637 int over_hint = 0; /* zero or one */
638 char *ret = NULL;
639
640 int guess_ox = GUESS_X(from->next_go, 0);
641 int guess_oy = GUESS_Y(from->next_go, 0);
642
643 /*
644 * Enable or disable labels on colours.
645 */
646 if (button == 'l' || button == 'L') {
647 ui->show_labels = !ui->show_labels;
648 return "";
649 }
650
651 if (from->solved) return NULL;
652
653 if (x >= COL_OX && x <= (COL_OX + COL_W) &&
654 y >= COL_OY && y <= (COL_OY + COL_H)) {
655 over_col = ((y - COL_OY) / PEGOFF) + 1;
656 } else if (x >= guess_ox &&
657 y >= guess_oy && y <= (guess_oy + GUESS_H)) {
658 if (x <= (guess_ox + GUESS_W)) {
659 over_guess = (x - guess_ox) / PEGOFF;
660 } else {
661 over_hint = 1;
662 }
663 } else if (x >= guess_ox && x <= (guess_ox + GUESS_W) &&
664 y >= GUESS_OY && y < guess_oy) {
665 over_past_guess_y = (y - GUESS_OY) / PEGOFF;
666 over_past_guess_x = (x - guess_ox) / PEGOFF;
667 }
668 debug(("make_move: over_col %d, over_guess %d, over_hint %d,"
669 " over_past_guess (%d,%d)", over_col, over_guess, over_hint,
670 over_past_guess_x, over_past_guess_y));
671
672 assert(ds->blit_peg);
673
674 /* mouse input */
675 if (button == LEFT_BUTTON) {
676 if (over_col > 0) {
677 ui->drag_col = over_col;
678 ui->drag_opeg = -1;
679 debug(("Start dragging from colours"));
680 } else if (over_guess > -1) {
681 int col = ui->curr_pegs->pegs[over_guess];
682 if (col) {
683 ui->drag_col = col;
684 ui->drag_opeg = over_guess;
685 debug(("Start dragging from a guess"));
686 }
687 } else if (over_past_guess_y > -1) {
688 int col =
689 from->guesses[over_past_guess_y]->pegs[over_past_guess_x];
690 if (col) {
691 ui->drag_col = col;
692 ui->drag_opeg = -1;
693 debug(("Start dragging from a past guess"));
694 }
695 }
696 if (ui->drag_col) {
697 ui->drag_x = x;
698 ui->drag_y = y;
699 debug(("Start dragging, col = %d, (%d,%d)",
700 ui->drag_col, ui->drag_x, ui->drag_y));
701 ret = "";
702 }
703 } else if (button == LEFT_DRAG && ui->drag_col) {
704 ui->drag_x = x;
705 ui->drag_y = y;
706 debug(("Keep dragging, (%d,%d)", ui->drag_x, ui->drag_y));
707 ret = "";
708 } else if (button == LEFT_RELEASE && ui->drag_col) {
709 if (over_guess > -1) {
710 debug(("Dropping colour %d onto guess peg %d",
711 ui->drag_col, over_guess));
712 set_peg(&from->params, ui, over_guess, ui->drag_col);
713 } else {
714 if (ui->drag_opeg > -1) {
715 debug(("Removing colour %d from peg %d",
716 ui->drag_col, ui->drag_opeg));
717 set_peg(&from->params, ui, ui->drag_opeg, 0);
718 }
719 }
720 ui->drag_col = 0;
721 ui->drag_opeg = -1;
722 ui->display_cur = 0;
723 debug(("Stop dragging."));
724 ret = "";
725 } else if (button == RIGHT_BUTTON) {
726 if (over_guess > -1) {
727 /* we use ths feedback in the game_ui to signify
728 * 'carry this peg to the next guess as well'. */
729 ui->holds[over_guess] = 1 - ui->holds[over_guess];
730 ret = "";
731 }
732 } else if (button == LEFT_RELEASE && over_hint && ui->markable) {
733 /* NB this won't trigger if on the end of a drag; that's on
734 * purpose, in case you drop by mistake... */
735 ret = encode_move(from, ui);
736 }
737
738 /* keyboard input */
739 if (button == CURSOR_UP || button == CURSOR_DOWN) {
740 ui->display_cur = 1;
741 if (button == CURSOR_DOWN && (ui->colour_cur+1) < from->params.ncolours)
742 ui->colour_cur++;
743 if (button == CURSOR_UP && ui->colour_cur > 0)
744 ui->colour_cur--;
745 ret = "";
746 } else if (button == CURSOR_LEFT || button == CURSOR_RIGHT) {
747 int maxcur = from->params.npegs;
748 if (ui->markable) maxcur++;
749
750 ui->display_cur = 1;
751 if (button == CURSOR_RIGHT && (ui->peg_cur+1) < maxcur)
752 ui->peg_cur++;
753 if (button == CURSOR_LEFT && ui->peg_cur > 0)
754 ui->peg_cur--;
755 ret = "";
756 } else if (button == CURSOR_SELECT || button == ' ' || button == '\r' ||
757 button == '\n') {
758 ui->display_cur = 1;
759 if (ui->peg_cur == from->params.npegs) {
760 ret = encode_move(from, ui);
761 } else {
762 set_peg(&from->params, ui, ui->peg_cur, ui->colour_cur+1);
763 ret = "";
764 }
765 } else if (button == 'D' || button == 'd' || button == '\b') {
766 ui->display_cur = 1;
767 set_peg(&from->params, ui, ui->peg_cur, 0);
768 ret = "";
769 } else if (button == 'H' || button == 'h') {
770 ui->display_cur = 1;
771 ui->holds[ui->peg_cur] = 1 - ui->holds[ui->peg_cur];
772 ret = "";
773 }
774 return ret;
775 }
776
777 static game_state *execute_move(game_state *from, char *move)
778 {
779 int i, nc_place;
780 game_state *ret;
781 char *p;
782
783 if (!strcmp(move, "S")) {
784 ret = dup_game(from);
785 ret->solved = 1;
786 return ret;
787 } else if (move[0] == 'G') {
788 p = move+1;
789
790 ret = dup_game(from);
791
792 for (i = 0; i < from->solution->npegs; i++) {
793 int val = atoi(p);
794 int min_colour = from->params.allow_blank? 0 : 1;
795 if (val < min_colour || val > from->params.ncolours) {
796 free_game(ret);
797 return NULL;
798 }
799 ret->guesses[from->next_go]->pegs[i] = atoi(p);
800 while (*p && isdigit((unsigned char)*p)) p++;
801 if (*p == '_') {
802 ret->holds[i] = 1;
803 p++;
804 } else
805 ret->holds[i] = 0;
806 if (*p == ',') p++;
807 }
808
809 nc_place = mark_pegs(ret->guesses[from->next_go], ret->solution, ret->params.ncolours);
810
811 if (nc_place == ret->solution->npegs) {
812 ret->solved = 1; /* win! */
813 } else {
814 ret->next_go = from->next_go + 1;
815 if (ret->next_go >= ret->params.nguesses)
816 ret->solved = 1; /* 'lose' so we show the pegs. */
817 }
818
819 return ret;
820 } else
821 return NULL;
822 }
823
824 /* ----------------------------------------------------------------------
825 * Drawing routines.
826 */
827
828 #define PEG_PREFER_SZ 32
829
830 /* next three are multipliers for pegsz. It will look much nicer if
831 * (2*PEG_HINT) + PEG_GAP = 1.0 as the hints are formatted like that. */
832 #define PEG_GAP 0.10
833 #define PEG_HINT 0.35
834
835 #define BORDER 0.5
836
837 static void game_compute_size(game_params *params, int tilesize,
838 int *x, int *y)
839 {
840 double hmul, vmul_c, vmul_g, vmul;
841 int hintw = (params->npegs+1)/2;
842
843 hmul = BORDER * 2.0 + /* border */
844 1.0 * 2.0 + /* vertical colour bar */
845 1.0 * params->npegs + /* guess pegs */
846 PEG_GAP * params->npegs + /* guess gaps */
847 PEG_HINT * hintw + /* hint pegs */
848 PEG_GAP * (hintw - 1); /* hint gaps */
849
850 vmul_c = BORDER * 2.0 + /* border */
851 1.0 * params->ncolours + /* colour pegs */
852 PEG_GAP * (params->ncolours - 1); /* colour gaps */
853
854 vmul_g = BORDER * 2.0 + /* border */
855 1.0 * (params->nguesses + 1) + /* guesses plus solution */
856 PEG_GAP * (params->nguesses + 1); /* gaps plus gap above soln */
857
858 vmul = max(vmul_c, vmul_g);
859
860 *x = (int)ceil((double)tilesize * hmul);
861 *y = (int)ceil((double)tilesize * vmul);
862 }
863
864 static void game_set_size(drawing *dr, game_drawstate *ds,
865 game_params *params, int tilesize)
866 {
867 int colh, guessh;
868
869 ds->pegsz = tilesize;
870
871 ds->hintsz = (int)((double)ds->pegsz * PEG_HINT);
872 ds->gapsz = (int)((double)ds->pegsz * PEG_GAP);
873 ds->border = (int)((double)ds->pegsz * BORDER);
874
875 ds->pegrad = (ds->pegsz -1)/2; /* radius of peg to fit in pegsz (which is 2r+1) */
876 ds->hintrad = (ds->hintsz-1)/2;
877
878 colh = ((ds->pegsz + ds->gapsz) * params->ncolours) - ds->gapsz;
879 guessh = ((ds->pegsz + ds->gapsz) * params->nguesses); /* guesses */
880 guessh += ds->gapsz + ds->pegsz; /* solution */
881
882 game_compute_size(params, tilesize, &ds->w, &ds->h);
883 ds->colx = ds->border;
884 ds->coly = (ds->h - colh) / 2;
885
886 ds->guessx = ds->solnx = ds->border + ds->pegsz * 2; /* border + colours */
887 ds->guessy = (ds->h - guessh) / 2;
888 ds->solny = ds->guessy + ((ds->pegsz + ds->gapsz) * params->nguesses) + ds->gapsz;
889
890 assert(ds->pegsz > 0);
891 assert(!ds->blit_peg); /* set_size is never called twice */
892 ds->blit_peg = blitter_new(dr, ds->pegsz, ds->pegsz);
893 }
894
895 static float *game_colours(frontend *fe, int *ncolours)
896 {
897 float *ret = snewn(3 * NCOLOURS, float), max;
898 int i;
899
900 frontend_default_colour(fe, &ret[COL_BACKGROUND * 3]);
901
902 /* red */
903 ret[COL_1 * 3 + 0] = 1.0F;
904 ret[COL_1 * 3 + 1] = 0.0F;
905 ret[COL_1 * 3 + 2] = 0.0F;
906
907 /* yellow */
908 ret[COL_2 * 3 + 0] = 1.0F;
909 ret[COL_2 * 3 + 1] = 1.0F;
910 ret[COL_2 * 3 + 2] = 0.0F;
911
912 /* green */
913 ret[COL_3 * 3 + 0] = 0.0F;
914 ret[COL_3 * 3 + 1] = 1.0F;
915 ret[COL_3 * 3 + 2] = 0.0F;
916
917 /* blue */
918 ret[COL_4 * 3 + 0] = 0.2F;
919 ret[COL_4 * 3 + 1] = 0.3F;
920 ret[COL_4 * 3 + 2] = 1.0F;
921
922 /* orange */
923 ret[COL_5 * 3 + 0] = 1.0F;
924 ret[COL_5 * 3 + 1] = 0.5F;
925 ret[COL_5 * 3 + 2] = 0.0F;
926
927 /* purple */
928 ret[COL_6 * 3 + 0] = 0.5F;
929 ret[COL_6 * 3 + 1] = 0.0F;
930 ret[COL_6 * 3 + 2] = 0.7F;
931
932 /* brown */
933 ret[COL_7 * 3 + 0] = 0.5F;
934 ret[COL_7 * 3 + 1] = 0.3F;
935 ret[COL_7 * 3 + 2] = 0.3F;
936
937 /* light blue */
938 ret[COL_8 * 3 + 0] = 0.4F;
939 ret[COL_8 * 3 + 1] = 0.8F;
940 ret[COL_8 * 3 + 2] = 1.0F;
941
942 /* light green */
943 ret[COL_9 * 3 + 0] = 0.7F;
944 ret[COL_9 * 3 + 1] = 1.0F;
945 ret[COL_9 * 3 + 2] = 0.7F;
946
947 /* pink */
948 ret[COL_10 * 3 + 0] = 1.0F;
949 ret[COL_10 * 3 + 1] = 0.6F;
950 ret[COL_10 * 3 + 2] = 1.0F;
951
952 ret[COL_FRAME * 3 + 0] = 0.0F;
953 ret[COL_FRAME * 3 + 1] = 0.0F;
954 ret[COL_FRAME * 3 + 2] = 0.0F;
955
956 ret[COL_CURSOR * 3 + 0] = 0.0F;
957 ret[COL_CURSOR * 3 + 1] = 0.0F;
958 ret[COL_CURSOR * 3 + 2] = 0.0F;
959
960 ret[COL_FLASH * 3 + 0] = 0.5F;
961 ret[COL_FLASH * 3 + 1] = 1.0F;
962 ret[COL_FLASH * 3 + 2] = 1.0F;
963
964 ret[COL_HOLD * 3 + 0] = 1.0F;
965 ret[COL_HOLD * 3 + 1] = 0.5F;
966 ret[COL_HOLD * 3 + 2] = 0.5F;
967
968 ret[COL_CORRECTPLACE*3 + 0] = 0.0F;
969 ret[COL_CORRECTPLACE*3 + 1] = 0.0F;
970 ret[COL_CORRECTPLACE*3 + 2] = 0.0F;
971
972 ret[COL_CORRECTCOLOUR*3 + 0] = 1.0F;
973 ret[COL_CORRECTCOLOUR*3 + 1] = 1.0F;
974 ret[COL_CORRECTCOLOUR*3 + 2] = 1.0F;
975
976 /* We want to make sure we can distinguish COL_CORRECTCOLOUR
977 * (which we hard-code as white) from COL_BACKGROUND (which
978 * could default to white on some platforms).
979 * Code borrowed from fifteen.c. */
980 max = ret[COL_BACKGROUND*3];
981 for (i = 1; i < 3; i++)
982 if (ret[COL_BACKGROUND*3+i] > max)
983 max = ret[COL_BACKGROUND*3+i];
984 if (max * 1.2F > 1.0F) {
985 for (i = 0; i < 3; i++)
986 ret[COL_BACKGROUND*3+i] /= (max * 1.2F);
987 }
988
989 /* We also want to be able to tell the difference between BACKGROUND
990 * and EMPTY, for similar distinguishing-hint reasons. */
991 ret[COL_EMPTY * 3 + 0] = ret[COL_BACKGROUND * 3 + 0] * 2.0 / 3.0;
992 ret[COL_EMPTY * 3 + 1] = ret[COL_BACKGROUND * 3 + 1] * 2.0 / 3.0;
993 ret[COL_EMPTY * 3 + 2] = ret[COL_BACKGROUND * 3 + 2] * 2.0 / 3.0;
994
995 *ncolours = NCOLOURS;
996 return ret;
997 }
998
999 static game_drawstate *game_new_drawstate(drawing *dr, game_state *state)
1000 {
1001 struct game_drawstate *ds = snew(struct game_drawstate);
1002 int i;
1003
1004 memset(ds, 0, sizeof(struct game_drawstate));
1005
1006 ds->guesses = snewn(state->params.nguesses, pegrow);
1007 ds->nguesses = state->params.nguesses;
1008 for (i = 0; i < state->params.nguesses; i++) {
1009 ds->guesses[i] = new_pegrow(state->params.npegs);
1010 invalidate_pegrow(ds->guesses[i]);
1011 }
1012 ds->solution = new_pegrow(state->params.npegs);
1013 invalidate_pegrow(ds->solution);
1014 ds->colours = new_pegrow(state->params.ncolours);
1015 invalidate_pegrow(ds->colours);
1016
1017 ds->hintw = (state->params.npegs+1)/2; /* must round up */
1018
1019 ds->blit_peg = NULL;
1020
1021 return ds;
1022 }
1023
1024 static void game_free_drawstate(drawing *dr, game_drawstate *ds)
1025 {
1026 int i;
1027
1028 if (ds->blit_peg) blitter_free(dr, ds->blit_peg);
1029 free_pegrow(ds->colours);
1030 free_pegrow(ds->solution);
1031 for (i = 0; i < ds->nguesses; i++)
1032 free_pegrow(ds->guesses[i]);
1033 sfree(ds->guesses);
1034 sfree(ds);
1035 }
1036
1037 static void draw_peg(drawing *dr, game_drawstate *ds, int cx, int cy,
1038 int moving, int labelled, int col)
1039 {
1040 /*
1041 * Some platforms antialias circles, which means we shouldn't
1042 * overwrite a circle of one colour with a circle of another
1043 * colour without erasing the background first. However, if the
1044 * peg is the one being dragged, we don't erase the background
1045 * because we _want_ it to alpha-blend nicely into whatever's
1046 * behind it.
1047 */
1048 if (!moving)
1049 draw_rect(dr, cx-CGAP, cy-CGAP, PEGSZ+CGAP*2, PEGSZ+CGAP*2,
1050 COL_BACKGROUND);
1051 if (PEGRAD > 0) {
1052 draw_circle(dr, cx+PEGRAD, cy+PEGRAD, PEGRAD,
1053 COL_EMPTY + col, (col ? COL_FRAME : COL_EMPTY));
1054 } else
1055 draw_rect(dr, cx, cy, PEGSZ, PEGSZ, COL_EMPTY + col);
1056
1057 if (labelled && col) {
1058 char buf[2];
1059 buf[0] = 'a'-1 + col;
1060 buf[1] = '\0';
1061 draw_text(dr, cx+PEGRAD, cy+PEGRAD, FONT_VARIABLE, PEGRAD,
1062 ALIGN_HCENTRE|ALIGN_VCENTRE, COL_FRAME, buf);
1063 }
1064
1065 draw_update(dr, cx-CGAP, cy-CGAP, PEGSZ+CGAP*2, PEGSZ+CGAP*2);
1066 }
1067
1068 static void draw_cursor(drawing *dr, game_drawstate *ds, int x, int y)
1069 {
1070 draw_circle(dr, x+PEGRAD, y+PEGRAD, PEGRAD+CGAP, -1, COL_CURSOR);
1071
1072 draw_update(dr, x-CGAP, y-CGAP, PEGSZ+CGAP*2, PEGSZ+CGAP*2);
1073 }
1074
1075 static void guess_redraw(drawing *dr, game_drawstate *ds, int guess,
1076 pegrow src, int *holds, int cur_col, int force,
1077 int labelled)
1078 {
1079 pegrow dest;
1080 int rowx, rowy, i, scol;
1081
1082 if (guess == -1) {
1083 dest = ds->solution;
1084 rowx = SOLN_OX;
1085 rowy = SOLN_OY;
1086 } else {
1087 dest = ds->guesses[guess];
1088 rowx = GUESS_X(guess,0);
1089 rowy = GUESS_Y(guess,0);
1090 }
1091 if (src) assert(src->npegs == dest->npegs);
1092
1093 for (i = 0; i < dest->npegs; i++) {
1094 scol = src ? src->pegs[i] : 0;
1095 if (i == cur_col)
1096 scol |= 0x1000;
1097 if (holds && holds[i])
1098 scol |= 0x2000;
1099 if (labelled)
1100 scol |= 0x4000;
1101 if ((dest->pegs[i] != scol) || force) {
1102 draw_peg(dr, ds, rowx + PEGOFF * i, rowy, FALSE, labelled,
1103 scol &~ 0x7000);
1104 /*
1105 * Hold marker.
1106 */
1107 draw_rect(dr, rowx + PEGOFF * i, rowy + PEGSZ + ds->gapsz/2,
1108 PEGSZ, 2, (scol & 0x2000 ? COL_HOLD : COL_BACKGROUND));
1109 draw_update(dr, rowx + PEGOFF * i, rowy + PEGSZ + ds->gapsz/2,
1110 PEGSZ, 2);
1111 if (scol & 0x1000)
1112 draw_cursor(dr, ds, rowx + PEGOFF * i, rowy);
1113 }
1114 dest->pegs[i] = scol;
1115 }
1116 }
1117
1118 static void hint_redraw(drawing *dr, game_drawstate *ds, int guess,
1119 pegrow src, int force, int cursor, int markable)
1120 {
1121 pegrow dest = ds->guesses[guess];
1122 int rowx, rowy, i, scol, col, hintlen;
1123 int need_redraw;
1124 int emptycol = (markable ? COL_FLASH : COL_EMPTY);
1125
1126 if (src) assert(src->npegs == dest->npegs);
1127
1128 hintlen = (dest->npegs + 1)/2;
1129
1130 /*
1131 * Because of the possible presence of the cursor around this
1132 * entire section, we redraw all or none of it but never part.
1133 */
1134 need_redraw = FALSE;
1135
1136 for (i = 0; i < dest->npegs; i++) {
1137 scol = src ? src->feedback[i] : 0;
1138 if (i == 0 && cursor)
1139 scol |= 0x1000;
1140 if (i == 0 && markable)
1141 scol |= 0x2000;
1142 if ((scol != dest->feedback[i]) || force) {
1143 need_redraw = TRUE;
1144 }
1145 dest->feedback[i] = scol;
1146 }
1147
1148 if (need_redraw) {
1149 int hinth = HINTSZ + GAP + HINTSZ;
1150 int hx,hy,hw,hh;
1151
1152 hx = HINT_X(guess)-GAP; hy = HINT_Y(guess)-GAP;
1153 hw = HINT_W+GAP*2; hh = hinth+GAP*2;
1154
1155 /* erase a large background rectangle */
1156 draw_rect(dr, hx, hy, hw, hh, COL_BACKGROUND);
1157
1158 for (i = 0; i < dest->npegs; i++) {
1159 scol = src ? src->feedback[i] : 0;
1160 col = ((scol == FEEDBACK_CORRECTPLACE) ? COL_CORRECTPLACE :
1161 (scol == FEEDBACK_CORRECTCOLOUR) ? COL_CORRECTCOLOUR :
1162 emptycol);
1163
1164 rowx = HINT_X(guess);
1165 rowy = HINT_Y(guess);
1166 if (i < hintlen) {
1167 rowx += HINTOFF * i;
1168 } else {
1169 rowx += HINTOFF * (i - hintlen);
1170 rowy += HINTOFF;
1171 }
1172 if (HINTRAD > 0) {
1173 draw_circle(dr, rowx+HINTRAD, rowy+HINTRAD, HINTRAD, col,
1174 (col == emptycol ? emptycol : COL_FRAME));
1175 } else {
1176 draw_rect(dr, rowx, rowy, HINTSZ, HINTSZ, col);
1177 }
1178 }
1179 if (cursor) {
1180 int x1,y1,x2,y2;
1181 x1 = hx + CGAP; y1 = hy + CGAP;
1182 x2 = hx + hw - CGAP; y2 = hy + hh - CGAP;
1183 draw_line(dr, x1, y1, x2, y1, COL_CURSOR);
1184 draw_line(dr, x2, y1, x2, y2, COL_CURSOR);
1185 draw_line(dr, x2, y2, x1, y2, COL_CURSOR);
1186 draw_line(dr, x1, y2, x1, y1, COL_CURSOR);
1187 }
1188
1189 draw_update(dr, hx, hy, hw, hh);
1190 }
1191 }
1192
1193 static void currmove_redraw(drawing *dr, game_drawstate *ds, int guess, int col)
1194 {
1195 int ox = GUESS_X(guess, 0), oy = GUESS_Y(guess, 0), off = PEGSZ/4;
1196
1197 draw_rect(dr, ox-off-1, oy, 2, PEGSZ, col);
1198 draw_update(dr, ox-off-1, oy, 2, PEGSZ);
1199 }
1200
1201 static void game_redraw(drawing *dr, game_drawstate *ds, game_state *oldstate,
1202 game_state *state, int dir, game_ui *ui,
1203 float animtime, float flashtime)
1204 {
1205 int i, new_move, last_go;
1206
1207 new_move = (state->next_go != ds->next_go) || !ds->started;
1208 last_go = (state->next_go == state->params.nguesses-1);
1209
1210 if (!ds->started) {
1211 draw_rect(dr, 0, 0, ds->w, ds->h, COL_BACKGROUND);
1212 draw_rect(dr, SOLN_OX, SOLN_OY - ds->gapsz - 1, SOLN_W, 2, COL_FRAME);
1213 draw_update(dr, 0, 0, ds->w, ds->h);
1214 }
1215
1216 if (ds->drag_col != 0) {
1217 debug(("Loading from blitter."));
1218 blitter_load(dr, ds->blit_peg, ds->blit_ox, ds->blit_oy);
1219 draw_update(dr, ds->blit_ox, ds->blit_oy, PEGSZ, PEGSZ);
1220 }
1221
1222 /* draw the colours */
1223 for (i = 0; i < state->params.ncolours; i++) {
1224 int val = i+1;
1225 if (ui->display_cur && ui->colour_cur == i)
1226 val |= 0x1000;
1227 if (ui->show_labels)
1228 val |= 0x2000;
1229 if (ds->colours->pegs[i] != val) {
1230 draw_peg(dr, ds, COL_X(i), COL_Y(i), FALSE, ui->show_labels, i+1);
1231 if (val & 0x1000)
1232 draw_cursor(dr, ds, COL_X(i), COL_Y(i));
1233 ds->colours->pegs[i] = val;
1234 }
1235 }
1236
1237 /* draw the guesses (so far) and the hints
1238 * (in reverse order to avoid trampling holds) */
1239 for (i = state->params.nguesses - 1; i >= 0; i--) {
1240 if (state->next_go > i || state->solved) {
1241 /* this info is stored in the game_state already */
1242 guess_redraw(dr, ds, i, state->guesses[i], NULL, -1, 0,
1243 ui->show_labels);
1244 hint_redraw(dr, ds, i, state->guesses[i],
1245 i == (state->next_go-1) ? 1 : 0, FALSE, FALSE);
1246 } else if (state->next_go == i) {
1247 /* this is the one we're on; the (incomplete) guess is
1248 * stored in the game_ui. */
1249 guess_redraw(dr, ds, i, ui->curr_pegs,
1250 ui->holds, ui->display_cur ? ui->peg_cur : -1, 0,
1251 ui->show_labels);
1252 hint_redraw(dr, ds, i, NULL, 1,
1253 ui->display_cur && ui->peg_cur == state->params.npegs,
1254 ui->markable);
1255 } else {
1256 /* we've not got here yet; it's blank. */
1257 guess_redraw(dr, ds, i, NULL, NULL, -1, 0, ui->show_labels);
1258 hint_redraw(dr, ds, i, NULL, 0, FALSE, FALSE);
1259 }
1260 }
1261
1262 /* draw the 'current move' and 'able to mark' sign. */
1263 if (new_move)
1264 currmove_redraw(dr, ds, ds->next_go, COL_BACKGROUND);
1265 if (!state->solved)
1266 currmove_redraw(dr, ds, state->next_go, COL_HOLD);
1267
1268 /* draw the solution (or the big rectangle) */
1269 if ((state->solved != ds->solved) || !ds->started) {
1270 draw_rect(dr, SOLN_OX, SOLN_OY, SOLN_W, SOLN_H,
1271 state->solved ? COL_BACKGROUND : COL_EMPTY);
1272 draw_update(dr, SOLN_OX, SOLN_OY, SOLN_W, SOLN_H);
1273 }
1274 if (state->solved)
1275 guess_redraw(dr, ds, -1, state->solution, NULL, -1, !ds->solved,
1276 ui->show_labels);
1277 ds->solved = state->solved;
1278
1279 ds->next_go = state->next_go;
1280
1281 /* if ui->drag_col != 0, save the screen to the blitter,
1282 * draw the peg where we saved, and set ds->drag_* == ui->drag_*. */
1283 if (ui->drag_col != 0) {
1284 int ox = ui->drag_x - (PEGSZ/2);
1285 int oy = ui->drag_y - (PEGSZ/2);
1286 debug(("Saving to blitter at (%d,%d)", ox, oy));
1287 blitter_save(dr, ds->blit_peg, ox, oy);
1288 draw_peg(dr, ds, ox, oy, TRUE, ui->show_labels, ui->drag_col);
1289
1290 ds->blit_ox = ox; ds->blit_oy = oy;
1291 }
1292 ds->drag_col = ui->drag_col;
1293
1294 ds->started = 1;
1295 }
1296
1297 static float game_anim_length(game_state *oldstate, game_state *newstate,
1298 int dir, game_ui *ui)
1299 {
1300 return 0.0F;
1301 }
1302
1303 static float game_flash_length(game_state *oldstate, game_state *newstate,
1304 int dir, game_ui *ui)
1305 {
1306 return 0.0F;
1307 }
1308
1309 static int game_timing_state(game_state *state, game_ui *ui)
1310 {
1311 return TRUE;
1312 }
1313
1314 static void game_print_size(game_params *params, float *x, float *y)
1315 {
1316 }
1317
1318 static void game_print(drawing *dr, game_state *state, int tilesize)
1319 {
1320 }
1321
1322 #ifdef COMBINED
1323 #define thegame guess
1324 #endif
1325
1326 const struct game thegame = {
1327 "Guess", "games.guess",
1328 default_params,
1329 game_fetch_preset,
1330 decode_params,
1331 encode_params,
1332 free_params,
1333 dup_params,
1334 TRUE, game_configure, custom_params,
1335 validate_params,
1336 new_game_desc,
1337 validate_desc,
1338 new_game,
1339 dup_game,
1340 free_game,
1341 TRUE, solve_game,
1342 FALSE, game_text_format,
1343 new_ui,
1344 free_ui,
1345 encode_ui,
1346 decode_ui,
1347 game_changed_state,
1348 interpret_move,
1349 execute_move,
1350 PEG_PREFER_SZ, game_compute_size, game_set_size,
1351 game_colours,
1352 game_new_drawstate,
1353 game_free_drawstate,
1354 game_redraw,
1355 game_anim_length,
1356 game_flash_length,
1357 FALSE, FALSE, game_print_size, game_print,
1358 FALSE, /* wants_statusbar */
1359 FALSE, game_timing_state,
1360 0, /* flags */
1361 };
1362
1363 /* vim: set shiftwidth=4 tabstop=8: */