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