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