2 * guess.c: Mastermind clone.
14 #define FLASH_FRAME 0.5F
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
,
26 int ncolours
, npegs
, nguesses
;
27 int allow_blank
, allow_multiple
;
30 #define FEEDBACK_CORRECTPLACE 1
31 #define FEEDBACK_CORRECTCOLOUR 2
33 typedef struct pegrow
{
35 int *pegs
; /* 0 is 'empty' */
36 int *feedback
; /* may well be unused */
41 pegrow
*guesses
; /* length params->nguesses */
43 int next_go
; /* from 0 to nguesses-1;
44 if next_go == nguesses then they've lost. */
48 static game_params
*default_params(void)
50 game_params
*ret
= snew(game_params
);
52 /* AFAIK this is the canonical Mastermind ruleset. */
58 ret
->allow_multiple
= 1;
63 static int game_fetch_preset(int i
, char **name
, game_params
**params
)
68 static void free_params(game_params
*params
)
73 static game_params
*dup_params(game_params
*params
)
75 game_params
*ret
= snew(game_params
);
76 *ret
= *params
; /* structure copy */
80 static void decode_params(game_params
*params
, char const *string
)
82 char const *p
= string
;
83 game_params
*defs
= default_params();
85 *params
= *defs
; free_params(defs
);
90 params
->ncolours
= atoi(p
);
91 while (*p
&& isdigit((unsigned char)*p
)) p
++;
95 params
->npegs
= atoi(p
);
96 while (*p
&& isdigit((unsigned char)*p
)) p
++;
100 params
->nguesses
= atoi(p
);
101 while (*p
&& isdigit((unsigned char)*p
)) p
++;
105 params
->allow_blank
= 1;
109 params
->allow_blank
= 0;
113 params
->allow_multiple
= 1;
117 params
->allow_multiple
= 0;
126 static char *encode_params(game_params
*params
, int full
)
130 sprintf(data
, "c%dp%dg%d%s%s",
131 params
->ncolours
, params
->npegs
, params
->nguesses
,
132 params
->allow_blank ?
"b" : "B", params
->allow_multiple ?
"m" : "M");
137 static config_item
*game_configure(game_params
*params
)
142 ret
= snewn(6, config_item
);
144 ret
[0].name
= "Colours";
145 ret
[0].type
= C_STRING
;
146 sprintf(buf
, "%d", params
->ncolours
);
147 ret
[0].sval
= dupstr(buf
);
150 ret
[1].name
= "Pegs per guess";
151 ret
[1].type
= C_STRING
;
152 sprintf(buf
, "%d", params
->npegs
);
153 ret
[1].sval
= dupstr(buf
);
156 ret
[2].name
= "Guesses";
157 ret
[2].type
= C_STRING
;
158 sprintf(buf
, "%d", params
->nguesses
);
159 ret
[2].sval
= dupstr(buf
);
162 ret
[3].name
= "Allow blanks";
163 ret
[3].type
= C_BOOLEAN
;
165 ret
[3].ival
= params
->allow_blank
;
167 ret
[4].name
= "Allow duplicates";
168 ret
[4].type
= C_BOOLEAN
;
170 ret
[4].ival
= params
->allow_multiple
;
180 static game_params
*custom_params(config_item
*cfg
)
182 game_params
*ret
= snew(game_params
);
184 ret
->ncolours
= atoi(cfg
[0].sval
);
185 ret
->npegs
= atoi(cfg
[1].sval
);
186 ret
->nguesses
= atoi(cfg
[2].sval
);
188 ret
->allow_blank
= cfg
[3].ival
;
189 ret
->allow_multiple
= cfg
[4].ival
;
194 static char *validate_params(game_params
*params
)
196 if (params
->ncolours
< 2 || params
->npegs
< 2)
197 return "Trivial solutions are uninteresting";
198 /* NB as well as the no. of colours we define, max(ncolours) must
199 * also fit in an unsigned char; see new_game_desc. */
200 if (params
->ncolours
> 10)
201 return "Too many colours";
202 if (params
->nguesses
< 1)
203 return "Must have at least one guess";
204 if (!params
->allow_multiple
&& params
->ncolours
< params
->npegs
)
205 return "Disallowing multiple colours requires at least as many colours as pegs";
209 static pegrow
new_pegrow(int npegs
)
211 pegrow pegs
= snew(struct pegrow
);
214 pegs
->pegs
= snewn(pegs
->npegs
, int);
215 memset(pegs
->pegs
, 0, pegs
->npegs
* sizeof(int));
216 pegs
->feedback
= snewn(pegs
->npegs
, int);
217 memset(pegs
->feedback
, 0, pegs
->npegs
* sizeof(int));
222 static pegrow
dup_pegrow(pegrow pegs
)
224 pegrow newpegs
= new_pegrow(pegs
->npegs
);
226 memcpy(newpegs
->pegs
, pegs
->pegs
, newpegs
->npegs
* sizeof(int));
227 memcpy(newpegs
->feedback
, pegs
->feedback
, newpegs
->npegs
* sizeof(int));
232 static void invalidate_pegrow(pegrow pegs
)
234 memset(pegs
->pegs
, -1, pegs
->npegs
* sizeof(int));
235 memset(pegs
->feedback
, -1, pegs
->npegs
* sizeof(int));
238 static void free_pegrow(pegrow pegs
)
241 sfree(pegs
->feedback
);
245 static char *new_game_desc(game_params
*params
, random_state
*rs
,
246 game_aux_info
**aux
, int interactive
)
248 unsigned char *bmp
= snewn(params
->npegs
, unsigned char);
251 pegrow colcount
= new_pegrow(params
->ncolours
);
253 for (i
= 0; i
< params
->npegs
; i
++) {
255 c
= random_upto(rs
, params
->ncolours
);
256 if (!params
->allow_multiple
&& colcount
->pegs
[c
]) goto newcol
;
258 bmp
[i
] = (unsigned char)(c
+1);
260 obfuscate_bitmap(bmp
, params
->npegs
*8, FALSE
);
262 ret
= bin2hex(bmp
, params
->npegs
);
264 free_pegrow(colcount
);
268 static void game_free_aux_info(game_aux_info
*aux
)
270 assert(!"Shouldn't happen");
273 static char *validate_desc(game_params
*params
, char *desc
)
278 /* desc is just an (obfuscated) bitmap of the solution; check that
279 * it's the correct length and (when unobfuscated) contains only
280 * sensible colours. */
281 if (strlen(desc
) != params
->npegs
* 2)
282 return "Game description is wrong length";
283 bmp
= hex2bin(desc
, params
->npegs
);
284 obfuscate_bitmap(bmp
, params
->npegs
*8, TRUE
);
285 for (i
= 0; i
< params
->npegs
; i
++) {
286 if (bmp
[i
] < 1 || bmp
[i
] > params
->ncolours
) {
288 return "Game description is corrupted";
296 static game_state
*new_game(midend_data
*me
, game_params
*params
, char *desc
)
298 game_state
*state
= snew(game_state
);
302 state
->params
= *params
;
303 state
->guesses
= snewn(params
->nguesses
, pegrow
);
304 for (i
= 0; i
< params
->nguesses
; i
++)
305 state
->guesses
[i
] = new_pegrow(params
->npegs
);
306 state
->solution
= new_pegrow(params
->npegs
);
308 bmp
= hex2bin(desc
, params
->npegs
);
309 obfuscate_bitmap(bmp
, params
->npegs
*8, TRUE
);
310 for (i
= 0; i
< params
->npegs
; i
++)
311 state
->solution
->pegs
[i
] = (int)bmp
[i
];
314 state
->next_go
= state
->solved
= 0;
319 static game_state
*dup_game(game_state
*state
)
321 game_state
*ret
= snew(game_state
);
326 ret
->guesses
= snewn(state
->params
.nguesses
, pegrow
);
327 for (i
= 0; i
< state
->params
.nguesses
; i
++)
328 ret
->guesses
[i
] = dup_pegrow(state
->guesses
[i
]);
329 ret
->solution
= dup_pegrow(state
->solution
);
334 static void free_game(game_state
*state
)
338 free_pegrow(state
->solution
);
339 for (i
= 0; i
< state
->params
.nguesses
; i
++)
340 free_pegrow(state
->guesses
[i
]);
341 sfree(state
->guesses
);
346 static game_state
*solve_game(game_state
*state
, game_state
*currstate
,
347 game_aux_info
*aux
, char **error
)
349 game_state
*ret
= dup_game(currstate
);
354 static char *game_text_format(game_state
*state
)
360 pegrow curr_pegs
; /* half-finished current move */
362 int colour_cur
; /* position of up-down colour picker cursor */
363 int peg_cur
; /* position of left-right peg picker cursor */
364 int display_cur
, markable
;
366 int drag_col
, drag_x
, drag_y
; /* x and y are *center* of peg! */
367 int drag_opeg
; /* peg index, if dragged from a peg (from current guess), otherwise -1 */
370 static game_ui
*new_ui(game_state
*state
)
372 game_ui
*ui
= snew(struct game_ui
);
373 memset(ui
, 0, sizeof(struct game_ui
));
374 ui
->curr_pegs
= new_pegrow(state
->params
.npegs
);
375 ui
->holds
= snewn(state
->params
.npegs
, int);
376 memset(ui
->holds
, 0, sizeof(int)*state
->params
.npegs
);
381 static void free_ui(game_ui
*ui
)
383 free_pegrow(ui
->curr_pegs
);
388 static void game_changed_state(game_ui
*ui
, game_state
*oldstate
,
389 game_state
*newstate
)
393 /* just clear the row-in-progress when we have an undo/redo. */
394 for (i
= 0; i
< ui
->curr_pegs
->npegs
; i
++)
395 ui
->curr_pegs
->pegs
[i
] = 0;
398 #define PEGSZ (ds->pegsz)
399 #define PEGOFF (ds->pegsz + ds->gapsz)
400 #define HINTSZ (ds->hintsz)
401 #define HINTOFF (ds->hintsz + ds->gapsz)
403 #define PEGRAD (ds->pegrad)
404 #define HINTRAD (ds->hintrad)
406 #define COL_OX (ds->colx)
407 #define COL_OY (ds->coly)
408 #define COL_X(c) (COL_OX)
409 #define COL_Y(c) (COL_OY + (c)*PEGOFF)
411 #define COL_H (ds->colours->npegs*PEGOFF)
413 #define GUESS_OX (ds->guessx)
414 #define GUESS_OY (ds->guessy)
415 #define GUESS_X(g,p) (GUESS_OX + (p)*PEGOFF)
416 #define GUESS_Y(g,p) (GUESS_OY + (g)*PEGOFF)
417 #define GUESS_W (ds->solution->npegs*PEGOFF)
418 #define GUESS_H (ds->nguesses*PEGOFF)
420 #define HINT_OX (GUESS_OX + GUESS_W + ds->gapsz)
421 #define HINT_OY (GUESS_OY + (PEGSZ - HINTOFF - HINTSZ) / 2)
422 #define HINT_X(g) HINT_OX
423 #define HINT_Y(g) (HINT_OY + (g)*PEGOFF)
424 #define HINT_W (ds->hintw*HINTOFF)
425 #define HINT_H GUESS_H
427 #define SOLN_OX GUESS_OX
428 #define SOLN_OY (GUESS_OY + GUESS_H + ds->gapsz + 2)
429 #define SOLN_W GUESS_W
430 #define SOLN_H PEGOFF
432 struct game_drawstate
{
434 pegrow
*guesses
; /* same size as state->guesses */
435 pegrow solution
; /* only displayed if state->solved */
436 pegrow colours
; /* length ncolours, not npegs */
440 int pegsz
, hintsz
, gapsz
; /* peg size (diameter), etc. */
441 int pegrad
, hintrad
; /* radius of peg, hint */
443 int colx
, coly
; /* origin of colours vertical bar */
444 int guessx
, guessy
; /* origin of guesses */
445 int solnx
, solny
; /* origin of solution */
446 int hintw
; /* no. of hint tiles we're wide per row */
447 int w
, h
, started
, solved
;
449 int colour_cur
, peg_cur
, display_cur
; /* as in game_ui. */
453 int drag_col
, blit_ox
, blit_oy
;
456 static int is_markable(game_params
*params
, pegrow pegs
)
458 int i
, nset
= 0, nrequired
, ret
= 0;
459 pegrow colcount
= new_pegrow(params
->ncolours
);
461 nrequired
= params
->allow_blank ?
1 : params
->npegs
;
463 for (i
= 0; i
< params
->npegs
; i
++) {
464 int c
= pegs
->pegs
[i
];
466 colcount
->pegs
[c
-1]++;
470 if (nset
< nrequired
) goto done
;
472 if (!params
->allow_multiple
) {
473 for (i
= 0; i
< params
->ncolours
; i
++) {
474 if (colcount
->pegs
[i
] > 1) goto done
;
479 free_pegrow(colcount
);
483 static void set_peg(game_params
*params
, game_ui
*ui
, int peg
, int col
)
485 ui
->curr_pegs
->pegs
[peg
] = col
;
486 ui
->markable
= is_markable(params
, ui
->curr_pegs
);
489 static int mark_pegs(pegrow guess
, pegrow solution
, int ncols
)
491 int nc_place
= 0, nc_colour
= 0, i
, j
;
493 assert(guess
&& solution
&& (guess
->npegs
== solution
->npegs
));
495 for (i
= 0; i
< guess
->npegs
; i
++) {
496 if (guess
->pegs
[i
] == solution
->pegs
[i
]) nc_place
++;
499 /* slight bit of cleverness: we have the following formula, from
500 * http://mathworld.wolfram.com/Mastermind.html that gives:
502 * nc_colour = sum(colours, min(#solution, #guess)) - nc_place
504 * I think this is due to Knuth.
506 for (i
= 1; i
<= ncols
; i
++) {
507 int n_guess
= 0, n_solution
= 0;
508 for (j
= 0; j
< guess
->npegs
; j
++) {
509 if (guess
->pegs
[j
] == i
) n_guess
++;
510 if (solution
->pegs
[j
] == i
) n_solution
++;
512 nc_colour
+= min(n_guess
, n_solution
);
514 nc_colour
-= nc_place
;
516 debug(("mark_pegs, %d pegs, %d right place, %d right colour",
517 guess
->npegs
, nc_place
, nc_colour
));
518 assert((nc_colour
+ nc_place
) <= guess
->npegs
);
520 memset(guess
->feedback
, 0, guess
->npegs
*sizeof(int));
521 for (i
= 0, j
= 0; i
< nc_place
; i
++)
522 guess
->feedback
[j
++] = FEEDBACK_CORRECTPLACE
;
523 for (i
= 0; i
< nc_colour
; i
++)
524 guess
->feedback
[j
++] = FEEDBACK_CORRECTCOLOUR
;
529 static game_state
*mark_move(game_state
*from
, game_ui
*ui
)
531 int i
, ncleared
= 0, nc_place
;
532 game_state
*to
= dup_game(from
);
534 for (i
= 0; i
< to
->solution
->npegs
; i
++) {
535 to
->guesses
[from
->next_go
]->pegs
[i
] = ui
->curr_pegs
->pegs
[i
];
537 nc_place
= mark_pegs(to
->guesses
[from
->next_go
], to
->solution
, to
->params
.ncolours
);
539 if (nc_place
== to
->solution
->npegs
) {
540 to
->solved
= 1; /* win! */
542 to
->next_go
= from
->next_go
+ 1;
543 if (to
->next_go
>= to
->params
.nguesses
)
544 to
->solved
= 1; /* 'lose' so we show the pegs. */
547 for (i
= 0; i
< to
->solution
->npegs
; i
++) {
548 if (!ui
->holds
[i
] || to
->solved
) {
549 ui
->curr_pegs
->pegs
[i
] = 0;
552 if (to
->solved
) ui
->holds
[i
] = 0;
554 ui
->markable
= is_markable(&from
->params
, ui
->curr_pegs
);
555 if (!ui
->markable
&& ui
->peg_cur
== to
->solution
->npegs
)
561 static game_state
*make_move(game_state
*from
, game_ui
*ui
, game_drawstate
*ds
,
562 int x
, int y
, int button
)
564 int over_col
= 0; /* one-indexed */
565 int over_guess
= -1; /* zero-indexed */
566 int over_past_guess_y
= -1; /* zero-indexed */
567 int over_past_guess_x
= -1; /* zero-indexed */
568 int over_hint
= 0; /* zero or one */
569 game_state
*ret
= NULL
;
571 int guess_ox
= GUESS_X(from
->next_go
, 0);
572 int guess_oy
= GUESS_Y(from
->next_go
, 0);
574 if (from
->solved
) return NULL
;
576 if (x
>= COL_OX
&& x
<= (COL_OX
+ COL_W
) &&
577 y
>= COL_OY
&& y
<= (COL_OY
+ COL_H
)) {
578 over_col
= ((y
- COL_OY
) / PEGOFF
) + 1;
579 } else if (x
>= guess_ox
&&
580 y
>= guess_oy
&& y
<= (guess_oy
+ GUESS_H
)) {
581 if (x
<= (guess_ox
+ GUESS_W
)) {
582 over_guess
= (x
- guess_ox
) / PEGOFF
;
586 } else if (x
>= guess_ox
&&
587 y
>= GUESS_OY
&& y
< guess_oy
) {
588 over_past_guess_y
= (y
- GUESS_OY
) / PEGOFF
;
589 over_past_guess_x
= (x
- guess_ox
) / PEGOFF
;
591 debug(("make_move: over_col %d, over_guess %d, over_hint %d,"
592 " over_past_guess (%d,%d)", over_col
, over_guess
, over_hint
,
593 over_past_guess_x
, over_past_guess_y
));
595 assert(ds
->blit_peg
);
598 if (button
== LEFT_BUTTON
) {
600 ui
->drag_col
= over_col
;
602 debug(("Start dragging from colours"));
603 } else if (over_guess
> -1) {
604 int col
= ui
->curr_pegs
->pegs
[over_guess
];
607 ui
->drag_opeg
= over_guess
;
608 debug(("Start dragging from a guess"));
610 } else if (over_past_guess_y
> -1) {
612 from
->guesses
[over_past_guess_y
]->pegs
[over_past_guess_x
];
616 debug(("Start dragging from a past guess"));
622 debug(("Start dragging, col = %d, (%d,%d)",
623 ui
->drag_col
, ui
->drag_x
, ui
->drag_y
));
626 } else if (button
== LEFT_DRAG
&& ui
->drag_col
) {
629 debug(("Keep dragging, (%d,%d)", ui
->drag_x
, ui
->drag_y
));
631 } else if (button
== LEFT_RELEASE
&& ui
->drag_col
) {
632 if (over_guess
> -1) {
633 debug(("Dropping colour %d onto guess peg %d",
634 ui
->drag_col
, over_guess
));
635 set_peg(&from
->params
, ui
, over_guess
, ui
->drag_col
);
637 if (ui
->drag_opeg
> -1) {
638 debug(("Removing colour %d from peg %d",
639 ui
->drag_col
, ui
->drag_opeg
));
640 set_peg(&from
->params
, ui
, ui
->drag_opeg
, 0);
645 debug(("Stop dragging."));
647 } else if (button
== RIGHT_BUTTON
) {
648 if (over_guess
> -1) {
649 /* we use ths feedback in the game_ui to signify
650 * 'carry this peg to the next guess as well'. */
651 ui
->holds
[over_guess
] = 1 - ui
->holds
[over_guess
];
654 } else if (button
== LEFT_RELEASE
&& over_hint
&& ui
->markable
) {
655 /* NB this won't trigger if on the end of a drag; that's on
656 * purpose, in case you drop by mistake... */
657 ret
= mark_move(from
, ui
);
661 if (button
== CURSOR_UP
|| button
== CURSOR_DOWN
) {
663 if (button
== CURSOR_DOWN
&& (ui
->colour_cur
+1) < from
->params
.ncolours
)
665 if (button
== CURSOR_UP
&& ui
->colour_cur
> 0)
668 } else if (button
== CURSOR_LEFT
|| button
== CURSOR_RIGHT
) {
669 int maxcur
= from
->params
.npegs
;
670 if (ui
->markable
) maxcur
++;
673 if (button
== CURSOR_RIGHT
&& (ui
->peg_cur
+1) < maxcur
)
675 if (button
== CURSOR_LEFT
&& ui
->peg_cur
> 0)
678 } else if (button
== CURSOR_SELECT
|| button
== ' ' || button
== '\r' ||
680 if (ui
->peg_cur
== from
->params
.npegs
) {
681 ret
= mark_move(from
, ui
);
683 set_peg(&from
->params
, ui
, ui
->peg_cur
, ui
->colour_cur
+1);
686 } else if (button
== 'H' || button
== 'h') {
687 ui
->holds
[ui
->peg_cur
] = 1 - ui
->holds
[ui
->peg_cur
];
693 /* ----------------------------------------------------------------------
697 #define PEG_PREFER_SZ 32
699 /* next three are multipliers for pegsz. It will look much nicer if
700 * (2*PEG_HINT) + PEG_GAP = 1.0 as the hints are formatted like that. */
702 #define PEG_HINT 0.35
706 static void game_size(game_params
*params
, game_drawstate
*ds
,
707 int *x
, int *y
, int expand
)
709 double hmul
, vmul_c
, vmul_g
, vmul
, szx
, szy
;
710 int sz
, colh
, guessh
;
712 hmul
= BORDER
* 2.0 + /* border */
713 1.0 * 2.0 + /* vertical colour bar */
714 1.0 * params
->npegs
+ /* guess pegs */
715 PEG_GAP
* params
->npegs
+ /* guess gaps */
716 PEG_HINT
* ds
->hintw
+ /* hint pegs */
717 PEG_GAP
* (ds
->hintw
- 1); /* hint gaps */
719 vmul_c
= BORDER
* 2.0 + /* border */
720 1.0 * params
->ncolours
+ /* colour pegs */
721 PEG_GAP
* (params
->ncolours
- 1); /* colour gaps */
723 vmul_g
= BORDER
* 2.0 + /* border */
724 1.0 * (params
->nguesses
+ 1) + /* guesses plus solution */
725 PEG_GAP
* (params
->nguesses
+ 1); /* gaps plus gap above soln */
727 vmul
= max(vmul_c
, vmul_g
);
731 sz
= max(min((int)szx
, (int)szy
), 1);
735 ds
->pegsz
= min(sz
, PEG_PREFER_SZ
);
737 ds
->hintsz
= (int)((double)ds
->pegsz
* PEG_HINT
);
738 ds
->gapsz
= (int)((double)ds
->pegsz
* PEG_GAP
);
739 ds
->border
= (int)((double)ds
->pegsz
* BORDER
);
741 ds
->pegrad
= (ds
->pegsz
-1)/2; /* radius of peg to fit in pegsz (which is 2r+1) */
742 ds
->hintrad
= (ds
->hintsz
-1)/2;
744 *x
= (int)ceil((double)ds
->pegsz
* hmul
);
745 *y
= (int)ceil((double)ds
->pegsz
* vmul
);
746 ds
->w
= *x
; ds
->h
= *y
;
748 colh
= ((ds
->pegsz
+ ds
->gapsz
) * params
->ncolours
) - ds
->gapsz
;
749 guessh
= ((ds
->pegsz
+ ds
->gapsz
) * params
->nguesses
); /* guesses */
750 guessh
+= ds
->gapsz
+ ds
->pegsz
; /* solution */
752 ds
->colx
= ds
->border
;
753 ds
->coly
= (*y
- colh
) / 2;
755 ds
->guessx
= ds
->solnx
= ds
->border
+ ds
->pegsz
* 2; /* border + colours */
756 ds
->guessy
= (*y
- guessh
) / 2;
757 ds
->solny
= ds
->guessy
+ ((ds
->pegsz
+ ds
->gapsz
) * params
->nguesses
) + ds
->gapsz
;
760 if (ds
->blit_peg
) blitter_free(ds
->blit_peg
);
761 ds
->blit_peg
= blitter_new(ds
->pegsz
, ds
->pegsz
);
765 static float *game_colours(frontend
*fe
, game_state
*state
, int *ncolours
)
767 float *ret
= snewn(3 * NCOLOURS
, float);
769 frontend_default_colour(fe
, &ret
[COL_BACKGROUND
* 3]);
772 ret
[COL_1
* 3 + 0] = 1.0F
;
773 ret
[COL_1
* 3 + 1] = 0.0F
;
774 ret
[COL_1
* 3 + 2] = 0.0F
;
776 /* yellow (toned down a bit due to pale grey background) */
777 ret
[COL_2
* 3 + 0] = 0.7F
;
778 ret
[COL_2
* 3 + 1] = 0.7F
;
779 ret
[COL_2
* 3 + 2] = 0.0F
;
781 /* green (also toned down) */
782 ret
[COL_3
* 3 + 0] = 0.0F
;
783 ret
[COL_3
* 3 + 1] = 0.5F
;
784 ret
[COL_3
* 3 + 2] = 0.0F
;
787 ret
[COL_4
* 3 + 0] = 0.0F
;
788 ret
[COL_4
* 3 + 1] = 0.0F
;
789 ret
[COL_4
* 3 + 2] = 1.0F
;
792 ret
[COL_5
* 3 + 0] = 1.0F
;
793 ret
[COL_5
* 3 + 1] = 0.5F
;
794 ret
[COL_5
* 3 + 2] = 0.0F
;
797 ret
[COL_6
* 3 + 0] = 0.5F
;
798 ret
[COL_6
* 3 + 1] = 0.0F
;
799 ret
[COL_6
* 3 + 2] = 0.7F
;
802 ret
[COL_7
* 3 + 0] = 0.4F
;
803 ret
[COL_7
* 3 + 1] = 0.2F
;
804 ret
[COL_7
* 3 + 2] = 0.2F
;
807 ret
[COL_8
* 3 + 0] = 0.4F
;
808 ret
[COL_8
* 3 + 1] = 0.7F
;
809 ret
[COL_8
* 3 + 2] = 1.0F
;
812 ret
[COL_9
* 3 + 0] = 0.5F
;
813 ret
[COL_9
* 3 + 1] = 0.8F
;
814 ret
[COL_9
* 3 + 2] = 0.5F
;
817 ret
[COL_10
* 3 + 0] = 1.0F
;
818 ret
[COL_10
* 3 + 1] = 0.6F
;
819 ret
[COL_10
* 3 + 2] = 1.0F
;
821 ret
[COL_FRAME
* 3 + 0] = 0.0F
;
822 ret
[COL_FRAME
* 3 + 1] = 0.0F
;
823 ret
[COL_FRAME
* 3 + 2] = 0.0F
;
825 ret
[COL_CURSOR
* 3 + 0] = 0.0F
;
826 ret
[COL_CURSOR
* 3 + 1] = 0.0F
;
827 ret
[COL_CURSOR
* 3 + 2] = 0.0F
;
829 ret
[COL_FLASH
* 3 + 0] = 0.5F
;
830 ret
[COL_FLASH
* 3 + 1] = 1.0F
;
831 ret
[COL_FLASH
* 3 + 2] = 1.0F
;
833 ret
[COL_HOLD
* 3 + 0] = 1.0F
;
834 ret
[COL_HOLD
* 3 + 1] = 0.5F
;
835 ret
[COL_HOLD
* 3 + 2] = 0.5F
;
837 ret
[COL_EMPTY
* 3 + 0] = ret
[COL_BACKGROUND
* 3 + 0] * 2.0 / 3.0;
838 ret
[COL_EMPTY
* 3 + 1] = ret
[COL_BACKGROUND
* 3 + 1] * 2.0 / 3.0;
839 ret
[COL_EMPTY
* 3 + 2] = ret
[COL_BACKGROUND
* 3 + 2] * 2.0 / 3.0;
841 ret
[COL_CORRECTPLACE
*3 + 0] = 0.0F
;
842 ret
[COL_CORRECTPLACE
*3 + 1] = 0.0F
;
843 ret
[COL_CORRECTPLACE
*3 + 2] = 0.0F
;
845 ret
[COL_CORRECTCOLOUR
*3 + 0] = 1.0F
;
846 ret
[COL_CORRECTCOLOUR
*3 + 1] = 1.0F
;
847 ret
[COL_CORRECTCOLOUR
*3 + 2] = 1.0F
;
849 *ncolours
= NCOLOURS
;
853 static game_drawstate
*game_new_drawstate(game_state
*state
)
855 struct game_drawstate
*ds
= snew(struct game_drawstate
);
858 memset(ds
, 0, sizeof(struct game_drawstate
));
860 ds
->guesses
= snewn(state
->params
.nguesses
, pegrow
);
861 ds
->nguesses
= state
->params
.nguesses
;
862 for (i
= 0; i
< state
->params
.nguesses
; i
++) {
863 ds
->guesses
[i
] = new_pegrow(state
->params
.npegs
);
864 invalidate_pegrow(ds
->guesses
[i
]);
866 ds
->solution
= new_pegrow(state
->params
.npegs
);
867 invalidate_pegrow(ds
->solution
);
868 ds
->colours
= new_pegrow(state
->params
.ncolours
);
869 invalidate_pegrow(ds
->colours
);
871 ds
->hintw
= (state
->params
.npegs
+1)/2; /* must round up */
873 ds
->holds
= snewn(state
->params
.npegs
, int);
874 memset(ds
->holds
, 0, state
->params
.npegs
*sizeof(int));
881 static void game_free_drawstate(game_drawstate
*ds
)
885 if (ds
->blit_peg
) blitter_free(ds
->blit_peg
);
886 free_pegrow(ds
->colours
);
887 free_pegrow(ds
->solution
);
888 for (i
= 0; i
< ds
->nguesses
; i
++)
889 free_pegrow(ds
->guesses
[i
]);
895 static void draw_peg(frontend
*fe
, game_drawstate
*ds
, int cx
, int cy
,
899 * Some platforms antialias circles, which means we shouldn't
900 * overwrite a circle of one colour with a circle of another
901 * colour without erasing the background first. However, if the
902 * peg is the one being dragged, we don't erase the background
903 * because we _want_ it to alpha-blend nicely into whatever's
907 draw_rect(fe
, cx
-1, cy
-1, PEGSZ
+2, PEGSZ
+2, COL_BACKGROUND
);
909 draw_circle(fe
, cx
+PEGRAD
, cy
+PEGRAD
, PEGRAD
, 1, COL_EMPTY
+ col
);
910 draw_circle(fe
, cx
+PEGRAD
, cy
+PEGRAD
, PEGRAD
, 0, COL_EMPTY
+ col
);
912 draw_rect(fe
, cx
, cy
, PEGSZ
, PEGSZ
, COL_EMPTY
+ col
);
913 draw_update(fe
, cx
, cy
, PEGSZ
, PEGSZ
);
916 static void guess_redraw(frontend
*fe
, game_drawstate
*ds
, int guess
,
917 pegrow src
, int force
)
920 int rowx
, rowy
, i
, scol
;
927 dest
= ds
->guesses
[guess
];
928 rowx
= GUESS_X(guess
,0);
929 rowy
= GUESS_Y(guess
,0);
931 if (src
) assert(src
->npegs
== dest
->npegs
);
933 for (i
= 0; i
< dest
->npegs
; i
++) {
934 scol
= src ? src
->pegs
[i
] : 0;
935 if ((dest
->pegs
[i
] != scol
) || force
)
936 draw_peg(fe
, ds
, rowx
+ PEGOFF
* i
, rowy
, FALSE
, scol
);
937 dest
->pegs
[i
] = scol
;
941 static void hint_redraw(frontend
*fe
, game_drawstate
*ds
, int guess
,
942 pegrow src
, int force
, int emptycol
)
944 pegrow dest
= ds
->guesses
[guess
];
945 int rowx
, rowy
, i
, scol
, col
, hintlen
;
947 if (src
) assert(src
->npegs
== dest
->npegs
);
949 hintlen
= (dest
->npegs
+ 1)/2;
951 for (i
= 0; i
< dest
->npegs
; i
++) {
952 scol
= src ? src
->feedback
[i
] : 0;
953 col
= (scol
== FEEDBACK_CORRECTPLACE
) ? COL_CORRECTPLACE
:
954 (scol
== FEEDBACK_CORRECTCOLOUR
) ? COL_CORRECTCOLOUR
: emptycol
;
955 if ((scol
!= dest
->feedback
[i
]) || force
) {
956 rowx
= HINT_X(guess
);
957 rowy
= HINT_Y(guess
);
961 rowx
+= HINTOFF
* (i
- hintlen
);
964 /* erase background for antialiasing platforms */
965 draw_rect(fe
, rowx
-1, rowy
-1, HINTSZ
+2, HINTSZ
+2, COL_BACKGROUND
);
967 draw_circle(fe
, rowx
+HINTRAD
, rowy
+HINTRAD
, HINTRAD
, 1, col
);
968 draw_circle(fe
, rowx
+HINTRAD
, rowy
+HINTRAD
, HINTRAD
, 0, col
);
970 draw_rect(fe
, rowx
, rowy
, HINTSZ
, HINTSZ
, col
);
972 draw_update(fe
, rowx
, rowy
, HINTSZ
, HINTSZ
);
974 dest
->feedback
[i
] = scol
;
978 static void hold_redraw(frontend
*fe
, game_drawstate
*ds
, int guess
, int *src
, int force
)
980 int shold
, col
, ox
, oy
, i
;
982 if (guess
>= ds
->nguesses
)
985 for (i
= 0; i
< ds
->solution
->npegs
; i
++) {
986 shold
= src ? src
[i
] : 0;
987 col
= shold ? COL_HOLD
: COL_BACKGROUND
;
988 if ((shold
!= ds
->holds
[i
]) || force
) {
989 ox
= GUESS_X(guess
, i
);
990 oy
= GUESS_Y(guess
, i
) + PEGSZ
+ ds
->gapsz
/2;
992 draw_rect(fe
, ox
, oy
, PEGSZ
, 2, col
);
993 draw_update(fe
, ox
, oy
, PEGSZ
, 2);
995 if (src
) ds
->holds
[i
] = shold
;
999 static void currmove_redraw(frontend
*fe
, game_drawstate
*ds
, int guess
, int col
)
1001 int ox
= GUESS_X(guess
, 0), oy
= GUESS_Y(guess
, 0), off
= PEGSZ
/4;
1003 draw_rect(fe
, ox
-off
-1, oy
, 2, PEGSZ
, col
);
1004 draw_update(fe
, ox
-off
-1, oy
, 2, PEGSZ
);
1007 static void cur_redraw(frontend
*fe
, game_drawstate
*ds
,
1008 int x
, int y
, int erase
)
1010 int cgap
= ds
->gapsz
/ 2;
1012 draw_circle(fe
, x
+PEGRAD
, y
+PEGRAD
, PEGRAD
+cgap
, 0,
1013 erase ? COL_BACKGROUND
: COL_CURSOR
);
1015 draw_update(fe
, x
-cgap
, y
-cgap
, x
+PEGSZ
+cgap
, y
+PEGSZ
+cgap
);
1018 static void game_redraw(frontend
*fe
, game_drawstate
*ds
, game_state
*oldstate
,
1019 game_state
*state
, int dir
, game_ui
*ui
,
1020 float animtime
, float flashtime
)
1022 int i
, cur_erase
= 0, cur_draw
= 0, new_move
, last_go
;
1024 new_move
= (state
->next_go
!= ds
->next_go
) || !ds
->started
;
1025 last_go
= (state
->next_go
== state
->params
.nguesses
-1);
1028 draw_rect(fe
, 0, 0, ds
->w
, ds
->h
, COL_BACKGROUND
);
1029 draw_rect(fe
, SOLN_OX
, SOLN_OY
- ds
->gapsz
- 1, SOLN_W
, 2, COL_FRAME
);
1030 draw_update(fe
, 0, 0, ds
->w
, ds
->h
);
1033 if (ds
->drag_col
!= 0) {
1034 debug(("Loading from blitter."));
1035 blitter_load(fe
, ds
->blit_peg
, ds
->blit_ox
, ds
->blit_oy
);
1036 draw_update(fe
, ds
->blit_ox
, ds
->blit_oy
, PEGSZ
, PEGSZ
);
1039 /* draw the colours */
1040 for (i
= 0; i
< state
->params
.ncolours
; i
++) {
1041 if (ds
->colours
->pegs
[i
] != i
+1) {
1042 draw_peg(fe
, ds
, COL_X(i
), COL_Y(i
), FALSE
, i
+1);
1043 ds
->colours
->pegs
[i
] = i
+1;
1047 /* draw the guesses (so far) and the hints */
1048 for (i
= 0; i
< state
->params
.nguesses
; i
++) {
1049 if (state
->next_go
> i
|| state
->solved
) {
1050 /* this info is stored in the game_state already */
1051 guess_redraw(fe
, ds
, i
, state
->guesses
[i
], 0);
1052 hint_redraw(fe
, ds
, i
, state
->guesses
[i
],
1053 i
== (state
->next_go
-1) ?
1 : 0, COL_EMPTY
);
1054 } else if (state
->next_go
== i
) {
1055 /* this is the one we're on; the (incomplete) guess is
1056 * stored in the game_ui. */
1057 guess_redraw(fe
, ds
, i
, ui
->curr_pegs
, 0);
1058 hint_redraw(fe
, ds
, i
, NULL
, 1, ui
->markable ? COL_FLASH
: COL_EMPTY
);
1060 /* we've not got here yet; it's blank. */
1061 guess_redraw(fe
, ds
, i
, NULL
, 0);
1062 hint_redraw(fe
, ds
, i
, NULL
, 0, COL_EMPTY
);
1066 /* draw the 'hold' markers */
1067 if (state
->solved
) {
1068 hold_redraw(fe
, ds
, state
->next_go
, NULL
, 1);
1069 } else if (new_move
) {
1070 hold_redraw(fe
, ds
, ds
->next_go
, NULL
, 1);
1071 hold_redraw(fe
, ds
, state
->next_go
, last_go ? NULL
: ui
->holds
, 1);
1073 hold_redraw(fe
, ds
, state
->next_go
, last_go ? NULL
: ui
->holds
, 0);
1075 /* draw the 'current move' and 'able to mark' sign. */
1077 currmove_redraw(fe
, ds
, ds
->next_go
, COL_BACKGROUND
);
1079 currmove_redraw(fe
, ds
, state
->next_go
, COL_HOLD
);
1081 /* draw the solution (or the big rectangle) */
1082 if ((state
->solved
!= ds
->solved
) || !ds
->started
) {
1083 draw_rect(fe
, SOLN_OX
, SOLN_OY
, SOLN_W
, SOLN_H
,
1084 state
->solved ? COL_BACKGROUND
: COL_EMPTY
);
1085 draw_update(fe
, SOLN_OX
, SOLN_OY
, SOLN_W
, SOLN_H
);
1088 guess_redraw(fe
, ds
, -1, state
->solution
, !ds
->solved
);
1089 ds
->solved
= state
->solved
;
1091 if (ui
->display_cur
&& !ds
->display_cur
)
1093 else if (!ui
->display_cur
&& ds
->display_cur
)
1095 else if (ui
->display_cur
) {
1096 if ((state
->next_go
!= ds
->next_go
) ||
1097 (ui
->peg_cur
!= ds
->peg_cur
) ||
1098 (ui
->colour_cur
!= ds
->colour_cur
)) {
1104 cur_redraw(fe
, ds
, COL_X(ds
->colour_cur
), COL_Y(ds
->colour_cur
), 1);
1106 GUESS_X(ds
->next_go
, ds
->peg_cur
), GUESS_Y(ds
->next_go
, ds
->peg_cur
), 1);
1109 cur_redraw(fe
, ds
, COL_X(ui
->colour_cur
), COL_Y(ui
->colour_cur
), 0);
1111 GUESS_X(state
->next_go
, ui
->peg_cur
), GUESS_Y(state
->next_go
, ui
->peg_cur
), 0);
1113 ds
->display_cur
= ui
->display_cur
;
1114 ds
->peg_cur
= ui
->peg_cur
;
1115 ds
->colour_cur
= ui
->colour_cur
;
1116 ds
->next_go
= state
->next_go
;
1118 /* if ui->drag_col != 0, save the screen to the blitter,
1119 * draw the peg where we saved, and set ds->drag_* == ui->drag_*. */
1120 if (ui
->drag_col
!= 0) {
1121 int ox
= ui
->drag_x
- (PEGSZ
/2);
1122 int oy
= ui
->drag_y
- (PEGSZ
/2);
1123 debug(("Saving to blitter at (%d,%d)", ox
, oy
));
1124 blitter_save(fe
, ds
->blit_peg
, ox
, oy
);
1125 draw_peg(fe
, ds
, ox
, oy
, TRUE
, ui
->drag_col
);
1127 ds
->blit_ox
= ox
; ds
->blit_oy
= oy
;
1129 ds
->drag_col
= ui
->drag_col
;
1134 static float game_anim_length(game_state
*oldstate
, game_state
*newstate
,
1135 int dir
, game_ui
*ui
)
1140 static float game_flash_length(game_state
*oldstate
, game_state
*newstate
,
1141 int dir
, game_ui
*ui
)
1146 static int game_wants_statusbar(void)
1151 static int game_timing_state(game_state
*state
)
1157 #define thegame guess
1160 const struct game thegame
= {
1161 "Guess", "games.guess",
1168 TRUE
, game_configure
, custom_params
,
1177 FALSE
, game_text_format
,
1185 game_free_drawstate
,
1189 game_wants_statusbar
,
1190 FALSE
, game_timing_state
,
1191 0, /* mouse_priorities */
1194 /* vim: set shiftwidth=4 tabstop=8: */