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 void free_params(game_params
*params
)
68 static game_params
*dup_params(game_params
*params
)
70 game_params
*ret
= snew(game_params
);
71 *ret
= *params
; /* structure copy */
79 {"Standard", {6, 4, 10, FALSE
, TRUE
}},
80 {"Super", {8, 5, 12, FALSE
, TRUE
}},
84 static int game_fetch_preset(int i
, char **name
, game_params
**params
)
86 if (i
< 0 || i
>= lenof(guess_presets
))
89 *name
= dupstr(guess_presets
[i
].name
);
91 * get round annoying const issues
94 game_params tmp
= guess_presets
[i
].params
;
95 *params
= dup_params(&tmp
);
101 static void decode_params(game_params
*params
, char const *string
)
103 char const *p
= string
;
104 game_params
*defs
= default_params();
106 *params
= *defs
; free_params(defs
);
111 params
->ncolours
= atoi(p
);
112 while (*p
&& isdigit((unsigned char)*p
)) p
++;
116 params
->npegs
= atoi(p
);
117 while (*p
&& isdigit((unsigned char)*p
)) p
++;
121 params
->nguesses
= atoi(p
);
122 while (*p
&& isdigit((unsigned char)*p
)) p
++;
126 params
->allow_blank
= 1;
130 params
->allow_blank
= 0;
134 params
->allow_multiple
= 1;
138 params
->allow_multiple
= 0;
147 static char *encode_params(game_params
*params
, int full
)
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");
158 static config_item
*game_configure(game_params
*params
)
163 ret
= snewn(6, config_item
);
165 ret
[0].name
= "Colours";
166 ret
[0].type
= C_STRING
;
167 sprintf(buf
, "%d", params
->ncolours
);
168 ret
[0].sval
= dupstr(buf
);
171 ret
[1].name
= "Pegs per guess";
172 ret
[1].type
= C_STRING
;
173 sprintf(buf
, "%d", params
->npegs
);
174 ret
[1].sval
= dupstr(buf
);
177 ret
[2].name
= "Guesses";
178 ret
[2].type
= C_STRING
;
179 sprintf(buf
, "%d", params
->nguesses
);
180 ret
[2].sval
= dupstr(buf
);
183 ret
[3].name
= "Allow blanks";
184 ret
[3].type
= C_BOOLEAN
;
186 ret
[3].ival
= params
->allow_blank
;
188 ret
[4].name
= "Allow duplicates";
189 ret
[4].type
= C_BOOLEAN
;
191 ret
[4].ival
= params
->allow_multiple
;
201 static game_params
*custom_params(config_item
*cfg
)
203 game_params
*ret
= snew(game_params
);
205 ret
->ncolours
= atoi(cfg
[0].sval
);
206 ret
->npegs
= atoi(cfg
[1].sval
);
207 ret
->nguesses
= atoi(cfg
[2].sval
);
209 ret
->allow_blank
= cfg
[3].ival
;
210 ret
->allow_multiple
= cfg
[4].ival
;
215 static char *validate_params(game_params
*params
)
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";
225 if (!params
->allow_multiple
&& params
->ncolours
< params
->npegs
)
226 return "Disallowing multiple colours requires at least as many colours as pegs";
230 static pegrow
new_pegrow(int npegs
)
232 pegrow pegs
= snew(struct pegrow
);
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));
243 static pegrow
dup_pegrow(pegrow pegs
)
245 pegrow newpegs
= new_pegrow(pegs
->npegs
);
247 memcpy(newpegs
->pegs
, pegs
->pegs
, newpegs
->npegs
* sizeof(int));
248 memcpy(newpegs
->feedback
, pegs
->feedback
, newpegs
->npegs
* sizeof(int));
253 static void invalidate_pegrow(pegrow pegs
)
255 memset(pegs
->pegs
, -1, pegs
->npegs
* sizeof(int));
256 memset(pegs
->feedback
, -1, pegs
->npegs
* sizeof(int));
259 static void free_pegrow(pegrow pegs
)
262 sfree(pegs
->feedback
);
266 static char *new_game_desc(game_params
*params
, random_state
*rs
,
267 char **aux
, int interactive
)
269 unsigned char *bmp
= snewn(params
->npegs
, unsigned char);
272 pegrow colcount
= new_pegrow(params
->ncolours
);
274 for (i
= 0; i
< params
->npegs
; i
++) {
276 c
= random_upto(rs
, params
->ncolours
);
277 if (!params
->allow_multiple
&& colcount
->pegs
[c
]) goto newcol
;
279 bmp
[i
] = (unsigned char)(c
+1);
281 obfuscate_bitmap(bmp
, params
->npegs
*8, FALSE
);
283 ret
= bin2hex(bmp
, params
->npegs
);
285 free_pegrow(colcount
);
289 static char *validate_desc(game_params
*params
, char *desc
)
294 /* desc is just an (obfuscated) bitmap of the solution; check that
295 * it's the correct length and (when unobfuscated) contains only
296 * sensible colours. */
297 if (strlen(desc
) != params
->npegs
* 2)
298 return "Game description is wrong length";
299 bmp
= hex2bin(desc
, params
->npegs
);
300 obfuscate_bitmap(bmp
, params
->npegs
*8, TRUE
);
301 for (i
= 0; i
< params
->npegs
; i
++) {
302 if (bmp
[i
] < 1 || bmp
[i
] > params
->ncolours
) {
304 return "Game description is corrupted";
312 static game_state
*new_game(midend_data
*me
, game_params
*params
, char *desc
)
314 game_state
*state
= snew(game_state
);
318 state
->params
= *params
;
319 state
->guesses
= snewn(params
->nguesses
, pegrow
);
320 for (i
= 0; i
< params
->nguesses
; i
++)
321 state
->guesses
[i
] = new_pegrow(params
->npegs
);
322 state
->solution
= new_pegrow(params
->npegs
);
324 bmp
= hex2bin(desc
, params
->npegs
);
325 obfuscate_bitmap(bmp
, params
->npegs
*8, TRUE
);
326 for (i
= 0; i
< params
->npegs
; i
++)
327 state
->solution
->pegs
[i
] = (int)bmp
[i
];
330 state
->next_go
= state
->solved
= 0;
335 static game_state
*dup_game(game_state
*state
)
337 game_state
*ret
= snew(game_state
);
342 ret
->guesses
= snewn(state
->params
.nguesses
, pegrow
);
343 for (i
= 0; i
< state
->params
.nguesses
; i
++)
344 ret
->guesses
[i
] = dup_pegrow(state
->guesses
[i
]);
345 ret
->solution
= dup_pegrow(state
->solution
);
350 static void free_game(game_state
*state
)
354 free_pegrow(state
->solution
);
355 for (i
= 0; i
< state
->params
.nguesses
; i
++)
356 free_pegrow(state
->guesses
[i
]);
357 sfree(state
->guesses
);
362 static char *solve_game(game_state
*state
, game_state
*currstate
,
363 char *aux
, char **error
)
368 static char *game_text_format(game_state
*state
)
374 pegrow curr_pegs
; /* half-finished current move */
376 int colour_cur
; /* position of up-down colour picker cursor */
377 int peg_cur
; /* position of left-right peg picker cursor */
378 int display_cur
, markable
;
380 int drag_col
, drag_x
, drag_y
; /* x and y are *center* of peg! */
381 int drag_opeg
; /* peg index, if dragged from a peg (from current guess), otherwise -1 */
384 static game_ui
*new_ui(game_state
*state
)
386 game_ui
*ui
= snew(struct game_ui
);
387 memset(ui
, 0, sizeof(struct game_ui
));
388 ui
->curr_pegs
= new_pegrow(state
->params
.npegs
);
389 ui
->holds
= snewn(state
->params
.npegs
, int);
390 memset(ui
->holds
, 0, sizeof(int)*state
->params
.npegs
);
395 static void free_ui(game_ui
*ui
)
397 free_pegrow(ui
->curr_pegs
);
402 char *encode_ui(game_ui
*ui
)
407 void decode_ui(game_ui
*ui
, char *encoding
)
411 static void game_changed_state(game_ui
*ui
, game_state
*oldstate
,
412 game_state
*newstate
)
416 /* just clear the row-in-progress when we have an undo/redo. */
417 for (i
= 0; i
< ui
->curr_pegs
->npegs
; i
++)
418 ui
->curr_pegs
->pegs
[i
] = 0;
419 ui
->markable
= FALSE
;
422 #define PEGSZ (ds->pegsz)
423 #define PEGOFF (ds->pegsz + ds->gapsz)
424 #define HINTSZ (ds->hintsz)
425 #define HINTOFF (ds->hintsz + ds->gapsz)
427 #define GAP (ds->gapsz)
428 #define CGAP (ds->gapsz / 2)
430 #define PEGRAD (ds->pegrad)
431 #define HINTRAD (ds->hintrad)
433 #define COL_OX (ds->colx)
434 #define COL_OY (ds->coly)
435 #define COL_X(c) (COL_OX)
436 #define COL_Y(c) (COL_OY + (c)*PEGOFF)
438 #define COL_H (ds->colours->npegs*PEGOFF)
440 #define GUESS_OX (ds->guessx)
441 #define GUESS_OY (ds->guessy)
442 #define GUESS_X(g,p) (GUESS_OX + (p)*PEGOFF)
443 #define GUESS_Y(g,p) (GUESS_OY + (g)*PEGOFF)
444 #define GUESS_W (ds->solution->npegs*PEGOFF)
445 #define GUESS_H (ds->nguesses*PEGOFF)
447 #define HINT_OX (GUESS_OX + GUESS_W + ds->gapsz)
448 #define HINT_OY (GUESS_OY + (PEGSZ - HINTOFF - HINTSZ) / 2)
449 #define HINT_X(g) HINT_OX
450 #define HINT_Y(g) (HINT_OY + (g)*PEGOFF)
451 #define HINT_W ((ds->hintw*HINTOFF) - GAP)
452 #define HINT_H GUESS_H
454 #define SOLN_OX GUESS_OX
455 #define SOLN_OY (GUESS_OY + GUESS_H + ds->gapsz + 2)
456 #define SOLN_W GUESS_W
457 #define SOLN_H PEGOFF
459 struct game_drawstate
{
461 pegrow
*guesses
; /* same size as state->guesses */
462 pegrow solution
; /* only displayed if state->solved */
463 pegrow colours
; /* length ncolours, not npegs */
465 int pegsz
, hintsz
, gapsz
; /* peg size (diameter), etc. */
466 int pegrad
, hintrad
; /* radius of peg, hint */
468 int colx
, coly
; /* origin of colours vertical bar */
469 int guessx
, guessy
; /* origin of guesses */
470 int solnx
, solny
; /* origin of solution */
471 int hintw
; /* no. of hint tiles we're wide per row */
472 int w
, h
, started
, solved
;
477 int drag_col
, blit_ox
, blit_oy
;
480 static int is_markable(game_params
*params
, pegrow pegs
)
482 int i
, nset
= 0, nrequired
, ret
= 0;
483 pegrow colcount
= new_pegrow(params
->ncolours
);
485 nrequired
= params
->allow_blank ?
1 : params
->npegs
;
487 for (i
= 0; i
< params
->npegs
; i
++) {
488 int c
= pegs
->pegs
[i
];
490 colcount
->pegs
[c
-1]++;
494 if (nset
< nrequired
) goto done
;
496 if (!params
->allow_multiple
) {
497 for (i
= 0; i
< params
->ncolours
; i
++) {
498 if (colcount
->pegs
[i
] > 1) goto done
;
503 free_pegrow(colcount
);
507 static void set_peg(game_params
*params
, game_ui
*ui
, int peg
, int col
)
509 ui
->curr_pegs
->pegs
[peg
] = col
;
510 ui
->markable
= is_markable(params
, ui
->curr_pegs
);
513 static int mark_pegs(pegrow guess
, pegrow solution
, int ncols
)
515 int nc_place
= 0, nc_colour
= 0, i
, j
;
517 assert(guess
&& solution
&& (guess
->npegs
== solution
->npegs
));
519 for (i
= 0; i
< guess
->npegs
; i
++) {
520 if (guess
->pegs
[i
] == solution
->pegs
[i
]) nc_place
++;
523 /* slight bit of cleverness: we have the following formula, from
524 * http://mathworld.wolfram.com/Mastermind.html that gives:
526 * nc_colour = sum(colours, min(#solution, #guess)) - nc_place
528 * I think this is due to Knuth.
530 for (i
= 1; i
<= ncols
; i
++) {
531 int n_guess
= 0, n_solution
= 0;
532 for (j
= 0; j
< guess
->npegs
; j
++) {
533 if (guess
->pegs
[j
] == i
) n_guess
++;
534 if (solution
->pegs
[j
] == i
) n_solution
++;
536 nc_colour
+= min(n_guess
, n_solution
);
538 nc_colour
-= nc_place
;
540 debug(("mark_pegs, %d pegs, %d right place, %d right colour",
541 guess
->npegs
, nc_place
, nc_colour
));
542 assert((nc_colour
+ nc_place
) <= guess
->npegs
);
544 memset(guess
->feedback
, 0, guess
->npegs
*sizeof(int));
545 for (i
= 0, j
= 0; i
< nc_place
; i
++)
546 guess
->feedback
[j
++] = FEEDBACK_CORRECTPLACE
;
547 for (i
= 0; i
< nc_colour
; i
++)
548 guess
->feedback
[j
++] = FEEDBACK_CORRECTCOLOUR
;
553 static char *encode_move(game_state
*from
, game_ui
*ui
)
559 len
= ui
->curr_pegs
->npegs
* 20 + 2;
560 buf
= snewn(len
, char);
564 for (i
= 0; i
< ui
->curr_pegs
->npegs
; i
++) {
565 p
+= sprintf(p
, "%s%d", sep
, ui
->curr_pegs
->pegs
[i
]);
569 assert(p
- buf
<= len
);
570 buf
= sresize(buf
, len
, char);
572 tmppegs
= dup_pegrow(ui
->curr_pegs
);
573 solved
= mark_pegs(tmppegs
, from
->solution
, from
->params
.ncolours
);
574 solved
= (solved
== from
->params
.ncolours
);
575 free_pegrow(tmppegs
);
577 for (i
= 0; i
< from
->solution
->npegs
; i
++) {
578 if (!ui
->holds
[i
] || solved
) {
579 ui
->curr_pegs
->pegs
[i
] = 0;
581 if (solved
) ui
->holds
[i
] = 0;
583 ui
->markable
= is_markable(&from
->params
, ui
->curr_pegs
);
584 if (!ui
->markable
&& ui
->peg_cur
== from
->solution
->npegs
)
590 static char *interpret_move(game_state
*from
, game_ui
*ui
, game_drawstate
*ds
,
591 int x
, int y
, int button
)
593 int over_col
= 0; /* one-indexed */
594 int over_guess
= -1; /* zero-indexed */
595 int over_past_guess_y
= -1; /* zero-indexed */
596 int over_past_guess_x
= -1; /* zero-indexed */
597 int over_hint
= 0; /* zero or one */
600 int guess_ox
= GUESS_X(from
->next_go
, 0);
601 int guess_oy
= GUESS_Y(from
->next_go
, 0);
603 if (from
->solved
) return NULL
;
605 if (x
>= COL_OX
&& x
<= (COL_OX
+ COL_W
) &&
606 y
>= COL_OY
&& y
<= (COL_OY
+ COL_H
)) {
607 over_col
= ((y
- COL_OY
) / PEGOFF
) + 1;
608 } else if (x
>= guess_ox
&&
609 y
>= guess_oy
&& y
<= (guess_oy
+ GUESS_H
)) {
610 if (x
<= (guess_ox
+ GUESS_W
)) {
611 over_guess
= (x
- guess_ox
) / PEGOFF
;
615 } else if (x
>= guess_ox
&&
616 y
>= GUESS_OY
&& y
< guess_oy
) {
617 over_past_guess_y
= (y
- GUESS_OY
) / PEGOFF
;
618 over_past_guess_x
= (x
- guess_ox
) / PEGOFF
;
620 debug(("make_move: over_col %d, over_guess %d, over_hint %d,"
621 " over_past_guess (%d,%d)", over_col
, over_guess
, over_hint
,
622 over_past_guess_x
, over_past_guess_y
));
624 assert(ds
->blit_peg
);
627 if (button
== LEFT_BUTTON
) {
629 ui
->drag_col
= over_col
;
631 debug(("Start dragging from colours"));
632 } else if (over_guess
> -1) {
633 int col
= ui
->curr_pegs
->pegs
[over_guess
];
636 ui
->drag_opeg
= over_guess
;
637 debug(("Start dragging from a guess"));
639 } else if (over_past_guess_y
> -1) {
641 from
->guesses
[over_past_guess_y
]->pegs
[over_past_guess_x
];
645 debug(("Start dragging from a past guess"));
651 debug(("Start dragging, col = %d, (%d,%d)",
652 ui
->drag_col
, ui
->drag_x
, ui
->drag_y
));
655 } else if (button
== LEFT_DRAG
&& ui
->drag_col
) {
658 debug(("Keep dragging, (%d,%d)", ui
->drag_x
, ui
->drag_y
));
660 } else if (button
== LEFT_RELEASE
&& ui
->drag_col
) {
661 if (over_guess
> -1) {
662 debug(("Dropping colour %d onto guess peg %d",
663 ui
->drag_col
, over_guess
));
664 set_peg(&from
->params
, ui
, over_guess
, ui
->drag_col
);
666 if (ui
->drag_opeg
> -1) {
667 debug(("Removing colour %d from peg %d",
668 ui
->drag_col
, ui
->drag_opeg
));
669 set_peg(&from
->params
, ui
, ui
->drag_opeg
, 0);
675 debug(("Stop dragging."));
677 } else if (button
== RIGHT_BUTTON
) {
678 if (over_guess
> -1) {
679 /* we use ths feedback in the game_ui to signify
680 * 'carry this peg to the next guess as well'. */
681 ui
->holds
[over_guess
] = 1 - ui
->holds
[over_guess
];
684 } else if (button
== LEFT_RELEASE
&& over_hint
&& ui
->markable
) {
685 /* NB this won't trigger if on the end of a drag; that's on
686 * purpose, in case you drop by mistake... */
687 ret
= encode_move(from
, ui
);
691 if (button
== CURSOR_UP
|| button
== CURSOR_DOWN
) {
693 if (button
== CURSOR_DOWN
&& (ui
->colour_cur
+1) < from
->params
.ncolours
)
695 if (button
== CURSOR_UP
&& ui
->colour_cur
> 0)
698 } else if (button
== CURSOR_LEFT
|| button
== CURSOR_RIGHT
) {
699 int maxcur
= from
->params
.npegs
;
700 if (ui
->markable
) maxcur
++;
703 if (button
== CURSOR_RIGHT
&& (ui
->peg_cur
+1) < maxcur
)
705 if (button
== CURSOR_LEFT
&& ui
->peg_cur
> 0)
708 } else if (button
== CURSOR_SELECT
|| button
== ' ' || button
== '\r' ||
711 if (ui
->peg_cur
== from
->params
.npegs
) {
712 ret
= encode_move(from
, ui
);
714 set_peg(&from
->params
, ui
, ui
->peg_cur
, ui
->colour_cur
+1);
717 } else if (button
== 'H' || button
== 'h') {
719 ui
->holds
[ui
->peg_cur
] = 1 - ui
->holds
[ui
->peg_cur
];
725 static game_state
*execute_move(game_state
*from
, char *move
)
731 if (!strcmp(move
, "S")) {
732 ret
= dup_game(from
);
735 } else if (move
[0] == 'G') {
738 ret
= dup_game(from
);
740 for (i
= 0; i
< from
->solution
->npegs
; i
++) {
742 if (val
<= 0 || val
> from
->params
.ncolours
) {
746 ret
->guesses
[from
->next_go
]->pegs
[i
] = atoi(p
);
747 while (*p
&& isdigit((unsigned char)*p
)) p
++;
751 nc_place
= mark_pegs(ret
->guesses
[from
->next_go
], ret
->solution
, ret
->params
.ncolours
);
753 if (nc_place
== ret
->solution
->npegs
) {
754 ret
->solved
= 1; /* win! */
756 ret
->next_go
= from
->next_go
+ 1;
757 if (ret
->next_go
>= ret
->params
.nguesses
)
758 ret
->solved
= 1; /* 'lose' so we show the pegs. */
766 /* ----------------------------------------------------------------------
770 #define PEG_PREFER_SZ 32
772 /* next three are multipliers for pegsz. It will look much nicer if
773 * (2*PEG_HINT) + PEG_GAP = 1.0 as the hints are formatted like that. */
775 #define PEG_HINT 0.35
779 static void game_size(game_params
*params
, game_drawstate
*ds
,
780 int *x
, int *y
, int expand
)
782 double hmul
, vmul_c
, vmul_g
, vmul
, szx
, szy
;
783 int sz
, colh
, guessh
;
785 hmul
= BORDER
* 2.0 + /* border */
786 1.0 * 2.0 + /* vertical colour bar */
787 1.0 * params
->npegs
+ /* guess pegs */
788 PEG_GAP
* params
->npegs
+ /* guess gaps */
789 PEG_HINT
* ds
->hintw
+ /* hint pegs */
790 PEG_GAP
* (ds
->hintw
- 1); /* hint gaps */
792 vmul_c
= BORDER
* 2.0 + /* border */
793 1.0 * params
->ncolours
+ /* colour pegs */
794 PEG_GAP
* (params
->ncolours
- 1); /* colour gaps */
796 vmul_g
= BORDER
* 2.0 + /* border */
797 1.0 * (params
->nguesses
+ 1) + /* guesses plus solution */
798 PEG_GAP
* (params
->nguesses
+ 1); /* gaps plus gap above soln */
800 vmul
= max(vmul_c
, vmul_g
);
804 sz
= max(min((int)szx
, (int)szy
), 1);
808 ds
->pegsz
= min(sz
, PEG_PREFER_SZ
);
810 ds
->hintsz
= (int)((double)ds
->pegsz
* PEG_HINT
);
811 ds
->gapsz
= (int)((double)ds
->pegsz
* PEG_GAP
);
812 ds
->border
= (int)((double)ds
->pegsz
* BORDER
);
814 ds
->pegrad
= (ds
->pegsz
-1)/2; /* radius of peg to fit in pegsz (which is 2r+1) */
815 ds
->hintrad
= (ds
->hintsz
-1)/2;
817 *x
= (int)ceil((double)ds
->pegsz
* hmul
);
818 *y
= (int)ceil((double)ds
->pegsz
* vmul
);
819 ds
->w
= *x
; ds
->h
= *y
;
821 colh
= ((ds
->pegsz
+ ds
->gapsz
) * params
->ncolours
) - ds
->gapsz
;
822 guessh
= ((ds
->pegsz
+ ds
->gapsz
) * params
->nguesses
); /* guesses */
823 guessh
+= ds
->gapsz
+ ds
->pegsz
; /* solution */
825 ds
->colx
= ds
->border
;
826 ds
->coly
= (*y
- colh
) / 2;
828 ds
->guessx
= ds
->solnx
= ds
->border
+ ds
->pegsz
* 2; /* border + colours */
829 ds
->guessy
= (*y
- guessh
) / 2;
830 ds
->solny
= ds
->guessy
+ ((ds
->pegsz
+ ds
->gapsz
) * params
->nguesses
) + ds
->gapsz
;
833 if (ds
->blit_peg
) blitter_free(ds
->blit_peg
);
834 ds
->blit_peg
= blitter_new(ds
->pegsz
, ds
->pegsz
);
838 static float *game_colours(frontend
*fe
, game_state
*state
, int *ncolours
)
840 float *ret
= snewn(3 * NCOLOURS
, float), max
;
843 frontend_default_colour(fe
, &ret
[COL_BACKGROUND
* 3]);
846 ret
[COL_1
* 3 + 0] = 1.0F
;
847 ret
[COL_1
* 3 + 1] = 0.0F
;
848 ret
[COL_1
* 3 + 2] = 0.0F
;
850 /* yellow (toned down a bit due to pale grey background) */
851 ret
[COL_2
* 3 + 0] = 0.7F
;
852 ret
[COL_2
* 3 + 1] = 0.7F
;
853 ret
[COL_2
* 3 + 2] = 0.0F
;
855 /* green (also toned down) */
856 ret
[COL_3
* 3 + 0] = 0.0F
;
857 ret
[COL_3
* 3 + 1] = 0.5F
;
858 ret
[COL_3
* 3 + 2] = 0.0F
;
861 ret
[COL_4
* 3 + 0] = 0.0F
;
862 ret
[COL_4
* 3 + 1] = 0.0F
;
863 ret
[COL_4
* 3 + 2] = 1.0F
;
866 ret
[COL_5
* 3 + 0] = 1.0F
;
867 ret
[COL_5
* 3 + 1] = 0.5F
;
868 ret
[COL_5
* 3 + 2] = 0.0F
;
871 ret
[COL_6
* 3 + 0] = 0.5F
;
872 ret
[COL_6
* 3 + 1] = 0.0F
;
873 ret
[COL_6
* 3 + 2] = 0.7F
;
876 ret
[COL_7
* 3 + 0] = 0.4F
;
877 ret
[COL_7
* 3 + 1] = 0.2F
;
878 ret
[COL_7
* 3 + 2] = 0.2F
;
881 ret
[COL_8
* 3 + 0] = 0.4F
;
882 ret
[COL_8
* 3 + 1] = 0.7F
;
883 ret
[COL_8
* 3 + 2] = 1.0F
;
886 ret
[COL_9
* 3 + 0] = 0.5F
;
887 ret
[COL_9
* 3 + 1] = 0.8F
;
888 ret
[COL_9
* 3 + 2] = 0.5F
;
891 ret
[COL_10
* 3 + 0] = 1.0F
;
892 ret
[COL_10
* 3 + 1] = 0.6F
;
893 ret
[COL_10
* 3 + 2] = 1.0F
;
895 ret
[COL_FRAME
* 3 + 0] = 0.0F
;
896 ret
[COL_FRAME
* 3 + 1] = 0.0F
;
897 ret
[COL_FRAME
* 3 + 2] = 0.0F
;
899 ret
[COL_CURSOR
* 3 + 0] = 0.0F
;
900 ret
[COL_CURSOR
* 3 + 1] = 0.0F
;
901 ret
[COL_CURSOR
* 3 + 2] = 0.0F
;
903 ret
[COL_FLASH
* 3 + 0] = 0.5F
;
904 ret
[COL_FLASH
* 3 + 1] = 1.0F
;
905 ret
[COL_FLASH
* 3 + 2] = 1.0F
;
907 ret
[COL_HOLD
* 3 + 0] = 1.0F
;
908 ret
[COL_HOLD
* 3 + 1] = 0.5F
;
909 ret
[COL_HOLD
* 3 + 2] = 0.5F
;
911 ret
[COL_CORRECTPLACE
*3 + 0] = 0.0F
;
912 ret
[COL_CORRECTPLACE
*3 + 1] = 0.0F
;
913 ret
[COL_CORRECTPLACE
*3 + 2] = 0.0F
;
915 ret
[COL_CORRECTCOLOUR
*3 + 0] = 1.0F
;
916 ret
[COL_CORRECTCOLOUR
*3 + 1] = 1.0F
;
917 ret
[COL_CORRECTCOLOUR
*3 + 2] = 1.0F
;
919 /* We want to make sure we can distinguish COL_CORRECTCOLOUR
920 * (which we hard-code as white) from COL_BACKGROUND (which
921 * could default to white on some platforms).
922 * Code borrowed from fifteen.c. */
923 max
= ret
[COL_BACKGROUND
*3];
924 for (i
= 1; i
< 3; i
++)
925 if (ret
[COL_BACKGROUND
*3+i
] > max
)
926 max
= ret
[COL_BACKGROUND
*3+i
];
927 if (max
* 1.2F
> 1.0F
) {
928 for (i
= 0; i
< 3; i
++)
929 ret
[COL_BACKGROUND
*3+i
] /= (max
* 1.2F
);
932 /* We also want to be able to tell the difference between BACKGROUND
933 * and EMPTY, for similar distinguishing-hint reasons. */
934 ret
[COL_EMPTY
* 3 + 0] = ret
[COL_BACKGROUND
* 3 + 0] * 2.0 / 3.0;
935 ret
[COL_EMPTY
* 3 + 1] = ret
[COL_BACKGROUND
* 3 + 1] * 2.0 / 3.0;
936 ret
[COL_EMPTY
* 3 + 2] = ret
[COL_BACKGROUND
* 3 + 2] * 2.0 / 3.0;
938 *ncolours
= NCOLOURS
;
942 static game_drawstate
*game_new_drawstate(game_state
*state
)
944 struct game_drawstate
*ds
= snew(struct game_drawstate
);
947 memset(ds
, 0, sizeof(struct game_drawstate
));
949 ds
->guesses
= snewn(state
->params
.nguesses
, pegrow
);
950 ds
->nguesses
= state
->params
.nguesses
;
951 for (i
= 0; i
< state
->params
.nguesses
; i
++) {
952 ds
->guesses
[i
] = new_pegrow(state
->params
.npegs
);
953 invalidate_pegrow(ds
->guesses
[i
]);
955 ds
->solution
= new_pegrow(state
->params
.npegs
);
956 invalidate_pegrow(ds
->solution
);
957 ds
->colours
= new_pegrow(state
->params
.ncolours
);
958 invalidate_pegrow(ds
->colours
);
960 ds
->hintw
= (state
->params
.npegs
+1)/2; /* must round up */
967 static void game_free_drawstate(game_drawstate
*ds
)
971 if (ds
->blit_peg
) blitter_free(ds
->blit_peg
);
972 free_pegrow(ds
->colours
);
973 free_pegrow(ds
->solution
);
974 for (i
= 0; i
< ds
->nguesses
; i
++)
975 free_pegrow(ds
->guesses
[i
]);
980 static void draw_peg(frontend
*fe
, game_drawstate
*ds
, int cx
, int cy
,
984 * Some platforms antialias circles, which means we shouldn't
985 * overwrite a circle of one colour with a circle of another
986 * colour without erasing the background first. However, if the
987 * peg is the one being dragged, we don't erase the background
988 * because we _want_ it to alpha-blend nicely into whatever's
992 draw_rect(fe
, cx
-CGAP
, cy
-CGAP
, PEGSZ
+CGAP
*2, PEGSZ
+CGAP
*2,
995 draw_circle(fe
, cx
+PEGRAD
, cy
+PEGRAD
, PEGRAD
, 1, COL_EMPTY
+ col
);
996 draw_circle(fe
, cx
+PEGRAD
, cy
+PEGRAD
, PEGRAD
, 0, COL_EMPTY
+ col
);
998 draw_rect(fe
, cx
, cy
, PEGSZ
, PEGSZ
, COL_EMPTY
+ col
);
999 draw_update(fe
, cx
-CGAP
, cy
-CGAP
, PEGSZ
+CGAP
*2, PEGSZ
+CGAP
*2);
1002 static void draw_cursor(frontend
*fe
, game_drawstate
*ds
, int x
, int y
)
1004 draw_circle(fe
, x
+PEGRAD
, y
+PEGRAD
, PEGRAD
+CGAP
, 0, COL_CURSOR
);
1006 draw_update(fe
, x
-CGAP
, y
-CGAP
, PEGSZ
+CGAP
*2, PEGSZ
+CGAP
*2);
1009 static void guess_redraw(frontend
*fe
, game_drawstate
*ds
, int guess
,
1010 pegrow src
, int *holds
, int cur_col
, int force
)
1013 int rowx
, rowy
, i
, scol
;
1016 dest
= ds
->solution
;
1020 dest
= ds
->guesses
[guess
];
1021 rowx
= GUESS_X(guess
,0);
1022 rowy
= GUESS_Y(guess
,0);
1024 if (src
) assert(src
->npegs
== dest
->npegs
);
1026 for (i
= 0; i
< dest
->npegs
; i
++) {
1027 scol
= src ? src
->pegs
[i
] : 0;
1030 if (holds
&& holds
[i
])
1032 if ((dest
->pegs
[i
] != scol
) || force
) {
1033 draw_peg(fe
, ds
, rowx
+ PEGOFF
* i
, rowy
, FALSE
, scol
&~ 0x3000);
1037 draw_rect(fe
, rowx
+ PEGOFF
* i
, rowy
+ PEGSZ
+ ds
->gapsz
/2,
1038 PEGSZ
, 2, (scol
& 0x2000 ? COL_HOLD
: COL_BACKGROUND
));
1039 draw_update(fe
, rowx
+ PEGOFF
* i
, rowy
+ PEGSZ
+ ds
->gapsz
/2,
1042 draw_cursor(fe
, ds
, rowx
+ PEGOFF
* i
, rowy
);
1044 dest
->pegs
[i
] = scol
;
1048 static void hint_redraw(frontend
*fe
, game_drawstate
*ds
, int guess
,
1049 pegrow src
, int force
, int cursor
, int markable
)
1051 pegrow dest
= ds
->guesses
[guess
];
1052 int rowx
, rowy
, i
, scol
, col
, hintlen
;
1054 int emptycol
= (markable ? COL_FLASH
: COL_EMPTY
);
1056 if (src
) assert(src
->npegs
== dest
->npegs
);
1058 hintlen
= (dest
->npegs
+ 1)/2;
1061 * Because of the possible presence of the cursor around this
1062 * entire section, we redraw all or none of it but never part.
1064 need_redraw
= FALSE
;
1066 for (i
= 0; i
< dest
->npegs
; i
++) {
1067 scol
= src ? src
->feedback
[i
] : 0;
1068 if (i
== 0 && cursor
)
1070 if (i
== 0 && markable
)
1072 if ((scol
!= dest
->feedback
[i
]) || force
) {
1075 dest
->feedback
[i
] = scol
;
1079 int hinth
= HINTSZ
+ GAP
+ HINTSZ
;
1082 hx
= HINT_X(guess
)-GAP
; hy
= HINT_Y(guess
)-GAP
;
1083 hw
= HINT_W
+GAP
*2; hh
= hinth
+GAP
*2;
1085 /* erase a large background rectangle */
1086 draw_rect(fe
, hx
, hy
, hw
, hh
, COL_BACKGROUND
);
1088 for (i
= 0; i
< dest
->npegs
; i
++) {
1089 scol
= src ? src
->feedback
[i
] : 0;
1090 col
= ((scol
== FEEDBACK_CORRECTPLACE
) ? COL_CORRECTPLACE
:
1091 (scol
== FEEDBACK_CORRECTCOLOUR
) ? COL_CORRECTCOLOUR
:
1094 rowx
= HINT_X(guess
);
1095 rowy
= HINT_Y(guess
);
1097 rowx
+= HINTOFF
* i
;
1099 rowx
+= HINTOFF
* (i
- hintlen
);
1103 draw_circle(fe
, rowx
+HINTRAD
, rowy
+HINTRAD
, HINTRAD
, 1, col
);
1104 draw_circle(fe
, rowx
+HINTRAD
, rowy
+HINTRAD
, HINTRAD
, 0, col
);
1106 draw_rect(fe
, rowx
, rowy
, HINTSZ
, HINTSZ
, col
);
1111 x1
= hx
+ CGAP
; y1
= hy
+ CGAP
;
1112 x2
= hx
+ hw
- CGAP
; y2
= hy
+ hh
- CGAP
;
1113 draw_line(fe
, x1
, y1
, x2
, y1
, COL_CURSOR
);
1114 draw_line(fe
, x2
, y1
, x2
, y2
, COL_CURSOR
);
1115 draw_line(fe
, x2
, y2
, x1
, y2
, COL_CURSOR
);
1116 draw_line(fe
, x1
, y2
, x1
, y1
, COL_CURSOR
);
1119 draw_update(fe
, hx
, hy
, hw
, hh
);
1123 static void currmove_redraw(frontend
*fe
, game_drawstate
*ds
, int guess
, int col
)
1125 int ox
= GUESS_X(guess
, 0), oy
= GUESS_Y(guess
, 0), off
= PEGSZ
/4;
1127 draw_rect(fe
, ox
-off
-1, oy
, 2, PEGSZ
, col
);
1128 draw_update(fe
, ox
-off
-1, oy
, 2, PEGSZ
);
1131 static void game_redraw(frontend
*fe
, game_drawstate
*ds
, game_state
*oldstate
,
1132 game_state
*state
, int dir
, game_ui
*ui
,
1133 float animtime
, float flashtime
)
1135 int i
, new_move
, last_go
;
1137 new_move
= (state
->next_go
!= ds
->next_go
) || !ds
->started
;
1138 last_go
= (state
->next_go
== state
->params
.nguesses
-1);
1141 draw_rect(fe
, 0, 0, ds
->w
, ds
->h
, COL_BACKGROUND
);
1142 draw_rect(fe
, SOLN_OX
, SOLN_OY
- ds
->gapsz
- 1, SOLN_W
, 2, COL_FRAME
);
1143 draw_update(fe
, 0, 0, ds
->w
, ds
->h
);
1146 if (ds
->drag_col
!= 0) {
1147 debug(("Loading from blitter."));
1148 blitter_load(fe
, ds
->blit_peg
, ds
->blit_ox
, ds
->blit_oy
);
1149 draw_update(fe
, ds
->blit_ox
, ds
->blit_oy
, PEGSZ
, PEGSZ
);
1152 /* draw the colours */
1153 for (i
= 0; i
< state
->params
.ncolours
; i
++) {
1155 if (ui
->display_cur
&& ui
->colour_cur
== i
)
1157 if (ds
->colours
->pegs
[i
] != val
) {
1158 draw_peg(fe
, ds
, COL_X(i
), COL_Y(i
), FALSE
, i
+1);
1160 draw_cursor(fe
, ds
, COL_X(i
), COL_Y(i
));
1161 ds
->colours
->pegs
[i
] = val
;
1165 /* draw the guesses (so far) and the hints */
1166 for (i
= 0; i
< state
->params
.nguesses
; i
++) {
1167 if (state
->next_go
> i
|| state
->solved
) {
1168 /* this info is stored in the game_state already */
1169 guess_redraw(fe
, ds
, i
, state
->guesses
[i
], NULL
, -1, 0);
1170 hint_redraw(fe
, ds
, i
, state
->guesses
[i
],
1171 i
== (state
->next_go
-1) ?
1 : 0, FALSE
, FALSE
);
1172 } else if (state
->next_go
== i
) {
1173 /* this is the one we're on; the (incomplete) guess is
1174 * stored in the game_ui. */
1175 guess_redraw(fe
, ds
, i
, ui
->curr_pegs
,
1176 ui
->holds
, ui
->display_cur ? ui
->peg_cur
: -1, 0);
1177 hint_redraw(fe
, ds
, i
, NULL
, 1,
1178 ui
->display_cur
&& ui
->peg_cur
== state
->params
.npegs
,
1181 /* we've not got here yet; it's blank. */
1182 guess_redraw(fe
, ds
, i
, NULL
, NULL
, -1, 0);
1183 hint_redraw(fe
, ds
, i
, NULL
, 0, FALSE
, FALSE
);
1187 /* draw the 'current move' and 'able to mark' sign. */
1189 currmove_redraw(fe
, ds
, ds
->next_go
, COL_BACKGROUND
);
1191 currmove_redraw(fe
, ds
, state
->next_go
, COL_HOLD
);
1193 /* draw the solution (or the big rectangle) */
1194 if ((state
->solved
!= ds
->solved
) || !ds
->started
) {
1195 draw_rect(fe
, SOLN_OX
, SOLN_OY
, SOLN_W
, SOLN_H
,
1196 state
->solved ? COL_BACKGROUND
: COL_EMPTY
);
1197 draw_update(fe
, SOLN_OX
, SOLN_OY
, SOLN_W
, SOLN_H
);
1200 guess_redraw(fe
, ds
, -1, state
->solution
, NULL
, -1, !ds
->solved
);
1201 ds
->solved
= state
->solved
;
1203 ds
->next_go
= state
->next_go
;
1205 /* if ui->drag_col != 0, save the screen to the blitter,
1206 * draw the peg where we saved, and set ds->drag_* == ui->drag_*. */
1207 if (ui
->drag_col
!= 0) {
1208 int ox
= ui
->drag_x
- (PEGSZ
/2);
1209 int oy
= ui
->drag_y
- (PEGSZ
/2);
1210 debug(("Saving to blitter at (%d,%d)", ox
, oy
));
1211 blitter_save(fe
, ds
->blit_peg
, ox
, oy
);
1212 draw_peg(fe
, ds
, ox
, oy
, TRUE
, ui
->drag_col
);
1214 ds
->blit_ox
= ox
; ds
->blit_oy
= oy
;
1216 ds
->drag_col
= ui
->drag_col
;
1221 static float game_anim_length(game_state
*oldstate
, game_state
*newstate
,
1222 int dir
, game_ui
*ui
)
1227 static float game_flash_length(game_state
*oldstate
, game_state
*newstate
,
1228 int dir
, game_ui
*ui
)
1233 static int game_wants_statusbar(void)
1238 static int game_timing_state(game_state
*state
)
1244 #define thegame guess
1247 const struct game thegame
= {
1248 "Guess", "games.guess",
1255 TRUE
, game_configure
, custom_params
,
1263 FALSE
, game_text_format
,
1274 game_free_drawstate
,
1278 game_wants_statusbar
,
1279 FALSE
, game_timing_state
,
1280 0, /* mouse_priorities */
1283 /* vim: set shiftwidth=4 tabstop=8: */