15 #define PI 3.141592653589793238462643383279502884197169399
17 #define MATMUL(xr,yr,m,x,y) do { \
18 float rx, ry, xx = (x), yy = (y), *mat = (m); \
19 rx = mat[0] * xx + mat[2] * yy; \
20 ry = mat[1] * xx + mat[3] * yy; \
21 (xr) = rx; (yr) = ry; \
24 /* Direction and other bitfields */
31 /* Corner flags go in the barriers array */
37 /* Rotations: Anticlockwise, Clockwise, Flip, general rotate */
38 #define A(x) ( (((x) & 0x07) << 1) | (((x) & 0x08) >> 3) )
39 #define C(x) ( (((x) & 0x0E) >> 1) | (((x) & 0x01) << 3) )
40 #define F(x) ( (((x) & 0x0C) >> 2) | (((x) & 0x03) << 2) )
41 #define ROT(x, n) ( ((n)&3) == 0 ? (x) : \
42 ((n)&3) == 1 ? A(x) : \
43 ((n)&3) == 2 ? F(x) : C(x) )
45 /* X and Y displacements */
46 #define X(x) ( (x) == R ? +1 : (x) == L ? -1 : 0 )
47 #define Y(x) ( (x) == D ? +1 : (x) == U ? -1 : 0 )
50 #define COUNT(x) ( (((x) & 0x08) >> 3) + (((x) & 0x04) >> 2) + \
51 (((x) & 0x02) >> 1) + ((x) & 0x01) )
55 #define WINDOW_OFFSET 16
57 #define ROTATE_TIME 0.13F
58 #define FLASH_FRAME 0.07F
75 float barrier_probability
;
78 struct game_aux_info
{
84 int width
, height
, cx
, cy
, wrapping
, completed
;
85 int last_rotate_x
, last_rotate_y
, last_rotate_dir
;
86 int used_solve
, just_used_solve
;
88 unsigned char *barriers
;
91 #define OFFSET(x2,y2,x1,y1,dir,state) \
92 ( (x2) = ((x1) + (state)->width + X((dir))) % (state)->width, \
93 (y2) = ((y1) + (state)->height + Y((dir))) % (state)->height)
95 #define index(state, a, x, y) ( a[(y) * (state)->width + (x)] )
96 #define tile(state, x, y) index(state, (state)->tiles, x, y)
97 #define barrier(state, x, y) index(state, (state)->barriers, x, y)
103 static int xyd_cmp(void *av
, void *bv
) {
104 struct xyd
*a
= (struct xyd
*)av
;
105 struct xyd
*b
= (struct xyd
*)bv
;
114 if (a
->direction
< b
->direction
)
116 if (a
->direction
> b
->direction
)
121 static struct xyd
*new_xyd(int x
, int y
, int direction
)
123 struct xyd
*xyd
= snew(struct xyd
);
126 xyd
->direction
= direction
;
130 /* ----------------------------------------------------------------------
131 * Manage game parameters.
133 static game_params
*default_params(void)
135 game_params
*ret
= snew(game_params
);
139 ret
->wrapping
= FALSE
;
140 ret
->barrier_probability
= 0.0;
145 static int game_fetch_preset(int i
, char **name
, game_params
**params
)
149 static const struct { int x
, y
, wrap
; } values
[] = {
162 if (i
< 0 || i
>= lenof(values
))
165 ret
= snew(game_params
);
166 ret
->width
= values
[i
].x
;
167 ret
->height
= values
[i
].y
;
168 ret
->wrapping
= values
[i
].wrap
;
169 ret
->barrier_probability
= 0.0;
171 sprintf(str
, "%dx%d%s", ret
->width
, ret
->height
,
172 ret
->wrapping ?
" wrapping" : "");
179 static void free_params(game_params
*params
)
184 static game_params
*dup_params(game_params
*params
)
186 game_params
*ret
= snew(game_params
);
187 *ret
= *params
; /* structure copy */
191 static void decode_params(game_params
*ret
, char const *string
)
193 char const *p
= string
;
195 ret
->width
= atoi(p
);
196 while (*p
&& isdigit(*p
)) p
++;
199 ret
->height
= atoi(p
);
200 while (*p
&& isdigit(*p
)) p
++;
201 if ( (ret
->wrapping
= (*p
== 'w')) != 0 )
204 ret
->barrier_probability
= atof(p
+1);
206 ret
->height
= ret
->width
;
210 static char *encode_params(game_params
*params
, int full
)
215 len
= sprintf(ret
, "%dx%d", params
->width
, params
->height
);
216 if (params
->wrapping
)
218 if (full
&& params
->barrier_probability
)
219 len
+= sprintf(ret
+len
, "b%g", params
->barrier_probability
);
220 assert(len
< lenof(ret
));
226 static config_item
*game_configure(game_params
*params
)
231 ret
= snewn(5, config_item
);
233 ret
[0].name
= "Width";
234 ret
[0].type
= C_STRING
;
235 sprintf(buf
, "%d", params
->width
);
236 ret
[0].sval
= dupstr(buf
);
239 ret
[1].name
= "Height";
240 ret
[1].type
= C_STRING
;
241 sprintf(buf
, "%d", params
->height
);
242 ret
[1].sval
= dupstr(buf
);
245 ret
[2].name
= "Walls wrap around";
246 ret
[2].type
= C_BOOLEAN
;
248 ret
[2].ival
= params
->wrapping
;
250 ret
[3].name
= "Barrier probability";
251 ret
[3].type
= C_STRING
;
252 sprintf(buf
, "%g", params
->barrier_probability
);
253 ret
[3].sval
= dupstr(buf
);
264 static game_params
*custom_params(config_item
*cfg
)
266 game_params
*ret
= snew(game_params
);
268 ret
->width
= atoi(cfg
[0].sval
);
269 ret
->height
= atoi(cfg
[1].sval
);
270 ret
->wrapping
= cfg
[2].ival
;
271 ret
->barrier_probability
= (float)atof(cfg
[3].sval
);
276 static char *validate_params(game_params
*params
)
278 if (params
->width
<= 0 && params
->height
<= 0)
279 return "Width and height must both be greater than zero";
280 if (params
->width
<= 0)
281 return "Width must be greater than zero";
282 if (params
->height
<= 0)
283 return "Height must be greater than zero";
284 if (params
->width
<= 1 && params
->height
<= 1)
285 return "At least one of width and height must be greater than one";
286 if (params
->barrier_probability
< 0)
287 return "Barrier probability may not be negative";
288 if (params
->barrier_probability
> 1)
289 return "Barrier probability may not be greater than 1";
293 /* ----------------------------------------------------------------------
294 * Randomly select a new game description.
297 static char *new_game_desc(game_params
*params
, random_state
*rs
,
300 tree234
*possibilities
, *barriertree
;
301 int w
, h
, x
, y
, cx
, cy
, nbarriers
;
302 unsigned char *tiles
, *barriers
;
308 tiles
= snewn(w
* h
, unsigned char);
309 memset(tiles
, 0, w
* h
);
310 barriers
= snewn(w
* h
, unsigned char);
311 memset(barriers
, 0, w
* h
);
317 * Construct the unshuffled grid.
319 * To do this, we simply start at the centre point, repeatedly
320 * choose a random possibility out of the available ways to
321 * extend a used square into an unused one, and do it. After
322 * extending the third line out of a square, we remove the
323 * fourth from the possibilities list to avoid any full-cross
324 * squares (which would make the game too easy because they
325 * only have one orientation).
327 * The slightly worrying thing is the avoidance of full-cross
328 * squares. Can this cause our unsophisticated construction
329 * algorithm to paint itself into a corner, by getting into a
330 * situation where there are some unreached squares and the
331 * only way to reach any of them is to extend a T-piece into a
334 * Answer: no it can't, and here's a proof.
336 * Any contiguous group of such unreachable squares must be
337 * surrounded on _all_ sides by T-pieces pointing away from the
338 * group. (If not, then there is a square which can be extended
339 * into one of the `unreachable' ones, and so it wasn't
340 * unreachable after all.) In particular, this implies that
341 * each contiguous group of unreachable squares must be
342 * rectangular in shape (any deviation from that yields a
343 * non-T-piece next to an `unreachable' square).
345 * So we have a rectangle of unreachable squares, with T-pieces
346 * forming a solid border around the rectangle. The corners of
347 * that border must be connected (since every tile connects all
348 * the lines arriving in it), and therefore the border must
349 * form a closed loop around the rectangle.
351 * But this can't have happened in the first place, since we
352 * _know_ we've avoided creating closed loops! Hence, no such
353 * situation can ever arise, and the naive grid construction
354 * algorithm will guaranteeably result in a complete grid
355 * containing no unreached squares, no full crosses _and_ no
358 possibilities
= newtree234(xyd_cmp
);
361 add234(possibilities
, new_xyd(cx
, cy
, R
));
363 add234(possibilities
, new_xyd(cx
, cy
, U
));
365 add234(possibilities
, new_xyd(cx
, cy
, L
));
367 add234(possibilities
, new_xyd(cx
, cy
, D
));
369 while (count234(possibilities
) > 0) {
372 int x1
, y1
, d1
, x2
, y2
, d2
, d
;
375 * Extract a randomly chosen possibility from the list.
377 i
= random_upto(rs
, count234(possibilities
));
378 xyd
= delpos234(possibilities
, i
);
384 OFFSET(x2
, y2
, x1
, y1
, d1
, params
);
387 printf("picked (%d,%d,%c) <-> (%d,%d,%c)\n",
388 x1
, y1
, "0RU3L567D9abcdef"[d1
], x2
, y2
, "0RU3L567D9abcdef"[d2
]);
392 * Make the connection. (We should be moving to an as yet
395 index(params
, tiles
, x1
, y1
) |= d1
;
396 assert(index(params
, tiles
, x2
, y2
) == 0);
397 index(params
, tiles
, x2
, y2
) |= d2
;
400 * If we have created a T-piece, remove its last
403 if (COUNT(index(params
, tiles
, x1
, y1
)) == 3) {
404 struct xyd xyd1
, *xydp
;
408 xyd1
.direction
= 0x0F ^ index(params
, tiles
, x1
, y1
);
410 xydp
= find234(possibilities
, &xyd1
, NULL
);
414 printf("T-piece; removing (%d,%d,%c)\n",
415 xydp
->x
, xydp
->y
, "0RU3L567D9abcdef"[xydp
->direction
]);
417 del234(possibilities
, xydp
);
423 * Remove all other possibilities that were pointing at the
424 * tile we've just moved into.
426 for (d
= 1; d
< 0x10; d
<<= 1) {
428 struct xyd xyd1
, *xydp
;
430 OFFSET(x3
, y3
, x2
, y2
, d
, params
);
437 xydp
= find234(possibilities
, &xyd1
, NULL
);
441 printf("Loop avoidance; removing (%d,%d,%c)\n",
442 xydp
->x
, xydp
->y
, "0RU3L567D9abcdef"[xydp
->direction
]);
444 del234(possibilities
, xydp
);
450 * Add new possibilities to the list for moving _out_ of
451 * the tile we have just moved into.
453 for (d
= 1; d
< 0x10; d
<<= 1) {
457 continue; /* we've got this one already */
459 if (!params
->wrapping
) {
460 if (d
== U
&& y2
== 0)
462 if (d
== D
&& y2
== h
-1)
464 if (d
== L
&& x2
== 0)
466 if (d
== R
&& x2
== w
-1)
470 OFFSET(x3
, y3
, x2
, y2
, d
, params
);
472 if (index(params
, tiles
, x3
, y3
))
473 continue; /* this would create a loop */
476 printf("New frontier; adding (%d,%d,%c)\n",
477 x2
, y2
, "0RU3L567D9abcdef"[d
]);
479 add234(possibilities
, new_xyd(x2
, y2
, d
));
482 /* Having done that, we should have no possibilities remaining. */
483 assert(count234(possibilities
) == 0);
484 freetree234(possibilities
);
487 * Now compute a list of the possible barrier locations.
489 barriertree
= newtree234(xyd_cmp
);
490 for (y
= 0; y
< h
; y
++) {
491 for (x
= 0; x
< w
; x
++) {
493 if (!(index(params
, tiles
, x
, y
) & R
) &&
494 (params
->wrapping
|| x
< w
-1))
495 add234(barriertree
, new_xyd(x
, y
, R
));
496 if (!(index(params
, tiles
, x
, y
) & D
) &&
497 (params
->wrapping
|| y
< h
-1))
498 add234(barriertree
, new_xyd(x
, y
, D
));
503 * Save the unshuffled grid in an aux_info.
506 game_aux_info
*solution
;
508 solution
= snew(game_aux_info
);
510 solution
->height
= h
;
511 solution
->tiles
= snewn(w
* h
, unsigned char);
512 memcpy(solution
->tiles
, tiles
, w
* h
);
518 * Now shuffle the grid.
520 for (y
= 0; y
< h
; y
++) {
521 for (x
= 0; x
< w
; x
++) {
522 int orig
= index(params
, tiles
, x
, y
);
523 int rot
= random_upto(rs
, 4);
524 index(params
, tiles
, x
, y
) = ROT(orig
, rot
);
529 * And now choose barrier locations. (We carefully do this
530 * _after_ shuffling, so that changing the barrier rate in the
531 * params while keeping the random seed the same will give the
532 * same shuffled grid and _only_ change the barrier locations.
533 * Also the way we choose barrier locations, by repeatedly
534 * choosing one possibility from the list until we have enough,
535 * is designed to ensure that raising the barrier rate while
536 * keeping the seed the same will provide a superset of the
537 * previous barrier set - i.e. if you ask for 10 barriers, and
538 * then decide that's still too hard and ask for 20, you'll get
539 * the original 10 plus 10 more, rather than getting 20 new
540 * ones and the chance of remembering your first 10.)
542 nbarriers
= (int)(params
->barrier_probability
* count234(barriertree
));
543 assert(nbarriers
>= 0 && nbarriers
<= count234(barriertree
));
545 while (nbarriers
> 0) {
548 int x1
, y1
, d1
, x2
, y2
, d2
;
551 * Extract a randomly chosen barrier from the list.
553 i
= random_upto(rs
, count234(barriertree
));
554 xyd
= delpos234(barriertree
, i
);
563 OFFSET(x2
, y2
, x1
, y1
, d1
, params
);
566 index(params
, barriers
, x1
, y1
) |= d1
;
567 index(params
, barriers
, x2
, y2
) |= d2
;
573 * Clean up the rest of the barrier list.
578 while ( (xyd
= delpos234(barriertree
, 0)) != NULL
)
581 freetree234(barriertree
);
585 * Finally, encode the grid into a string game description.
587 * My syntax is extremely simple: each square is encoded as a
588 * hex digit in which bit 0 means a connection on the right,
589 * bit 1 means up, bit 2 left and bit 3 down. (i.e. the same
590 * encoding as used internally). Each digit is followed by
591 * optional barrier indicators: `v' means a vertical barrier to
592 * the right of it, and `h' means a horizontal barrier below
595 desc
= snewn(w
* h
* 3 + 1, char);
597 for (y
= 0; y
< h
; y
++) {
598 for (x
= 0; x
< w
; x
++) {
599 *p
++ = "0123456789abcdef"[index(params
, tiles
, x
, y
)];
600 if ((params
->wrapping
|| x
< w
-1) &&
601 (index(params
, barriers
, x
, y
) & R
))
603 if ((params
->wrapping
|| y
< h
-1) &&
604 (index(params
, barriers
, x
, y
) & D
))
608 assert(p
- desc
<= w
*h
*3);
616 static void game_free_aux_info(game_aux_info
*aux
)
622 static char *validate_desc(game_params
*params
, char *desc
)
624 int w
= params
->width
, h
= params
->height
;
627 for (i
= 0; i
< w
*h
; i
++) {
628 if (*desc
>= '0' && *desc
<= '9')
630 else if (*desc
>= 'a' && *desc
<= 'f')
632 else if (*desc
>= 'A' && *desc
<= 'F')
635 return "Game description shorter than expected";
637 return "Game description contained unexpected character";
639 while (*desc
== 'h' || *desc
== 'v')
643 return "Game description longer than expected";
648 /* ----------------------------------------------------------------------
649 * Construct an initial game state, given a description and parameters.
652 static game_state
*new_game(game_params
*params
, char *desc
)
657 assert(params
->width
> 0 && params
->height
> 0);
658 assert(params
->width
> 1 || params
->height
> 1);
661 * Create a blank game state.
663 state
= snew(game_state
);
664 w
= state
->width
= params
->width
;
665 h
= state
->height
= params
->height
;
666 state
->cx
= state
->width
/ 2;
667 state
->cy
= state
->height
/ 2;
668 state
->wrapping
= params
->wrapping
;
669 state
->last_rotate_dir
= state
->last_rotate_x
= state
->last_rotate_y
= 0;
670 state
->completed
= state
->used_solve
= state
->just_used_solve
= FALSE
;
671 state
->tiles
= snewn(state
->width
* state
->height
, unsigned char);
672 memset(state
->tiles
, 0, state
->width
* state
->height
);
673 state
->barriers
= snewn(state
->width
* state
->height
, unsigned char);
674 memset(state
->barriers
, 0, state
->width
* state
->height
);
677 * Parse the game description into the grid.
679 for (y
= 0; y
< h
; y
++) {
680 for (x
= 0; x
< w
; x
++) {
681 if (*desc
>= '0' && *desc
<= '9')
682 tile(state
, x
, y
) = *desc
- '0';
683 else if (*desc
>= 'a' && *desc
<= 'f')
684 tile(state
, x
, y
) = *desc
- 'a' + 10;
685 else if (*desc
>= 'A' && *desc
<= 'F')
686 tile(state
, x
, y
) = *desc
- 'A' + 10;
689 while (*desc
== 'h' || *desc
== 'v') {
696 OFFSET(x2
, y2
, x
, y
, d1
, state
);
699 barrier(state
, x
, y
) |= d1
;
700 barrier(state
, x2
, y2
) |= d2
;
708 * Set up border barriers if this is a non-wrapping game.
710 if (!state
->wrapping
) {
711 for (x
= 0; x
< state
->width
; x
++) {
712 barrier(state
, x
, 0) |= U
;
713 barrier(state
, x
, state
->height
-1) |= D
;
715 for (y
= 0; y
< state
->height
; y
++) {
716 barrier(state
, 0, y
) |= L
;
717 barrier(state
, state
->width
-1, y
) |= R
;
722 * Set up the barrier corner flags, for drawing barriers
723 * prettily when they meet.
725 for (y
= 0; y
< state
->height
; y
++) {
726 for (x
= 0; x
< state
->width
; x
++) {
729 for (dir
= 1; dir
< 0x10; dir
<<= 1) {
731 int x1
, y1
, x2
, y2
, x3
, y3
;
734 if (!(barrier(state
, x
, y
) & dir
))
737 if (barrier(state
, x
, y
) & dir2
)
740 x1
= x
+ X(dir
), y1
= y
+ Y(dir
);
741 if (x1
>= 0 && x1
< state
->width
&&
742 y1
>= 0 && y1
< state
->height
&&
743 (barrier(state
, x1
, y1
) & dir2
))
746 x2
= x
+ X(dir2
), y2
= y
+ Y(dir2
);
747 if (x2
>= 0 && x2
< state
->width
&&
748 y2
>= 0 && y2
< state
->height
&&
749 (barrier(state
, x2
, y2
) & dir
))
753 barrier(state
, x
, y
) |= (dir
<< 4);
754 if (x1
>= 0 && x1
< state
->width
&&
755 y1
>= 0 && y1
< state
->height
)
756 barrier(state
, x1
, y1
) |= (A(dir
) << 4);
757 if (x2
>= 0 && x2
< state
->width
&&
758 y2
>= 0 && y2
< state
->height
)
759 barrier(state
, x2
, y2
) |= (C(dir
) << 4);
760 x3
= x
+ X(dir
) + X(dir2
), y3
= y
+ Y(dir
) + Y(dir2
);
761 if (x3
>= 0 && x3
< state
->width
&&
762 y3
>= 0 && y3
< state
->height
)
763 barrier(state
, x3
, y3
) |= (F(dir
) << 4);
772 static game_state
*dup_game(game_state
*state
)
776 ret
= snew(game_state
);
777 ret
->width
= state
->width
;
778 ret
->height
= state
->height
;
781 ret
->wrapping
= state
->wrapping
;
782 ret
->completed
= state
->completed
;
783 ret
->used_solve
= state
->used_solve
;
784 ret
->just_used_solve
= state
->just_used_solve
;
785 ret
->last_rotate_dir
= state
->last_rotate_dir
;
786 ret
->last_rotate_x
= state
->last_rotate_x
;
787 ret
->last_rotate_y
= state
->last_rotate_y
;
788 ret
->tiles
= snewn(state
->width
* state
->height
, unsigned char);
789 memcpy(ret
->tiles
, state
->tiles
, state
->width
* state
->height
);
790 ret
->barriers
= snewn(state
->width
* state
->height
, unsigned char);
791 memcpy(ret
->barriers
, state
->barriers
, state
->width
* state
->height
);
796 static void free_game(game_state
*state
)
799 sfree(state
->barriers
);
803 static game_state
*solve_game(game_state
*state
, game_aux_info
*aux
,
809 *error
= "Solution not known for this puzzle";
813 assert(aux
->width
== state
->width
);
814 assert(aux
->height
== state
->height
);
815 ret
= dup_game(state
);
816 memcpy(ret
->tiles
, aux
->tiles
, ret
->width
* ret
->height
);
817 ret
->used_solve
= ret
->just_used_solve
= TRUE
;
818 ret
->completed
= TRUE
;
823 static char *game_text_format(game_state
*state
)
828 /* ----------------------------------------------------------------------
833 * Compute which squares are reachable from the centre square, as a
834 * quick visual aid to determining how close the game is to
835 * completion. This is also a simple way to tell if the game _is_
836 * completed - just call this function and see whether every square
839 static unsigned char *compute_active(game_state
*state
)
841 unsigned char *active
;
845 active
= snewn(state
->width
* state
->height
, unsigned char);
846 memset(active
, 0, state
->width
* state
->height
);
849 * We only store (x,y) pairs in todo, but it's easier to reuse
850 * xyd_cmp and just store direction 0 every time.
852 todo
= newtree234(xyd_cmp
);
853 index(state
, active
, state
->cx
, state
->cy
) = ACTIVE
;
854 add234(todo
, new_xyd(state
->cx
, state
->cy
, 0));
856 while ( (xyd
= delpos234(todo
, 0)) != NULL
) {
857 int x1
, y1
, d1
, x2
, y2
, d2
;
863 for (d1
= 1; d1
< 0x10; d1
<<= 1) {
864 OFFSET(x2
, y2
, x1
, y1
, d1
, state
);
868 * If the next tile in this direction is connected to
869 * us, and there isn't a barrier in the way, and it
870 * isn't already marked active, then mark it active and
871 * add it to the to-examine list.
873 if ((tile(state
, x1
, y1
) & d1
) &&
874 (tile(state
, x2
, y2
) & d2
) &&
875 !(barrier(state
, x1
, y1
) & d1
) &&
876 !index(state
, active
, x2
, y2
)) {
877 index(state
, active
, x2
, y2
) = ACTIVE
;
878 add234(todo
, new_xyd(x2
, y2
, 0));
882 /* Now we expect the todo list to have shrunk to zero size. */
883 assert(count234(todo
) == 0);
892 random_state
*rs
; /* used for jumbling */
895 static game_ui
*new_ui(game_state
*state
)
899 game_ui
*ui
= snew(game_ui
);
900 ui
->cur_x
= state
->width
/ 2;
901 ui
->cur_y
= state
->height
/ 2;
902 ui
->cur_visible
= FALSE
;
903 get_random_seed(&seed
, &seedsize
);
904 ui
->rs
= random_init(seed
, seedsize
);
910 static void free_ui(game_ui
*ui
)
916 /* ----------------------------------------------------------------------
919 static game_state
*make_move(game_state
*state
, game_ui
*ui
,
920 int x
, int y
, int button
)
922 game_state
*ret
, *nullret
;
927 if (button
== LEFT_BUTTON
||
928 button
== MIDDLE_BUTTON
||
929 button
== RIGHT_BUTTON
) {
931 if (ui
->cur_visible
) {
932 ui
->cur_visible
= FALSE
;
937 * The button must have been clicked on a valid tile.
939 x
-= WINDOW_OFFSET
+ TILE_BORDER
;
940 y
-= WINDOW_OFFSET
+ TILE_BORDER
;
945 if (tx
>= state
->width
|| ty
>= state
->height
)
947 if (x
% TILE_SIZE
>= TILE_SIZE
- TILE_BORDER
||
948 y
% TILE_SIZE
>= TILE_SIZE
- TILE_BORDER
)
950 } else if (button
== CURSOR_UP
|| button
== CURSOR_DOWN
||
951 button
== CURSOR_RIGHT
|| button
== CURSOR_LEFT
) {
952 if (button
== CURSOR_UP
&& ui
->cur_y
> 0)
954 else if (button
== CURSOR_DOWN
&& ui
->cur_y
< state
->height
-1)
956 else if (button
== CURSOR_LEFT
&& ui
->cur_x
> 0)
958 else if (button
== CURSOR_RIGHT
&& ui
->cur_x
< state
->width
-1)
961 return nullret
; /* no cursor movement */
962 ui
->cur_visible
= TRUE
;
963 return state
; /* UI activity has occurred */
964 } else if (button
== 'a' || button
== 's' || button
== 'd' ||
965 button
== 'A' || button
== 'S' || button
== 'D') {
968 if (button
== 'a' || button
== 'A')
969 button
= LEFT_BUTTON
;
970 else if (button
== 's' || button
== 'S')
971 button
= MIDDLE_BUTTON
;
972 else if (button
== 'd' || button
== 'D')
973 button
= RIGHT_BUTTON
;
974 ui
->cur_visible
= TRUE
;
975 } else if (button
== 'j' || button
== 'J') {
976 /* XXX should we have some mouse control for this? */
977 button
= 'J'; /* canonify */
978 tx
= ty
= -1; /* shut gcc up :( */
983 * The middle button locks or unlocks a tile. (A locked tile
984 * cannot be turned, and is visually marked as being locked.
985 * This is a convenience for the player, so that once they are
986 * sure which way round a tile goes, they can lock it and thus
987 * avoid forgetting later on that they'd already done that one;
988 * and the locking also prevents them turning the tile by
989 * accident. If they change their mind, another middle click
992 if (button
== MIDDLE_BUTTON
) {
994 ret
= dup_game(state
);
995 ret
->just_used_solve
= FALSE
;
996 tile(ret
, tx
, ty
) ^= LOCKED
;
997 ret
->last_rotate_dir
= ret
->last_rotate_x
= ret
->last_rotate_y
= 0;
1000 } else if (button
== LEFT_BUTTON
|| button
== RIGHT_BUTTON
) {
1003 * The left and right buttons have no effect if clicked on a
1006 if (tile(state
, tx
, ty
) & LOCKED
)
1010 * Otherwise, turn the tile one way or the other. Left button
1011 * turns anticlockwise; right button turns clockwise.
1013 ret
= dup_game(state
);
1014 ret
->just_used_solve
= FALSE
;
1015 orig
= tile(ret
, tx
, ty
);
1016 if (button
== LEFT_BUTTON
) {
1017 tile(ret
, tx
, ty
) = A(orig
);
1018 ret
->last_rotate_dir
= +1;
1020 tile(ret
, tx
, ty
) = C(orig
);
1021 ret
->last_rotate_dir
= -1;
1023 ret
->last_rotate_x
= tx
;
1024 ret
->last_rotate_y
= ty
;
1026 } else if (button
== 'J') {
1029 * Jumble all unlocked tiles to random orientations.
1032 ret
= dup_game(state
);
1033 ret
->just_used_solve
= FALSE
;
1034 for (jy
= 0; jy
< ret
->height
; jy
++) {
1035 for (jx
= 0; jx
< ret
->width
; jx
++) {
1036 if (!(tile(ret
, jx
, jy
) & LOCKED
)) {
1037 int rot
= random_upto(ui
->rs
, 4);
1038 orig
= tile(ret
, jx
, jy
);
1039 tile(ret
, jx
, jy
) = ROT(orig
, rot
);
1043 ret
->last_rotate_dir
= 0; /* suppress animation */
1044 ret
->last_rotate_x
= ret
->last_rotate_y
= 0;
1049 * Check whether the game has been completed.
1052 unsigned char *active
= compute_active(ret
);
1054 int complete
= TRUE
;
1056 for (x1
= 0; x1
< ret
->width
; x1
++)
1057 for (y1
= 0; y1
< ret
->height
; y1
++)
1058 if ((tile(ret
, x1
, y1
) & 0xF) && !index(ret
, active
, x1
, y1
)) {
1060 goto break_label
; /* break out of two loops at once */
1067 ret
->completed
= TRUE
;
1073 /* ----------------------------------------------------------------------
1074 * Routines for drawing the game position on the screen.
1077 struct game_drawstate
{
1080 unsigned char *visible
;
1083 static game_drawstate
*game_new_drawstate(game_state
*state
)
1085 game_drawstate
*ds
= snew(game_drawstate
);
1087 ds
->started
= FALSE
;
1088 ds
->width
= state
->width
;
1089 ds
->height
= state
->height
;
1090 ds
->visible
= snewn(state
->width
* state
->height
, unsigned char);
1091 memset(ds
->visible
, 0xFF, state
->width
* state
->height
);
1096 static void game_free_drawstate(game_drawstate
*ds
)
1102 static void game_size(game_params
*params
, int *x
, int *y
)
1104 *x
= WINDOW_OFFSET
* 2 + TILE_SIZE
* params
->width
+ TILE_BORDER
;
1105 *y
= WINDOW_OFFSET
* 2 + TILE_SIZE
* params
->height
+ TILE_BORDER
;
1108 static float *game_colours(frontend
*fe
, game_state
*state
, int *ncolours
)
1112 ret
= snewn(NCOLOURS
* 3, float);
1113 *ncolours
= NCOLOURS
;
1116 * Basic background colour is whatever the front end thinks is
1117 * a sensible default.
1119 frontend_default_colour(fe
, &ret
[COL_BACKGROUND
* 3]);
1124 ret
[COL_WIRE
* 3 + 0] = 0.0F
;
1125 ret
[COL_WIRE
* 3 + 1] = 0.0F
;
1126 ret
[COL_WIRE
* 3 + 2] = 0.0F
;
1129 * Powered wires and powered endpoints are cyan.
1131 ret
[COL_POWERED
* 3 + 0] = 0.0F
;
1132 ret
[COL_POWERED
* 3 + 1] = 1.0F
;
1133 ret
[COL_POWERED
* 3 + 2] = 1.0F
;
1138 ret
[COL_BARRIER
* 3 + 0] = 1.0F
;
1139 ret
[COL_BARRIER
* 3 + 1] = 0.0F
;
1140 ret
[COL_BARRIER
* 3 + 2] = 0.0F
;
1143 * Unpowered endpoints are blue.
1145 ret
[COL_ENDPOINT
* 3 + 0] = 0.0F
;
1146 ret
[COL_ENDPOINT
* 3 + 1] = 0.0F
;
1147 ret
[COL_ENDPOINT
* 3 + 2] = 1.0F
;
1150 * Tile borders are a darker grey than the background.
1152 ret
[COL_BORDER
* 3 + 0] = 0.5F
* ret
[COL_BACKGROUND
* 3 + 0];
1153 ret
[COL_BORDER
* 3 + 1] = 0.5F
* ret
[COL_BACKGROUND
* 3 + 1];
1154 ret
[COL_BORDER
* 3 + 2] = 0.5F
* ret
[COL_BACKGROUND
* 3 + 2];
1157 * Locked tiles are a grey in between those two.
1159 ret
[COL_LOCKED
* 3 + 0] = 0.75F
* ret
[COL_BACKGROUND
* 3 + 0];
1160 ret
[COL_LOCKED
* 3 + 1] = 0.75F
* ret
[COL_BACKGROUND
* 3 + 1];
1161 ret
[COL_LOCKED
* 3 + 2] = 0.75F
* ret
[COL_BACKGROUND
* 3 + 2];
1166 static void draw_thick_line(frontend
*fe
, int x1
, int y1
, int x2
, int y2
,
1169 draw_line(fe
, x1
-1, y1
, x2
-1, y2
, COL_WIRE
);
1170 draw_line(fe
, x1
+1, y1
, x2
+1, y2
, COL_WIRE
);
1171 draw_line(fe
, x1
, y1
-1, x2
, y2
-1, COL_WIRE
);
1172 draw_line(fe
, x1
, y1
+1, x2
, y2
+1, COL_WIRE
);
1173 draw_line(fe
, x1
, y1
, x2
, y2
, colour
);
1176 static void draw_rect_coords(frontend
*fe
, int x1
, int y1
, int x2
, int y2
,
1179 int mx
= (x1
< x2 ? x1
: x2
);
1180 int my
= (y1
< y2 ? y1
: y2
);
1181 int dx
= (x2
+ x1
- 2*mx
+ 1);
1182 int dy
= (y2
+ y1
- 2*my
+ 1);
1184 draw_rect(fe
, mx
, my
, dx
, dy
, colour
);
1187 static void draw_barrier_corner(frontend
*fe
, int x
, int y
, int dir
, int phase
)
1189 int bx
= WINDOW_OFFSET
+ TILE_SIZE
* x
;
1190 int by
= WINDOW_OFFSET
+ TILE_SIZE
* y
;
1191 int x1
, y1
, dx
, dy
, dir2
;
1196 dx
= X(dir
) + X(dir2
);
1197 dy
= Y(dir
) + Y(dir2
);
1198 x1
= (dx
> 0 ? TILE_SIZE
+TILE_BORDER
-1 : 0);
1199 y1
= (dy
> 0 ? TILE_SIZE
+TILE_BORDER
-1 : 0);
1202 draw_rect_coords(fe
, bx
+x1
, by
+y1
,
1203 bx
+x1
-TILE_BORDER
*dx
, by
+y1
-(TILE_BORDER
-1)*dy
,
1205 draw_rect_coords(fe
, bx
+x1
, by
+y1
,
1206 bx
+x1
-(TILE_BORDER
-1)*dx
, by
+y1
-TILE_BORDER
*dy
,
1209 draw_rect_coords(fe
, bx
+x1
, by
+y1
,
1210 bx
+x1
-(TILE_BORDER
-1)*dx
, by
+y1
-(TILE_BORDER
-1)*dy
,
1215 static void draw_barrier(frontend
*fe
, int x
, int y
, int dir
, int phase
)
1217 int bx
= WINDOW_OFFSET
+ TILE_SIZE
* x
;
1218 int by
= WINDOW_OFFSET
+ TILE_SIZE
* y
;
1221 x1
= (X(dir
) > 0 ? TILE_SIZE
: X(dir
) == 0 ? TILE_BORDER
: 0);
1222 y1
= (Y(dir
) > 0 ? TILE_SIZE
: Y(dir
) == 0 ? TILE_BORDER
: 0);
1223 w
= (X(dir
) ? TILE_BORDER
: TILE_SIZE
- TILE_BORDER
);
1224 h
= (Y(dir
) ? TILE_BORDER
: TILE_SIZE
- TILE_BORDER
);
1227 draw_rect(fe
, bx
+x1
-X(dir
), by
+y1
-Y(dir
), w
, h
, COL_WIRE
);
1229 draw_rect(fe
, bx
+x1
, by
+y1
, w
, h
, COL_BARRIER
);
1233 static void draw_tile(frontend
*fe
, game_state
*state
, int x
, int y
, int tile
,
1234 float angle
, int cursor
)
1236 int bx
= WINDOW_OFFSET
+ TILE_SIZE
* x
;
1237 int by
= WINDOW_OFFSET
+ TILE_SIZE
* y
;
1239 float cx
, cy
, ex
, ey
, tx
, ty
;
1240 int dir
, col
, phase
;
1243 * When we draw a single tile, we must draw everything up to
1244 * and including the borders around the tile. This means that
1245 * if the neighbouring tiles have connections to those borders,
1246 * we must draw those connections on the borders themselves.
1248 * This would be terribly fiddly if we ever had to draw a tile
1249 * while its neighbour was in mid-rotate, because we'd have to
1250 * arrange to _know_ that the neighbour was being rotated and
1251 * hence had an anomalous effect on the redraw of this tile.
1252 * Fortunately, the drawing algorithm avoids ever calling us in
1253 * this circumstance: we're either drawing lots of straight
1254 * tiles at game start or after a move is complete, or we're
1255 * repeatedly drawing only the rotating tile. So no problem.
1259 * So. First blank the tile out completely: draw a big
1260 * rectangle in border colour, and a smaller rectangle in
1261 * background colour to fill it in.
1263 draw_rect(fe
, bx
, by
, TILE_SIZE
+TILE_BORDER
, TILE_SIZE
+TILE_BORDER
,
1265 draw_rect(fe
, bx
+TILE_BORDER
, by
+TILE_BORDER
,
1266 TILE_SIZE
-TILE_BORDER
, TILE_SIZE
-TILE_BORDER
,
1267 tile
& LOCKED ? COL_LOCKED
: COL_BACKGROUND
);
1270 * Draw an inset outline rectangle as a cursor, in whichever of
1271 * COL_LOCKED and COL_BACKGROUND we aren't currently drawing
1275 draw_line(fe
, bx
+TILE_SIZE
/8, by
+TILE_SIZE
/8,
1276 bx
+TILE_SIZE
/8, by
+TILE_SIZE
-TILE_SIZE
/8,
1277 tile
& LOCKED ? COL_BACKGROUND
: COL_LOCKED
);
1278 draw_line(fe
, bx
+TILE_SIZE
/8, by
+TILE_SIZE
/8,
1279 bx
+TILE_SIZE
-TILE_SIZE
/8, by
+TILE_SIZE
/8,
1280 tile
& LOCKED ? COL_BACKGROUND
: COL_LOCKED
);
1281 draw_line(fe
, bx
+TILE_SIZE
-TILE_SIZE
/8, by
+TILE_SIZE
/8,
1282 bx
+TILE_SIZE
-TILE_SIZE
/8, by
+TILE_SIZE
-TILE_SIZE
/8,
1283 tile
& LOCKED ? COL_BACKGROUND
: COL_LOCKED
);
1284 draw_line(fe
, bx
+TILE_SIZE
/8, by
+TILE_SIZE
-TILE_SIZE
/8,
1285 bx
+TILE_SIZE
-TILE_SIZE
/8, by
+TILE_SIZE
-TILE_SIZE
/8,
1286 tile
& LOCKED ? COL_BACKGROUND
: COL_LOCKED
);
1290 * Set up the rotation matrix.
1292 matrix
[0] = (float)cos(angle
* PI
/ 180.0);
1293 matrix
[1] = (float)-sin(angle
* PI
/ 180.0);
1294 matrix
[2] = (float)sin(angle
* PI
/ 180.0);
1295 matrix
[3] = (float)cos(angle
* PI
/ 180.0);
1300 cx
= cy
= TILE_BORDER
+ (TILE_SIZE
-TILE_BORDER
) / 2.0F
- 0.5F
;
1301 col
= (tile
& ACTIVE ? COL_POWERED
: COL_WIRE
);
1302 for (dir
= 1; dir
< 0x10; dir
<<= 1) {
1304 ex
= (TILE_SIZE
- TILE_BORDER
- 1.0F
) / 2.0F
* X(dir
);
1305 ey
= (TILE_SIZE
- TILE_BORDER
- 1.0F
) / 2.0F
* Y(dir
);
1306 MATMUL(tx
, ty
, matrix
, ex
, ey
);
1307 draw_thick_line(fe
, bx
+(int)cx
, by
+(int)cy
,
1308 bx
+(int)(cx
+tx
), by
+(int)(cy
+ty
),
1312 for (dir
= 1; dir
< 0x10; dir
<<= 1) {
1314 ex
= (TILE_SIZE
- TILE_BORDER
- 1.0F
) / 2.0F
* X(dir
);
1315 ey
= (TILE_SIZE
- TILE_BORDER
- 1.0F
) / 2.0F
* Y(dir
);
1316 MATMUL(tx
, ty
, matrix
, ex
, ey
);
1317 draw_line(fe
, bx
+(int)cx
, by
+(int)cy
,
1318 bx
+(int)(cx
+tx
), by
+(int)(cy
+ty
), col
);
1323 * Draw the box in the middle. We do this in blue if the tile
1324 * is an unpowered endpoint, in cyan if the tile is a powered
1325 * endpoint, in black if the tile is the centrepiece, and
1326 * otherwise not at all.
1329 if (x
== state
->cx
&& y
== state
->cy
)
1331 else if (COUNT(tile
) == 1) {
1332 col
= (tile
& ACTIVE ? COL_POWERED
: COL_ENDPOINT
);
1337 points
[0] = +1; points
[1] = +1;
1338 points
[2] = +1; points
[3] = -1;
1339 points
[4] = -1; points
[5] = -1;
1340 points
[6] = -1; points
[7] = +1;
1342 for (i
= 0; i
< 8; i
+= 2) {
1343 ex
= (TILE_SIZE
* 0.24F
) * points
[i
];
1344 ey
= (TILE_SIZE
* 0.24F
) * points
[i
+1];
1345 MATMUL(tx
, ty
, matrix
, ex
, ey
);
1346 points
[i
] = bx
+(int)(cx
+tx
);
1347 points
[i
+1] = by
+(int)(cy
+ty
);
1350 draw_polygon(fe
, points
, 4, TRUE
, col
);
1351 draw_polygon(fe
, points
, 4, FALSE
, COL_WIRE
);
1355 * Draw the points on the border if other tiles are connected
1358 for (dir
= 1; dir
< 0x10; dir
<<= 1) {
1359 int dx
, dy
, px
, py
, lx
, ly
, vx
, vy
, ox
, oy
;
1367 if (ox
< 0 || ox
>= state
->width
|| oy
< 0 || oy
>= state
->height
)
1370 if (!(tile(state
, ox
, oy
) & F(dir
)))
1373 px
= bx
+ (int)(dx
>0 ? TILE_SIZE
+ TILE_BORDER
- 1 : dx
<0 ?
0 : cx
);
1374 py
= by
+ (int)(dy
>0 ? TILE_SIZE
+ TILE_BORDER
- 1 : dy
<0 ?
0 : cy
);
1375 lx
= dx
* (TILE_BORDER
-1);
1376 ly
= dy
* (TILE_BORDER
-1);
1380 if (angle
== 0.0 && (tile
& dir
)) {
1382 * If we are fully connected to the other tile, we must
1383 * draw right across the tile border. (We can use our
1384 * own ACTIVE state to determine what colour to do this
1385 * in: if we are fully connected to the other tile then
1386 * the two ACTIVE states will be the same.)
1388 draw_rect_coords(fe
, px
-vx
, py
-vy
, px
+lx
+vx
, py
+ly
+vy
, COL_WIRE
);
1389 draw_rect_coords(fe
, px
, py
, px
+lx
, py
+ly
,
1390 (tile
& ACTIVE
) ? COL_POWERED
: COL_WIRE
);
1393 * The other tile extends into our border, but isn't
1394 * actually connected to us. Just draw a single black
1397 draw_rect_coords(fe
, px
, py
, px
, py
, COL_WIRE
);
1402 * Draw barrier corners, and then barriers.
1404 for (phase
= 0; phase
< 2; phase
++) {
1405 for (dir
= 1; dir
< 0x10; dir
<<= 1)
1406 if (barrier(state
, x
, y
) & (dir
<< 4))
1407 draw_barrier_corner(fe
, x
, y
, dir
<< 4, phase
);
1408 for (dir
= 1; dir
< 0x10; dir
<<= 1)
1409 if (barrier(state
, x
, y
) & dir
)
1410 draw_barrier(fe
, x
, y
, dir
, phase
);
1413 draw_update(fe
, bx
, by
, TILE_SIZE
+TILE_BORDER
, TILE_SIZE
+TILE_BORDER
);
1416 static void game_redraw(frontend
*fe
, game_drawstate
*ds
, game_state
*oldstate
,
1417 game_state
*state
, int dir
, game_ui
*ui
, float t
, float ft
)
1419 int x
, y
, tx
, ty
, frame
, last_rotate_dir
;
1420 unsigned char *active
;
1424 * Clear the screen and draw the exterior barrier lines if this
1425 * is our first call.
1433 WINDOW_OFFSET
* 2 + TILE_SIZE
* state
->width
+ TILE_BORDER
,
1434 WINDOW_OFFSET
* 2 + TILE_SIZE
* state
->height
+ TILE_BORDER
,
1436 draw_update(fe
, 0, 0,
1437 WINDOW_OFFSET
*2 + TILE_SIZE
*state
->width
+ TILE_BORDER
,
1438 WINDOW_OFFSET
*2 + TILE_SIZE
*state
->height
+ TILE_BORDER
);
1440 for (phase
= 0; phase
< 2; phase
++) {
1442 for (x
= 0; x
< ds
->width
; x
++) {
1443 if (barrier(state
, x
, 0) & UL
)
1444 draw_barrier_corner(fe
, x
, -1, LD
, phase
);
1445 if (barrier(state
, x
, 0) & RU
)
1446 draw_barrier_corner(fe
, x
, -1, DR
, phase
);
1447 if (barrier(state
, x
, 0) & U
)
1448 draw_barrier(fe
, x
, -1, D
, phase
);
1449 if (barrier(state
, x
, ds
->height
-1) & DR
)
1450 draw_barrier_corner(fe
, x
, ds
->height
, RU
, phase
);
1451 if (barrier(state
, x
, ds
->height
-1) & LD
)
1452 draw_barrier_corner(fe
, x
, ds
->height
, UL
, phase
);
1453 if (barrier(state
, x
, ds
->height
-1) & D
)
1454 draw_barrier(fe
, x
, ds
->height
, U
, phase
);
1457 for (y
= 0; y
< ds
->height
; y
++) {
1458 if (barrier(state
, 0, y
) & UL
)
1459 draw_barrier_corner(fe
, -1, y
, RU
, phase
);
1460 if (barrier(state
, 0, y
) & LD
)
1461 draw_barrier_corner(fe
, -1, y
, DR
, phase
);
1462 if (barrier(state
, 0, y
) & L
)
1463 draw_barrier(fe
, -1, y
, R
, phase
);
1464 if (barrier(state
, ds
->width
-1, y
) & RU
)
1465 draw_barrier_corner(fe
, ds
->width
, y
, UL
, phase
);
1466 if (barrier(state
, ds
->width
-1, y
) & DR
)
1467 draw_barrier_corner(fe
, ds
->width
, y
, LD
, phase
);
1468 if (barrier(state
, ds
->width
-1, y
) & R
)
1469 draw_barrier(fe
, ds
->width
, y
, L
, phase
);
1475 last_rotate_dir
= dir
==-1 ? oldstate
->last_rotate_dir
:
1476 state
->last_rotate_dir
;
1477 if (oldstate
&& (t
< ROTATE_TIME
) && last_rotate_dir
) {
1479 * We're animating a single tile rotation. Find the turning
1482 tx
= (dir
==-1 ? oldstate
->last_rotate_x
: state
->last_rotate_x
);
1483 ty
= (dir
==-1 ? oldstate
->last_rotate_y
: state
->last_rotate_y
);
1484 angle
= last_rotate_dir
* dir
* 90.0F
* (t
/ ROTATE_TIME
);
1491 * We're animating a completion flash. Find which frame
1494 frame
= (int)(ft
/ FLASH_FRAME
);
1498 * Draw any tile which differs from the way it was last drawn.
1500 active
= compute_active(state
);
1502 for (x
= 0; x
< ds
->width
; x
++)
1503 for (y
= 0; y
< ds
->height
; y
++) {
1504 unsigned char c
= tile(state
, x
, y
) | index(state
, active
, x
, y
);
1507 * In a completion flash, we adjust the LOCKED bit
1508 * depending on our distance from the centre point and
1512 int xdist
, ydist
, dist
;
1513 xdist
= (x
< state
->cx ? state
->cx
- x
: x
- state
->cx
);
1514 ydist
= (y
< state
->cy ? state
->cy
- y
: y
- state
->cy
);
1515 dist
= (xdist
> ydist ? xdist
: ydist
);
1517 if (frame
>= dist
&& frame
< dist
+4) {
1518 int lock
= (frame
- dist
) & 1;
1519 lock
= lock ? LOCKED
: 0;
1520 c
= (c
&~ LOCKED
) | lock
;
1524 if (index(state
, ds
->visible
, x
, y
) != c
||
1525 index(state
, ds
->visible
, x
, y
) == 0xFF ||
1526 (x
== tx
&& y
== ty
) ||
1527 (ui
->cur_visible
&& x
== ui
->cur_x
&& y
== ui
->cur_y
)) {
1528 draw_tile(fe
, state
, x
, y
, c
,
1529 (x
== tx
&& y
== ty ? angle
: 0.0F
),
1530 (ui
->cur_visible
&& x
== ui
->cur_x
&& y
== ui
->cur_y
));
1531 if ((x
== tx
&& y
== ty
) ||
1532 (ui
->cur_visible
&& x
== ui
->cur_x
&& y
== ui
->cur_y
))
1533 index(state
, ds
->visible
, x
, y
) = 0xFF;
1535 index(state
, ds
->visible
, x
, y
) = c
;
1540 * Update the status bar.
1543 char statusbuf
[256];
1546 n
= state
->width
* state
->height
;
1547 for (i
= a
= n2
= 0; i
< n
; i
++) {
1550 if (state
->tiles
[i
] & 0xF)
1554 sprintf(statusbuf
, "%sActive: %d/%d",
1555 (state
->used_solve ?
"Auto-solved. " :
1556 state
->completed ?
"COMPLETED! " : ""), a
, n2
);
1558 status_bar(fe
, statusbuf
);
1564 static float game_anim_length(game_state
*oldstate
,
1565 game_state
*newstate
, int dir
)
1567 int last_rotate_dir
;
1570 * Don't animate an auto-solve move.
1572 if ((dir
> 0 && newstate
->just_used_solve
) ||
1573 (dir
< 0 && oldstate
->just_used_solve
))
1577 * Don't animate if last_rotate_dir is zero.
1579 last_rotate_dir
= dir
==-1 ? oldstate
->last_rotate_dir
:
1580 newstate
->last_rotate_dir
;
1581 if (last_rotate_dir
)
1587 static float game_flash_length(game_state
*oldstate
,
1588 game_state
*newstate
, int dir
)
1591 * If the game has just been completed, we display a completion
1594 if (!oldstate
->completed
&& newstate
->completed
&&
1595 !oldstate
->used_solve
&& !newstate
->used_solve
) {
1598 if (size
< newstate
->cx
+1)
1599 size
= newstate
->cx
+1;
1600 if (size
< newstate
->cy
+1)
1601 size
= newstate
->cy
+1;
1602 if (size
< newstate
->width
- newstate
->cx
)
1603 size
= newstate
->width
- newstate
->cx
;
1604 if (size
< newstate
->height
- newstate
->cy
)
1605 size
= newstate
->height
- newstate
->cy
;
1606 return FLASH_FRAME
* (size
+4);
1612 static int game_wants_statusbar(void)
1621 const struct game thegame
= {
1629 TRUE
, game_configure
, custom_params
,
1638 FALSE
, game_text_format
,
1645 game_free_drawstate
,
1649 game_wants_statusbar
,