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
76 float barrier_probability
;
79 struct game_aux_info
{
85 int width
, height
, cx
, cy
, wrapping
, completed
;
86 int last_rotate_x
, last_rotate_y
, last_rotate_dir
;
87 int used_solve
, just_used_solve
;
89 unsigned char *barriers
;
92 #define OFFSETWH(x2,y2,x1,y1,dir,width,height) \
93 ( (x2) = ((x1) + width + X((dir))) % width, \
94 (y2) = ((y1) + height + Y((dir))) % height)
96 #define OFFSET(x2,y2,x1,y1,dir,state) \
97 OFFSETWH(x2,y2,x1,y1,dir,(state)->width,(state)->height)
99 #define index(state, a, x, y) ( a[(y) * (state)->width + (x)] )
100 #define tile(state, x, y) index(state, (state)->tiles, x, y)
101 #define barrier(state, x, y) index(state, (state)->barriers, x, y)
107 static int xyd_cmp(const void *av
, const void *bv
) {
108 const struct xyd
*a
= (const struct xyd
*)av
;
109 const struct xyd
*b
= (const struct xyd
*)bv
;
118 if (a
->direction
< b
->direction
)
120 if (a
->direction
> b
->direction
)
125 static int xyd_cmp_nc(void *av
, void *bv
) { return xyd_cmp(av
, bv
); }
127 static struct xyd
*new_xyd(int x
, int y
, int direction
)
129 struct xyd
*xyd
= snew(struct xyd
);
132 xyd
->direction
= direction
;
136 /* ----------------------------------------------------------------------
137 * Manage game parameters.
139 static game_params
*default_params(void)
141 game_params
*ret
= snew(game_params
);
145 ret
->wrapping
= FALSE
;
147 ret
->barrier_probability
= 0.0;
152 static int game_fetch_preset(int i
, char **name
, game_params
**params
)
156 static const struct { int x
, y
, wrap
; } values
[] = {
169 if (i
< 0 || i
>= lenof(values
))
172 ret
= snew(game_params
);
173 ret
->width
= values
[i
].x
;
174 ret
->height
= values
[i
].y
;
175 ret
->wrapping
= values
[i
].wrap
;
177 ret
->barrier_probability
= 0.0;
179 sprintf(str
, "%dx%d%s", ret
->width
, ret
->height
,
180 ret
->wrapping ?
" wrapping" : "");
187 static void free_params(game_params
*params
)
192 static game_params
*dup_params(game_params
*params
)
194 game_params
*ret
= snew(game_params
);
195 *ret
= *params
; /* structure copy */
199 static void decode_params(game_params
*ret
, char const *string
)
201 char const *p
= string
;
203 ret
->width
= atoi(p
);
204 while (*p
&& isdigit(*p
)) p
++;
207 ret
->height
= atoi(p
);
208 while (*p
&& isdigit(*p
)) p
++;
210 ret
->height
= ret
->width
;
216 ret
->wrapping
= TRUE
;
217 } else if (*p
== 'b') {
219 ret
->barrier_probability
= atof(p
);
220 while (*p
&& isdigit(*p
)) p
++;
221 } else if (*p
== 'a') {
228 static char *encode_params(game_params
*params
, int full
)
233 len
= sprintf(ret
, "%dx%d", params
->width
, params
->height
);
234 if (params
->wrapping
)
236 if (full
&& params
->barrier_probability
)
237 len
+= sprintf(ret
+len
, "b%g", params
->barrier_probability
);
240 assert(len
< lenof(ret
));
246 static config_item
*game_configure(game_params
*params
)
251 ret
= snewn(6, config_item
);
253 ret
[0].name
= "Width";
254 ret
[0].type
= C_STRING
;
255 sprintf(buf
, "%d", params
->width
);
256 ret
[0].sval
= dupstr(buf
);
259 ret
[1].name
= "Height";
260 ret
[1].type
= C_STRING
;
261 sprintf(buf
, "%d", params
->height
);
262 ret
[1].sval
= dupstr(buf
);
265 ret
[2].name
= "Walls wrap around";
266 ret
[2].type
= C_BOOLEAN
;
268 ret
[2].ival
= params
->wrapping
;
270 ret
[3].name
= "Barrier probability";
271 ret
[3].type
= C_STRING
;
272 sprintf(buf
, "%g", params
->barrier_probability
);
273 ret
[3].sval
= dupstr(buf
);
276 ret
[4].name
= "Ensure unique solution";
277 ret
[4].type
= C_BOOLEAN
;
279 ret
[4].ival
= params
->unique
;
289 static game_params
*custom_params(config_item
*cfg
)
291 game_params
*ret
= snew(game_params
);
293 ret
->width
= atoi(cfg
[0].sval
);
294 ret
->height
= atoi(cfg
[1].sval
);
295 ret
->wrapping
= cfg
[2].ival
;
296 ret
->barrier_probability
= (float)atof(cfg
[3].sval
);
297 ret
->unique
= cfg
[4].ival
;
302 static char *validate_params(game_params
*params
)
304 if (params
->width
<= 0 && params
->height
<= 0)
305 return "Width and height must both be greater than zero";
306 if (params
->width
<= 0)
307 return "Width must be greater than zero";
308 if (params
->height
<= 0)
309 return "Height must be greater than zero";
310 if (params
->width
<= 1 && params
->height
<= 1)
311 return "At least one of width and height must be greater than one";
312 if (params
->barrier_probability
< 0)
313 return "Barrier probability may not be negative";
314 if (params
->barrier_probability
> 1)
315 return "Barrier probability may not be greater than 1";
319 /* ----------------------------------------------------------------------
320 * Solver used to assure solution uniqueness during generation.
324 * Test cases I used while debugging all this were
326 * ./net --generate 1 13x11w#12300
327 * which expands under the non-unique grid generation rules to
328 * 13x11w:5eaade1bd222664436d5e2965c12656b1129dd825219e3274d558d5eb2dab5da18898e571d5a2987be79746bd95726c597447d6da96188c513add829da7681da954db113d3cd244
329 * and has two ambiguous areas.
331 * An even better one is
332 * 13x11w#507896411361192
334 * 13x11w:b7125b1aec598eb31bd58d82572bc11494e5dee4e8db2bdd29b88d41a16bdd996d2996ddec8c83741a1e8674e78328ba71737b8894a9271b1cd1399453d1952e43951d9b712822e
335 * and has an ambiguous area _and_ a situation where loop avoidance
336 * is a necessary deductive technique.
339 * 48x25w#820543338195187
341 * 48x25w:255989d14cdd185deaa753a93821a12edc1ab97943ac127e2685d7b8b3c48861b2192416139212b316eddd35de43714ebc7628d753db32e596284d9ec52c5a7dc1b4c811a655117d16dc28921b2b4161352cab1d89d18bc836b8b891d55ea4622a1251861b5bc9a8aa3e5bcd745c95229ca6c3b5e21d5832d397e917325793d7eb442dc351b2db2a52ba8e1651642275842d8871d5534aabc6d5b741aaa2d48ed2a7dbbb3151ddb49d5b9a7ed1ab98ee75d613d656dbba347bc514c84556b43a9bc65a3256ead792488b862a9d2a8a39b4255a4949ed7dbd79443292521265896b4399c95ede89d7c8c797a6a57791a849adea489359a158aa12e5dacce862b8333b7ebea7d344d1a3c53198864b73a9dedde7b663abb1b539e1e8853b1b7edb14a2a17ebaae4dbe63598a2e7e9a2dbdad415bc1d8cb88cbab5a8c82925732cd282e641ea3bd7d2c6e776de9117a26be86deb7c82c89524b122cb9397cd1acd2284e744ea62b9279bae85479ababe315c3ac29c431333395b24e6a1e3c43a2da42d4dce84aadd5b154aea555eaddcbd6e527d228c19388d9b424d94214555a7edbdeebe569d4a56dc51a86bd9963e377bb74752bd5eaa5761ba545e297b62a1bda46ab4aee423ad6c661311783cc18786d4289236563cb4a75ec67d481c14814994464cd1b87396dee63e5ab6e952cc584baa1d4c47cb557ec84dbb63d487c8728118673a166846dd3a4ebc23d6cb9c5827d96b4556e91899db32b517eda815ae271a8911bd745447121dc8d321557bc2a435ebec1bbac35b1a291669451174e6aa2218a4a9c5a6ca31ebc45d84e3a82c121e9ced7d55e9a
342 * which has a spot (far right) where slightly more complex loop
343 * avoidance is required.
346 static int dsf_canonify(int *dsf
, int val
)
350 while (dsf
[val
] != val
)
362 static void dsf_merge(int *dsf
, int v1
, int v2
)
364 v1
= dsf_canonify(dsf
, v1
);
365 v2
= dsf_canonify(dsf
, v2
);
370 unsigned char *marked
;
376 static struct todo
*todo_new(int maxsize
)
378 struct todo
*todo
= snew(struct todo
);
379 todo
->marked
= snewn(maxsize
, unsigned char);
380 memset(todo
->marked
, 0, maxsize
);
381 todo
->buflen
= maxsize
+ 1;
382 todo
->buffer
= snewn(todo
->buflen
, int);
383 todo
->head
= todo
->tail
= 0;
387 static void todo_free(struct todo
*todo
)
394 static void todo_add(struct todo
*todo
, int index
)
396 if (todo
->marked
[index
])
397 return; /* already on the list */
398 todo
->marked
[index
] = TRUE
;
399 todo
->buffer
[todo
->tail
++] = index
;
400 if (todo
->tail
== todo
->buflen
)
404 static int todo_get(struct todo
*todo
) {
407 if (todo
->head
== todo
->tail
)
408 return -1; /* list is empty */
409 ret
= todo
->buffer
[todo
->head
++];
410 if (todo
->head
== todo
->buflen
)
412 todo
->marked
[ret
] = FALSE
;
417 static int net_solver(int w
, int h
, unsigned char *tiles
, int wrapping
)
419 unsigned char *tilestate
;
420 unsigned char *edgestate
;
429 * Set up the solver's data structures.
433 * tilestate stores the possible orientations of each tile.
434 * There are up to four of these, so we'll index the array in
435 * fours. tilestate[(y * w + x) * 4] and its three successive
436 * members give the possible orientations, clearing to 255 from
437 * the end as things are ruled out.
439 * In this loop we also count up the area of the grid (which is
440 * not _necessarily_ equal to w*h, because there might be one
441 * or more blank squares present. This will never happen in a
442 * grid generated _by_ this program, but it's worth keeping the
443 * solver as general as possible.)
445 tilestate
= snewn(w
* h
* 4, unsigned char);
447 for (i
= 0; i
< w
*h
; i
++) {
448 tilestate
[i
* 4] = tiles
[i
] & 0xF;
449 for (j
= 1; j
< 4; j
++) {
450 if (tilestate
[i
* 4 + j
- 1] == 255 ||
451 A(tilestate
[i
* 4 + j
- 1]) == tilestate
[i
* 4])
452 tilestate
[i
* 4 + j
] = 255;
454 tilestate
[i
* 4 + j
] = A(tilestate
[i
* 4 + j
- 1]);
461 * edgestate stores the known state of each edge. It is 0 for
462 * unknown, 1 for open (connected) and 2 for closed (not
465 * In principle we need only worry about each edge once each,
466 * but in fact it's easier to track each edge twice so that we
467 * can reference it from either side conveniently. Also I'm
468 * going to allocate _five_ bytes per tile, rather than the
469 * obvious four, so that I can index edgestate[(y*w+x) * 5 + d]
470 * where d is 1,2,4,8 and they never overlap.
472 edgestate
= snewn((w
* h
- 1) * 5 + 9, unsigned char);
473 memset(edgestate
, 0, (w
* h
- 1) * 5 + 9);
476 * deadends tracks which edges have dead ends on them. It is
477 * indexed by tile and direction: deadends[(y*w+x) * 5 + d]
478 * tells you whether heading out of tile (x,y) in direction d
479 * can reach a limited amount of the grid. Values are area+1
480 * (no dead end known) or less than that (can reach _at most_
481 * this many other tiles by heading this way out of this tile).
483 deadends
= snewn((w
* h
- 1) * 5 + 9, int);
484 for (i
= 0; i
< (w
* h
- 1) * 5 + 9; i
++)
485 deadends
[i
] = area
+1;
488 * equivalence tracks which sets of tiles are known to be
489 * connected to one another, so we can avoid creating loops by
490 * linking together tiles which are already linked through
493 * This is a disjoint set forest structure: equivalence[i]
494 * contains the index of another member of the equivalence
495 * class containing i, or contains i itself for precisely one
496 * member in each such class. To find a representative member
497 * of the equivalence class containing i, you keep replacing i
498 * with equivalence[i] until it stops changing; then you go
499 * _back_ along the same path and point everything on it
500 * directly at the representative member so as to speed up
501 * future searches. Then you test equivalence between tiles by
502 * finding the representative of each tile and seeing if
503 * they're the same; and you create new equivalence (merge
504 * classes) by finding the representative of each tile and
505 * setting equivalence[one]=the_other.
507 equivalence
= snewn(w
* h
, int);
508 for (i
= 0; i
< w
*h
; i
++)
509 equivalence
[i
] = i
; /* initially all distinct */
512 * On a non-wrapping grid, we instantly know that all the edges
513 * round the edge are closed.
516 for (i
= 0; i
< w
; i
++) {
517 edgestate
[i
* 5 + 2] = edgestate
[((h
-1) * w
+ i
) * 5 + 8] = 2;
519 for (i
= 0; i
< h
; i
++) {
520 edgestate
[(i
* w
+ w
-1) * 5 + 1] = edgestate
[(i
* w
) * 5 + 4] = 2;
525 * Since most deductions made by this solver are local (the
526 * exception is loop avoidance, where joining two tiles
527 * together on one side of the grid can theoretically permit a
528 * fresh deduction on the other), we can address the scaling
529 * problem inherent in iterating repeatedly over the entire
530 * grid by instead working with a to-do list.
532 todo
= todo_new(w
* h
);
535 * Main deductive loop.
537 done_something
= TRUE
; /* prevent instant termination! */
542 * Take a tile index off the todo list and process it.
544 index
= todo_get(todo
);
547 * If we have run out of immediate things to do, we
548 * have no choice but to scan the whole grid for
549 * longer-range things we've missed. Hence, I now add
550 * every square on the grid back on to the to-do list.
551 * I also set `done_something' to FALSE at this point;
552 * if we later come back here and find it still FALSE,
553 * we will know we've scanned the entire grid without
554 * finding anything new to do, and we can terminate.
558 for (i
= 0; i
< w
*h
; i
++)
560 done_something
= FALSE
;
562 index
= todo_get(todo
);
568 int d
, ourclass
= dsf_canonify(equivalence
, y
*w
+x
);
571 deadendmax
[1] = deadendmax
[2] = deadendmax
[4] = deadendmax
[8] = 0;
573 for (i
= j
= 0; i
< 4 && tilestate
[(y
*w
+x
) * 4 + i
] != 255; i
++) {
575 int nnondeadends
, nondeadends
[4], deadendtotal
;
576 int nequiv
, equiv
[5];
577 int val
= tilestate
[(y
*w
+x
) * 4 + i
];
580 nnondeadends
= deadendtotal
= 0;
583 for (d
= 1; d
<= 8; d
+= d
) {
585 * Immediately rule out this orientation if it
586 * conflicts with any known edge.
588 if ((edgestate
[(y
*w
+x
) * 5 + d
] == 1 && !(val
& d
)) ||
589 (edgestate
[(y
*w
+x
) * 5 + d
] == 2 && (val
& d
)))
594 * Count up the dead-end statistics.
596 if (deadends
[(y
*w
+x
) * 5 + d
] <= area
) {
597 deadendtotal
+= deadends
[(y
*w
+x
) * 5 + d
];
599 nondeadends
[nnondeadends
++] = d
;
603 * Ensure we aren't linking to any tiles,
604 * through edges not already known to be
605 * open, which create a loop.
607 if (edgestate
[(y
*w
+x
) * 5 + d
] == 0) {
610 OFFSETWH(x2
, y2
, x
, y
, d
, w
, h
);
611 c
= dsf_canonify(equivalence
, y2
*w
+x2
);
612 for (k
= 0; k
< nequiv
; k
++)
623 if (nnondeadends
== 0) {
625 * If this orientation links together dead-ends
626 * with a total area of less than the entire
627 * grid, it is invalid.
629 * (We add 1 to deadendtotal because of the
630 * tile itself, of course; one tile linking
631 * dead ends of size 2 and 3 forms a subnetwork
632 * with a total area of 6, not 5.)
634 if (deadendtotal
+1 < area
)
636 } else if (nnondeadends
== 1) {
638 * If this orientation links together one or
639 * more dead-ends with precisely one
640 * non-dead-end, then we may have to mark that
641 * non-dead-end as a dead end going the other
642 * way. However, it depends on whether all
643 * other orientations share the same property.
646 if (deadendmax
[nondeadends
[0]] < deadendtotal
)
647 deadendmax
[nondeadends
[0]] = deadendtotal
;
650 * If this orientation links together two or
651 * more non-dead-ends, then we can rule out the
652 * possibility of putting in new dead-end
653 * markings in those directions.
656 for (k
= 0; k
< nnondeadends
; k
++)
657 deadendmax
[nondeadends
[k
]] = area
+1;
661 tilestate
[(y
*w
+x
) * 4 + j
++] = val
;
662 #ifdef SOLVER_DIAGNOSTICS
664 printf("ruling out orientation %x at %d,%d\n", val
, x
, y
);
668 assert(j
> 0); /* we can't lose _all_ possibilities! */
672 done_something
= TRUE
;
675 * We have ruled out at least one tile orientation.
676 * Make sure the rest are blanked.
679 tilestate
[(y
*w
+x
) * 4 + j
++] = 255;
682 * Now go through them again and see if we've
683 * deduced anything new about any edges.
686 for (i
= 0; i
< 4 && tilestate
[(y
*w
+x
) * 4 + i
] != 255; i
++) {
687 a
&= tilestate
[(y
*w
+x
) * 4 + i
];
688 o
|= tilestate
[(y
*w
+x
) * 4 + i
];
690 for (d
= 1; d
<= 8; d
+= d
)
691 if (edgestate
[(y
*w
+x
) * 5 + d
] == 0) {
693 OFFSETWH(x2
, y2
, x
, y
, d
, w
, h
);
696 /* This edge is open in all orientations. */
697 #ifdef SOLVER_DIAGNOSTICS
698 printf("marking edge %d,%d:%d open\n", x
, y
, d
);
700 edgestate
[(y
*w
+x
) * 5 + d
] = 1;
701 edgestate
[(y2
*w
+x2
) * 5 + d2
] = 1;
702 dsf_merge(equivalence
, y
*w
+x
, y2
*w
+x2
);
703 done_something
= TRUE
;
704 todo_add(todo
, y2
*w
+x2
);
705 } else if (!(o
& d
)) {
706 /* This edge is closed in all orientations. */
707 #ifdef SOLVER_DIAGNOSTICS
708 printf("marking edge %d,%d:%d closed\n", x
, y
, d
);
710 edgestate
[(y
*w
+x
) * 5 + d
] = 2;
711 edgestate
[(y2
*w
+x2
) * 5 + d2
] = 2;
712 done_something
= TRUE
;
713 todo_add(todo
, y2
*w
+x2
);
720 * Now check the dead-end markers and see if any of
721 * them has lowered from the real ones.
723 for (d
= 1; d
<= 8; d
+= d
) {
725 OFFSETWH(x2
, y2
, x
, y
, d
, w
, h
);
727 if (deadendmax
[d
] > 0 &&
728 deadends
[(y2
*w
+x2
) * 5 + d2
] > deadendmax
[d
]) {
729 #ifdef SOLVER_DIAGNOSTICS
730 printf("setting dead end value %d,%d:%d to %d\n",
731 x2
, y2
, d2
, deadendmax
[d
]);
733 deadends
[(y2
*w
+x2
) * 5 + d2
] = deadendmax
[d
];
734 done_something
= TRUE
;
735 todo_add(todo
, y2
*w
+x2
);
743 * Mark all completely determined tiles as locked.
746 for (i
= 0; i
< w
*h
; i
++) {
747 if (tilestate
[i
* 4 + 1] == 255) {
748 assert(tilestate
[i
* 4 + 0] != 255);
749 tiles
[i
] = tilestate
[i
* 4] | LOCKED
;
757 * Free up working space.
768 /* ----------------------------------------------------------------------
769 * Randomly select a new game description.
773 * Function to randomly perturb an ambiguous section in a grid, to
774 * attempt to ensure unique solvability.
776 static void perturb(int w
, int h
, unsigned char *tiles
, int wrapping
,
777 random_state
*rs
, int startx
, int starty
, int startd
)
779 struct xyd
*perimeter
, *perim2
, *loop
[2], looppos
[2];
780 int nperim
, perimsize
, nloop
[2], loopsize
[2];
784 * We know that the tile at (startx,starty) is part of an
785 * ambiguous section, and we also know that its neighbour in
786 * direction startd is fully specified. We begin by tracing all
787 * the way round the ambiguous area.
789 nperim
= perimsize
= 0;
794 #ifdef PERTURB_DIAGNOSTICS
795 printf("perturb %d,%d:%d\n", x
, y
, d
);
800 if (nperim
>= perimsize
) {
801 perimsize
= perimsize
* 3 / 2 + 32;
802 perimeter
= sresize(perimeter
, perimsize
, struct xyd
);
804 perimeter
[nperim
].x
= x
;
805 perimeter
[nperim
].y
= y
;
806 perimeter
[nperim
].direction
= d
;
808 #ifdef PERTURB_DIAGNOSTICS
809 printf("perimeter: %d,%d:%d\n", x
, y
, d
);
813 * First, see if we can simply turn left from where we are
814 * and find another locked square.
817 OFFSETWH(x2
, y2
, x
, y
, d2
, w
, h
);
818 if ((!wrapping
&& (abs(x2
-x
) > 1 || abs(y2
-y
) > 1)) ||
819 (tiles
[y2
*w
+x2
] & LOCKED
)) {
823 * Failing that, step left into the new square and look
828 OFFSETWH(x2
, y2
, x
, y
, d
, w
, h
);
829 if ((wrapping
|| (abs(x2
-x
) <= 1 && abs(y2
-y
) <= 1)) &&
830 !(tiles
[y2
*w
+x2
] & LOCKED
)) {
832 * And failing _that_, we're going to have to step
833 * forward into _that_ square and look right at the
834 * same locked square as we started with.
842 } while (x
!= startx
|| y
!= starty
|| d
!= startd
);
845 * Our technique for perturbing this ambiguous area is to
846 * search round its edge for a join we can make: that is, an
847 * edge on the perimeter which is (a) not currently connected,
848 * and (b) connecting it would not yield a full cross on either
849 * side. Then we make that join, search round the network to
850 * find the loop thus constructed, and sever the loop at a
851 * randomly selected other point.
853 perim2
= snewn(nperim
, struct xyd
);
854 memcpy(perim2
, perimeter
, nperim
* sizeof(struct xyd
));
855 /* Shuffle the perimeter, so as to search it without directional bias. */
856 for (i
= nperim
; --i
;) {
857 int j
= random_upto(rs
, i
+1);
861 perim2
[j
] = perim2
[i
];
864 for (i
= 0; i
< nperim
; i
++) {
869 d
= perim2
[i
].direction
;
871 OFFSETWH(x2
, y2
, x
, y
, d
, w
, h
);
872 if (!wrapping
&& (abs(x2
-x
) > 1 || abs(y2
-y
) > 1))
873 continue; /* can't link across non-wrapping border */
874 if (tiles
[y
*w
+x
] & d
)
875 continue; /* already linked in this direction! */
876 if (((tiles
[y
*w
+x
] | d
) & 15) == 15)
877 continue; /* can't turn this tile into a cross */
878 if (((tiles
[y2
*w
+x2
] | F(d
)) & 15) == 15)
879 continue; /* can't turn other tile into a cross */
882 * We've found the point at which we're going to make a new
885 #ifdef PERTURB_DIAGNOSTICS
886 printf("linking %d,%d:%d\n", x
, y
, d
);
889 tiles
[y2
*w
+x2
] |= F(d
);
895 return; /* nothing we can do! */
898 * Now we've constructed a new link, we need to find the entire
899 * loop of which it is a part.
901 * In principle, this involves doing a complete search round
902 * the network. However, I anticipate that in the vast majority
903 * of cases the loop will be quite small, so what I'm going to
904 * do is make _two_ searches round the network in parallel, one
905 * keeping its metaphorical hand on the left-hand wall while
906 * the other keeps its hand on the right. As soon as one of
907 * them gets back to its starting point, I abandon the other.
909 for (i
= 0; i
< 2; i
++) {
910 loopsize
[i
] = nloop
[i
] = 0;
914 looppos
[i
].direction
= d
;
917 for (i
= 0; i
< 2; i
++) {
922 d
= looppos
[i
].direction
;
924 OFFSETWH(x2
, y2
, x
, y
, d
, w
, h
);
927 * Add this path segment to the loop, unless it exactly
928 * reverses the previous one on the loop in which case
929 * we take it away again.
931 #ifdef PERTURB_DIAGNOSTICS
932 printf("looppos[%d] = %d,%d:%d\n", i
, x
, y
, d
);
935 loop
[i
][nloop
[i
]-1].x
== x2
&&
936 loop
[i
][nloop
[i
]-1].y
== y2
&&
937 loop
[i
][nloop
[i
]-1].direction
== F(d
)) {
938 #ifdef PERTURB_DIAGNOSTICS
939 printf("removing path segment %d,%d:%d from loop[%d]\n",
944 if (nloop
[i
] >= loopsize
[i
]) {
945 loopsize
[i
] = loopsize
[i
] * 3 / 2 + 32;
946 loop
[i
] = sresize(loop
[i
], loopsize
[i
], struct xyd
);
948 #ifdef PERTURB_DIAGNOSTICS
949 printf("adding path segment %d,%d:%d to loop[%d]\n",
952 loop
[i
][nloop
[i
]++] = looppos
[i
];
955 #ifdef PERTURB_DIAGNOSTICS
956 printf("tile at new location is %x\n", tiles
[y2
*w
+x2
] & 0xF);
959 for (j
= 0; j
< 4; j
++) {
964 #ifdef PERTURB_DIAGNOSTICS
965 printf("trying dir %d\n", d
);
967 if (tiles
[y2
*w
+x2
] & d
) {
970 looppos
[i
].direction
= d
;
976 assert(nloop
[i
] > 0);
978 if (looppos
[i
].x
== loop
[i
][0].x
&&
979 looppos
[i
].y
== loop
[i
][0].y
&&
980 looppos
[i
].direction
== loop
[i
][0].direction
) {
981 #ifdef PERTURB_DIAGNOSTICS
982 printf("loop %d finished tracking\n", i
);
986 * Having found our loop, we now sever it at a
987 * randomly chosen point - absolutely any will do -
988 * which is not the one we joined it at to begin
989 * with. Conveniently, the one we joined it at is
990 * loop[i][0], so we just avoid that one.
992 j
= random_upto(rs
, nloop
[i
]-1) + 1;
995 d
= loop
[i
][j
].direction
;
996 OFFSETWH(x2
, y2
, x
, y
, d
, w
, h
);
998 tiles
[y2
*w
+x2
] &= ~F(d
);
1010 * Finally, we must mark the entire disputed section as locked,
1011 * to prevent the perturb function being called on it multiple
1014 * To do this, we _sort_ the perimeter of the area. The
1015 * existing xyd_cmp function will arrange things into columns
1016 * for us, in such a way that each column has the edges in
1017 * vertical order. Then we can work down each column and fill
1018 * in all the squares between an up edge and a down edge.
1020 qsort(perimeter
, nperim
, sizeof(struct xyd
), xyd_cmp
);
1022 for (i
= 0; i
<= nperim
; i
++) {
1023 if (i
== nperim
|| perimeter
[i
].x
> x
) {
1025 * Fill in everything from the last Up edge to the
1026 * bottom of the grid, if necessary.
1030 #ifdef PERTURB_DIAGNOSTICS
1031 printf("resolved: locking tile %d,%d\n", x
, y
);
1033 tiles
[y
* w
+ x
] |= LOCKED
;
1046 if (perimeter
[i
].direction
== U
) {
1049 } else if (perimeter
[i
].direction
== D
) {
1051 * Fill in everything from the last Up edge to here.
1053 assert(x
== perimeter
[i
].x
&& y
<= perimeter
[i
].y
);
1054 while (y
<= perimeter
[i
].y
) {
1055 #ifdef PERTURB_DIAGNOSTICS
1056 printf("resolved: locking tile %d,%d\n", x
, y
);
1058 tiles
[y
* w
+ x
] |= LOCKED
;
1068 static char *new_game_desc(game_params
*params
, random_state
*rs
,
1069 game_aux_info
**aux
)
1071 tree234
*possibilities
, *barriertree
;
1072 int w
, h
, x
, y
, cx
, cy
, nbarriers
;
1073 unsigned char *tiles
, *barriers
;
1082 tiles
= snewn(w
* h
, unsigned char);
1083 barriers
= snewn(w
* h
, unsigned char);
1087 memset(tiles
, 0, w
* h
);
1088 memset(barriers
, 0, w
* h
);
1091 * Construct the unshuffled grid.
1093 * To do this, we simply start at the centre point, repeatedly
1094 * choose a random possibility out of the available ways to
1095 * extend a used square into an unused one, and do it. After
1096 * extending the third line out of a square, we remove the
1097 * fourth from the possibilities list to avoid any full-cross
1098 * squares (which would make the game too easy because they
1099 * only have one orientation).
1101 * The slightly worrying thing is the avoidance of full-cross
1102 * squares. Can this cause our unsophisticated construction
1103 * algorithm to paint itself into a corner, by getting into a
1104 * situation where there are some unreached squares and the
1105 * only way to reach any of them is to extend a T-piece into a
1108 * Answer: no it can't, and here's a proof.
1110 * Any contiguous group of such unreachable squares must be
1111 * surrounded on _all_ sides by T-pieces pointing away from the
1112 * group. (If not, then there is a square which can be extended
1113 * into one of the `unreachable' ones, and so it wasn't
1114 * unreachable after all.) In particular, this implies that
1115 * each contiguous group of unreachable squares must be
1116 * rectangular in shape (any deviation from that yields a
1117 * non-T-piece next to an `unreachable' square).
1119 * So we have a rectangle of unreachable squares, with T-pieces
1120 * forming a solid border around the rectangle. The corners of
1121 * that border must be connected (since every tile connects all
1122 * the lines arriving in it), and therefore the border must
1123 * form a closed loop around the rectangle.
1125 * But this can't have happened in the first place, since we
1126 * _know_ we've avoided creating closed loops! Hence, no such
1127 * situation can ever arise, and the naive grid construction
1128 * algorithm will guaranteeably result in a complete grid
1129 * containing no unreached squares, no full crosses _and_ no
1132 possibilities
= newtree234(xyd_cmp_nc
);
1135 add234(possibilities
, new_xyd(cx
, cy
, R
));
1137 add234(possibilities
, new_xyd(cx
, cy
, U
));
1139 add234(possibilities
, new_xyd(cx
, cy
, L
));
1141 add234(possibilities
, new_xyd(cx
, cy
, D
));
1143 while (count234(possibilities
) > 0) {
1146 int x1
, y1
, d1
, x2
, y2
, d2
, d
;
1149 * Extract a randomly chosen possibility from the list.
1151 i
= random_upto(rs
, count234(possibilities
));
1152 xyd
= delpos234(possibilities
, i
);
1155 d1
= xyd
->direction
;
1158 OFFSET(x2
, y2
, x1
, y1
, d1
, params
);
1161 printf("picked (%d,%d,%c) <-> (%d,%d,%c)\n",
1162 x1
, y1
, "0RU3L567D9abcdef"[d1
], x2
, y2
, "0RU3L567D9abcdef"[d2
]);
1166 * Make the connection. (We should be moving to an as yet
1169 index(params
, tiles
, x1
, y1
) |= d1
;
1170 assert(index(params
, tiles
, x2
, y2
) == 0);
1171 index(params
, tiles
, x2
, y2
) |= d2
;
1174 * If we have created a T-piece, remove its last
1177 if (COUNT(index(params
, tiles
, x1
, y1
)) == 3) {
1178 struct xyd xyd1
, *xydp
;
1182 xyd1
.direction
= 0x0F ^ index(params
, tiles
, x1
, y1
);
1184 xydp
= find234(possibilities
, &xyd1
, NULL
);
1188 printf("T-piece; removing (%d,%d,%c)\n",
1189 xydp
->x
, xydp
->y
, "0RU3L567D9abcdef"[xydp
->direction
]);
1191 del234(possibilities
, xydp
);
1197 * Remove all other possibilities that were pointing at the
1198 * tile we've just moved into.
1200 for (d
= 1; d
< 0x10; d
<<= 1) {
1202 struct xyd xyd1
, *xydp
;
1204 OFFSET(x3
, y3
, x2
, y2
, d
, params
);
1209 xyd1
.direction
= d3
;
1211 xydp
= find234(possibilities
, &xyd1
, NULL
);
1215 printf("Loop avoidance; removing (%d,%d,%c)\n",
1216 xydp
->x
, xydp
->y
, "0RU3L567D9abcdef"[xydp
->direction
]);
1218 del234(possibilities
, xydp
);
1224 * Add new possibilities to the list for moving _out_ of
1225 * the tile we have just moved into.
1227 for (d
= 1; d
< 0x10; d
<<= 1) {
1231 continue; /* we've got this one already */
1233 if (!params
->wrapping
) {
1234 if (d
== U
&& y2
== 0)
1236 if (d
== D
&& y2
== h
-1)
1238 if (d
== L
&& x2
== 0)
1240 if (d
== R
&& x2
== w
-1)
1244 OFFSET(x3
, y3
, x2
, y2
, d
, params
);
1246 if (index(params
, tiles
, x3
, y3
))
1247 continue; /* this would create a loop */
1250 printf("New frontier; adding (%d,%d,%c)\n",
1251 x2
, y2
, "0RU3L567D9abcdef"[d
]);
1253 add234(possibilities
, new_xyd(x2
, y2
, d
));
1256 /* Having done that, we should have no possibilities remaining. */
1257 assert(count234(possibilities
) == 0);
1258 freetree234(possibilities
);
1260 if (params
->unique
) {
1264 * Run the solver to check unique solubility.
1266 while (!net_solver(w
, h
, tiles
, params
->wrapping
)) {
1270 * We expect (in most cases) that most of the grid will
1271 * be uniquely specified already, and the remaining
1272 * ambiguous sections will be small and separate. So
1273 * our strategy is to find each individual such
1274 * section, and perform a perturbation on the network
1277 for (y
= 0; y
< h
; y
++) for (x
= 0; x
< w
; x
++) {
1278 if (x
+1 < w
&& ((tiles
[y
*w
+x
] ^ tiles
[y
*w
+x
+1]) & LOCKED
)) {
1280 if (tiles
[y
*w
+x
] & LOCKED
)
1281 perturb(w
, h
, tiles
, params
->wrapping
, rs
, x
+1, y
, L
);
1283 perturb(w
, h
, tiles
, params
->wrapping
, rs
, x
, y
, R
);
1285 if (y
+1 < h
&& ((tiles
[y
*w
+x
] ^ tiles
[(y
+1)*w
+x
]) & LOCKED
)) {
1287 if (tiles
[y
*w
+x
] & LOCKED
)
1288 perturb(w
, h
, tiles
, params
->wrapping
, rs
, x
, y
+1, U
);
1290 perturb(w
, h
, tiles
, params
->wrapping
, rs
, x
, y
, D
);
1295 * Now n counts the number of ambiguous sections we
1296 * have fiddled with. If we haven't managed to decrease
1297 * it from the last time we ran the solver, give up and
1298 * regenerate the entire grid.
1300 if (prevn
!= -1 && prevn
<= n
)
1301 goto begin_generation
; /* (sorry) */
1307 * The solver will have left a lot of LOCKED bits lying
1308 * around in the tiles array. Remove them.
1310 for (x
= 0; x
< w
*h
; x
++)
1311 tiles
[x
] &= ~LOCKED
;
1315 * Now compute a list of the possible barrier locations.
1317 barriertree
= newtree234(xyd_cmp_nc
);
1318 for (y
= 0; y
< h
; y
++) {
1319 for (x
= 0; x
< w
; x
++) {
1321 if (!(index(params
, tiles
, x
, y
) & R
) &&
1322 (params
->wrapping
|| x
< w
-1))
1323 add234(barriertree
, new_xyd(x
, y
, R
));
1324 if (!(index(params
, tiles
, x
, y
) & D
) &&
1325 (params
->wrapping
|| y
< h
-1))
1326 add234(barriertree
, new_xyd(x
, y
, D
));
1331 * Save the unshuffled grid in an aux_info.
1334 game_aux_info
*solution
;
1336 solution
= snew(game_aux_info
);
1337 solution
->width
= w
;
1338 solution
->height
= h
;
1339 solution
->tiles
= snewn(w
* h
, unsigned char);
1340 memcpy(solution
->tiles
, tiles
, w
* h
);
1346 * Now shuffle the grid.
1348 for (y
= 0; y
< h
; y
++) {
1349 for (x
= 0; x
< w
; x
++) {
1350 int orig
= index(params
, tiles
, x
, y
);
1351 int rot
= random_upto(rs
, 4);
1352 index(params
, tiles
, x
, y
) = ROT(orig
, rot
);
1357 * And now choose barrier locations. (We carefully do this
1358 * _after_ shuffling, so that changing the barrier rate in the
1359 * params while keeping the random seed the same will give the
1360 * same shuffled grid and _only_ change the barrier locations.
1361 * Also the way we choose barrier locations, by repeatedly
1362 * choosing one possibility from the list until we have enough,
1363 * is designed to ensure that raising the barrier rate while
1364 * keeping the seed the same will provide a superset of the
1365 * previous barrier set - i.e. if you ask for 10 barriers, and
1366 * then decide that's still too hard and ask for 20, you'll get
1367 * the original 10 plus 10 more, rather than getting 20 new
1368 * ones and the chance of remembering your first 10.)
1370 nbarriers
= (int)(params
->barrier_probability
* count234(barriertree
));
1371 assert(nbarriers
>= 0 && nbarriers
<= count234(barriertree
));
1373 while (nbarriers
> 0) {
1376 int x1
, y1
, d1
, x2
, y2
, d2
;
1379 * Extract a randomly chosen barrier from the list.
1381 i
= random_upto(rs
, count234(barriertree
));
1382 xyd
= delpos234(barriertree
, i
);
1384 assert(xyd
!= NULL
);
1388 d1
= xyd
->direction
;
1391 OFFSET(x2
, y2
, x1
, y1
, d1
, params
);
1394 index(params
, barriers
, x1
, y1
) |= d1
;
1395 index(params
, barriers
, x2
, y2
) |= d2
;
1401 * Clean up the rest of the barrier list.
1406 while ( (xyd
= delpos234(barriertree
, 0)) != NULL
)
1409 freetree234(barriertree
);
1413 * Finally, encode the grid into a string game description.
1415 * My syntax is extremely simple: each square is encoded as a
1416 * hex digit in which bit 0 means a connection on the right,
1417 * bit 1 means up, bit 2 left and bit 3 down. (i.e. the same
1418 * encoding as used internally). Each digit is followed by
1419 * optional barrier indicators: `v' means a vertical barrier to
1420 * the right of it, and `h' means a horizontal barrier below
1423 desc
= snewn(w
* h
* 3 + 1, char);
1425 for (y
= 0; y
< h
; y
++) {
1426 for (x
= 0; x
< w
; x
++) {
1427 *p
++ = "0123456789abcdef"[index(params
, tiles
, x
, y
)];
1428 if ((params
->wrapping
|| x
< w
-1) &&
1429 (index(params
, barriers
, x
, y
) & R
))
1431 if ((params
->wrapping
|| y
< h
-1) &&
1432 (index(params
, barriers
, x
, y
) & D
))
1436 assert(p
- desc
<= w
*h
*3);
1445 static void game_free_aux_info(game_aux_info
*aux
)
1451 static char *validate_desc(game_params
*params
, char *desc
)
1453 int w
= params
->width
, h
= params
->height
;
1456 for (i
= 0; i
< w
*h
; i
++) {
1457 if (*desc
>= '0' && *desc
<= '9')
1459 else if (*desc
>= 'a' && *desc
<= 'f')
1461 else if (*desc
>= 'A' && *desc
<= 'F')
1464 return "Game description shorter than expected";
1466 return "Game description contained unexpected character";
1468 while (*desc
== 'h' || *desc
== 'v')
1472 return "Game description longer than expected";
1477 /* ----------------------------------------------------------------------
1478 * Construct an initial game state, given a description and parameters.
1481 static game_state
*new_game(game_params
*params
, char *desc
)
1486 assert(params
->width
> 0 && params
->height
> 0);
1487 assert(params
->width
> 1 || params
->height
> 1);
1490 * Create a blank game state.
1492 state
= snew(game_state
);
1493 w
= state
->width
= params
->width
;
1494 h
= state
->height
= params
->height
;
1495 state
->cx
= state
->width
/ 2;
1496 state
->cy
= state
->height
/ 2;
1497 state
->wrapping
= params
->wrapping
;
1498 state
->last_rotate_dir
= state
->last_rotate_x
= state
->last_rotate_y
= 0;
1499 state
->completed
= state
->used_solve
= state
->just_used_solve
= FALSE
;
1500 state
->tiles
= snewn(state
->width
* state
->height
, unsigned char);
1501 memset(state
->tiles
, 0, state
->width
* state
->height
);
1502 state
->barriers
= snewn(state
->width
* state
->height
, unsigned char);
1503 memset(state
->barriers
, 0, state
->width
* state
->height
);
1506 * Parse the game description into the grid.
1508 for (y
= 0; y
< h
; y
++) {
1509 for (x
= 0; x
< w
; x
++) {
1510 if (*desc
>= '0' && *desc
<= '9')
1511 tile(state
, x
, y
) = *desc
- '0';
1512 else if (*desc
>= 'a' && *desc
<= 'f')
1513 tile(state
, x
, y
) = *desc
- 'a' + 10;
1514 else if (*desc
>= 'A' && *desc
<= 'F')
1515 tile(state
, x
, y
) = *desc
- 'A' + 10;
1518 while (*desc
== 'h' || *desc
== 'v') {
1525 OFFSET(x2
, y2
, x
, y
, d1
, state
);
1528 barrier(state
, x
, y
) |= d1
;
1529 barrier(state
, x2
, y2
) |= d2
;
1537 * Set up border barriers if this is a non-wrapping game.
1539 if (!state
->wrapping
) {
1540 for (x
= 0; x
< state
->width
; x
++) {
1541 barrier(state
, x
, 0) |= U
;
1542 barrier(state
, x
, state
->height
-1) |= D
;
1544 for (y
= 0; y
< state
->height
; y
++) {
1545 barrier(state
, 0, y
) |= L
;
1546 barrier(state
, state
->width
-1, y
) |= R
;
1551 * Set up the barrier corner flags, for drawing barriers
1552 * prettily when they meet.
1554 for (y
= 0; y
< state
->height
; y
++) {
1555 for (x
= 0; x
< state
->width
; x
++) {
1558 for (dir
= 1; dir
< 0x10; dir
<<= 1) {
1560 int x1
, y1
, x2
, y2
, x3
, y3
;
1563 if (!(barrier(state
, x
, y
) & dir
))
1566 if (barrier(state
, x
, y
) & dir2
)
1569 x1
= x
+ X(dir
), y1
= y
+ Y(dir
);
1570 if (x1
>= 0 && x1
< state
->width
&&
1571 y1
>= 0 && y1
< state
->height
&&
1572 (barrier(state
, x1
, y1
) & dir2
))
1575 x2
= x
+ X(dir2
), y2
= y
+ Y(dir2
);
1576 if (x2
>= 0 && x2
< state
->width
&&
1577 y2
>= 0 && y2
< state
->height
&&
1578 (barrier(state
, x2
, y2
) & dir
))
1582 barrier(state
, x
, y
) |= (dir
<< 4);
1583 if (x1
>= 0 && x1
< state
->width
&&
1584 y1
>= 0 && y1
< state
->height
)
1585 barrier(state
, x1
, y1
) |= (A(dir
) << 4);
1586 if (x2
>= 0 && x2
< state
->width
&&
1587 y2
>= 0 && y2
< state
->height
)
1588 barrier(state
, x2
, y2
) |= (C(dir
) << 4);
1589 x3
= x
+ X(dir
) + X(dir2
), y3
= y
+ Y(dir
) + Y(dir2
);
1590 if (x3
>= 0 && x3
< state
->width
&&
1591 y3
>= 0 && y3
< state
->height
)
1592 barrier(state
, x3
, y3
) |= (F(dir
) << 4);
1601 static game_state
*dup_game(game_state
*state
)
1605 ret
= snew(game_state
);
1606 ret
->width
= state
->width
;
1607 ret
->height
= state
->height
;
1608 ret
->cx
= state
->cx
;
1609 ret
->cy
= state
->cy
;
1610 ret
->wrapping
= state
->wrapping
;
1611 ret
->completed
= state
->completed
;
1612 ret
->used_solve
= state
->used_solve
;
1613 ret
->just_used_solve
= state
->just_used_solve
;
1614 ret
->last_rotate_dir
= state
->last_rotate_dir
;
1615 ret
->last_rotate_x
= state
->last_rotate_x
;
1616 ret
->last_rotate_y
= state
->last_rotate_y
;
1617 ret
->tiles
= snewn(state
->width
* state
->height
, unsigned char);
1618 memcpy(ret
->tiles
, state
->tiles
, state
->width
* state
->height
);
1619 ret
->barriers
= snewn(state
->width
* state
->height
, unsigned char);
1620 memcpy(ret
->barriers
, state
->barriers
, state
->width
* state
->height
);
1625 static void free_game(game_state
*state
)
1627 sfree(state
->tiles
);
1628 sfree(state
->barriers
);
1632 static game_state
*solve_game(game_state
*state
, game_aux_info
*aux
,
1639 * Run the internal solver on the provided grid. This might
1640 * not yield a complete solution.
1642 ret
= dup_game(state
);
1643 net_solver(ret
->width
, ret
->height
, ret
->tiles
, ret
->wrapping
);
1645 assert(aux
->width
== state
->width
);
1646 assert(aux
->height
== state
->height
);
1647 ret
= dup_game(state
);
1648 memcpy(ret
->tiles
, aux
->tiles
, ret
->width
* ret
->height
);
1649 ret
->used_solve
= ret
->just_used_solve
= TRUE
;
1650 ret
->completed
= TRUE
;
1656 static char *game_text_format(game_state
*state
)
1661 /* ----------------------------------------------------------------------
1666 * Compute which squares are reachable from the centre square, as a
1667 * quick visual aid to determining how close the game is to
1668 * completion. This is also a simple way to tell if the game _is_
1669 * completed - just call this function and see whether every square
1672 static unsigned char *compute_active(game_state
*state
)
1674 unsigned char *active
;
1678 active
= snewn(state
->width
* state
->height
, unsigned char);
1679 memset(active
, 0, state
->width
* state
->height
);
1682 * We only store (x,y) pairs in todo, but it's easier to reuse
1683 * xyd_cmp and just store direction 0 every time.
1685 todo
= newtree234(xyd_cmp_nc
);
1686 index(state
, active
, state
->cx
, state
->cy
) = ACTIVE
;
1687 add234(todo
, new_xyd(state
->cx
, state
->cy
, 0));
1689 while ( (xyd
= delpos234(todo
, 0)) != NULL
) {
1690 int x1
, y1
, d1
, x2
, y2
, d2
;
1696 for (d1
= 1; d1
< 0x10; d1
<<= 1) {
1697 OFFSET(x2
, y2
, x1
, y1
, d1
, state
);
1701 * If the next tile in this direction is connected to
1702 * us, and there isn't a barrier in the way, and it
1703 * isn't already marked active, then mark it active and
1704 * add it to the to-examine list.
1706 if ((tile(state
, x1
, y1
) & d1
) &&
1707 (tile(state
, x2
, y2
) & d2
) &&
1708 !(barrier(state
, x1
, y1
) & d1
) &&
1709 !index(state
, active
, x2
, y2
)) {
1710 index(state
, active
, x2
, y2
) = ACTIVE
;
1711 add234(todo
, new_xyd(x2
, y2
, 0));
1715 /* Now we expect the todo list to have shrunk to zero size. */
1716 assert(count234(todo
) == 0);
1725 random_state
*rs
; /* used for jumbling */
1728 static game_ui
*new_ui(game_state
*state
)
1732 game_ui
*ui
= snew(game_ui
);
1733 ui
->cur_x
= state
->width
/ 2;
1734 ui
->cur_y
= state
->height
/ 2;
1735 ui
->cur_visible
= FALSE
;
1736 get_random_seed(&seed
, &seedsize
);
1737 ui
->rs
= random_init(seed
, seedsize
);
1743 static void free_ui(game_ui
*ui
)
1745 random_free(ui
->rs
);
1749 /* ----------------------------------------------------------------------
1752 static game_state
*make_move(game_state
*state
, game_ui
*ui
,
1753 int x
, int y
, int button
)
1755 game_state
*ret
, *nullret
;
1760 if (button
== LEFT_BUTTON
||
1761 button
== MIDDLE_BUTTON
||
1762 button
== RIGHT_BUTTON
) {
1764 if (ui
->cur_visible
) {
1765 ui
->cur_visible
= FALSE
;
1770 * The button must have been clicked on a valid tile.
1772 x
-= WINDOW_OFFSET
+ TILE_BORDER
;
1773 y
-= WINDOW_OFFSET
+ TILE_BORDER
;
1778 if (tx
>= state
->width
|| ty
>= state
->height
)
1780 if (x
% TILE_SIZE
>= TILE_SIZE
- TILE_BORDER
||
1781 y
% TILE_SIZE
>= TILE_SIZE
- TILE_BORDER
)
1783 } else if (button
== CURSOR_UP
|| button
== CURSOR_DOWN
||
1784 button
== CURSOR_RIGHT
|| button
== CURSOR_LEFT
) {
1785 if (button
== CURSOR_UP
&& ui
->cur_y
> 0)
1787 else if (button
== CURSOR_DOWN
&& ui
->cur_y
< state
->height
-1)
1789 else if (button
== CURSOR_LEFT
&& ui
->cur_x
> 0)
1791 else if (button
== CURSOR_RIGHT
&& ui
->cur_x
< state
->width
-1)
1794 return nullret
; /* no cursor movement */
1795 ui
->cur_visible
= TRUE
;
1796 return state
; /* UI activity has occurred */
1797 } else if (button
== 'a' || button
== 's' || button
== 'd' ||
1798 button
== 'A' || button
== 'S' || button
== 'D') {
1801 if (button
== 'a' || button
== 'A')
1802 button
= LEFT_BUTTON
;
1803 else if (button
== 's' || button
== 'S')
1804 button
= MIDDLE_BUTTON
;
1805 else if (button
== 'd' || button
== 'D')
1806 button
= RIGHT_BUTTON
;
1807 ui
->cur_visible
= TRUE
;
1808 } else if (button
== 'j' || button
== 'J') {
1809 /* XXX should we have some mouse control for this? */
1810 button
= 'J'; /* canonify */
1811 tx
= ty
= -1; /* shut gcc up :( */
1816 * The middle button locks or unlocks a tile. (A locked tile
1817 * cannot be turned, and is visually marked as being locked.
1818 * This is a convenience for the player, so that once they are
1819 * sure which way round a tile goes, they can lock it and thus
1820 * avoid forgetting later on that they'd already done that one;
1821 * and the locking also prevents them turning the tile by
1822 * accident. If they change their mind, another middle click
1825 if (button
== MIDDLE_BUTTON
) {
1827 ret
= dup_game(state
);
1828 ret
->just_used_solve
= FALSE
;
1829 tile(ret
, tx
, ty
) ^= LOCKED
;
1830 ret
->last_rotate_dir
= ret
->last_rotate_x
= ret
->last_rotate_y
= 0;
1833 } else if (button
== LEFT_BUTTON
|| button
== RIGHT_BUTTON
) {
1836 * The left and right buttons have no effect if clicked on a
1839 if (tile(state
, tx
, ty
) & LOCKED
)
1843 * Otherwise, turn the tile one way or the other. Left button
1844 * turns anticlockwise; right button turns clockwise.
1846 ret
= dup_game(state
);
1847 ret
->just_used_solve
= FALSE
;
1848 orig
= tile(ret
, tx
, ty
);
1849 if (button
== LEFT_BUTTON
) {
1850 tile(ret
, tx
, ty
) = A(orig
);
1851 ret
->last_rotate_dir
= +1;
1853 tile(ret
, tx
, ty
) = C(orig
);
1854 ret
->last_rotate_dir
= -1;
1856 ret
->last_rotate_x
= tx
;
1857 ret
->last_rotate_y
= ty
;
1859 } else if (button
== 'J') {
1862 * Jumble all unlocked tiles to random orientations.
1865 ret
= dup_game(state
);
1866 ret
->just_used_solve
= FALSE
;
1867 for (jy
= 0; jy
< ret
->height
; jy
++) {
1868 for (jx
= 0; jx
< ret
->width
; jx
++) {
1869 if (!(tile(ret
, jx
, jy
) & LOCKED
)) {
1870 int rot
= random_upto(ui
->rs
, 4);
1871 orig
= tile(ret
, jx
, jy
);
1872 tile(ret
, jx
, jy
) = ROT(orig
, rot
);
1876 ret
->last_rotate_dir
= 0; /* suppress animation */
1877 ret
->last_rotate_x
= ret
->last_rotate_y
= 0;
1882 * Check whether the game has been completed.
1885 unsigned char *active
= compute_active(ret
);
1887 int complete
= TRUE
;
1889 for (x1
= 0; x1
< ret
->width
; x1
++)
1890 for (y1
= 0; y1
< ret
->height
; y1
++)
1891 if ((tile(ret
, x1
, y1
) & 0xF) && !index(ret
, active
, x1
, y1
)) {
1893 goto break_label
; /* break out of two loops at once */
1900 ret
->completed
= TRUE
;
1906 /* ----------------------------------------------------------------------
1907 * Routines for drawing the game position on the screen.
1910 struct game_drawstate
{
1913 unsigned char *visible
;
1916 static game_drawstate
*game_new_drawstate(game_state
*state
)
1918 game_drawstate
*ds
= snew(game_drawstate
);
1920 ds
->started
= FALSE
;
1921 ds
->width
= state
->width
;
1922 ds
->height
= state
->height
;
1923 ds
->visible
= snewn(state
->width
* state
->height
, unsigned char);
1924 memset(ds
->visible
, 0xFF, state
->width
* state
->height
);
1929 static void game_free_drawstate(game_drawstate
*ds
)
1935 static void game_size(game_params
*params
, int *x
, int *y
)
1937 *x
= WINDOW_OFFSET
* 2 + TILE_SIZE
* params
->width
+ TILE_BORDER
;
1938 *y
= WINDOW_OFFSET
* 2 + TILE_SIZE
* params
->height
+ TILE_BORDER
;
1941 static float *game_colours(frontend
*fe
, game_state
*state
, int *ncolours
)
1945 ret
= snewn(NCOLOURS
* 3, float);
1946 *ncolours
= NCOLOURS
;
1949 * Basic background colour is whatever the front end thinks is
1950 * a sensible default.
1952 frontend_default_colour(fe
, &ret
[COL_BACKGROUND
* 3]);
1957 ret
[COL_WIRE
* 3 + 0] = 0.0F
;
1958 ret
[COL_WIRE
* 3 + 1] = 0.0F
;
1959 ret
[COL_WIRE
* 3 + 2] = 0.0F
;
1962 * Powered wires and powered endpoints are cyan.
1964 ret
[COL_POWERED
* 3 + 0] = 0.0F
;
1965 ret
[COL_POWERED
* 3 + 1] = 1.0F
;
1966 ret
[COL_POWERED
* 3 + 2] = 1.0F
;
1971 ret
[COL_BARRIER
* 3 + 0] = 1.0F
;
1972 ret
[COL_BARRIER
* 3 + 1] = 0.0F
;
1973 ret
[COL_BARRIER
* 3 + 2] = 0.0F
;
1976 * Unpowered endpoints are blue.
1978 ret
[COL_ENDPOINT
* 3 + 0] = 0.0F
;
1979 ret
[COL_ENDPOINT
* 3 + 1] = 0.0F
;
1980 ret
[COL_ENDPOINT
* 3 + 2] = 1.0F
;
1983 * Tile borders are a darker grey than the background.
1985 ret
[COL_BORDER
* 3 + 0] = 0.5F
* ret
[COL_BACKGROUND
* 3 + 0];
1986 ret
[COL_BORDER
* 3 + 1] = 0.5F
* ret
[COL_BACKGROUND
* 3 + 1];
1987 ret
[COL_BORDER
* 3 + 2] = 0.5F
* ret
[COL_BACKGROUND
* 3 + 2];
1990 * Locked tiles are a grey in between those two.
1992 ret
[COL_LOCKED
* 3 + 0] = 0.75F
* ret
[COL_BACKGROUND
* 3 + 0];
1993 ret
[COL_LOCKED
* 3 + 1] = 0.75F
* ret
[COL_BACKGROUND
* 3 + 1];
1994 ret
[COL_LOCKED
* 3 + 2] = 0.75F
* ret
[COL_BACKGROUND
* 3 + 2];
1999 static void draw_thick_line(frontend
*fe
, int x1
, int y1
, int x2
, int y2
,
2002 draw_line(fe
, x1
-1, y1
, x2
-1, y2
, COL_WIRE
);
2003 draw_line(fe
, x1
+1, y1
, x2
+1, y2
, COL_WIRE
);
2004 draw_line(fe
, x1
, y1
-1, x2
, y2
-1, COL_WIRE
);
2005 draw_line(fe
, x1
, y1
+1, x2
, y2
+1, COL_WIRE
);
2006 draw_line(fe
, x1
, y1
, x2
, y2
, colour
);
2009 static void draw_rect_coords(frontend
*fe
, int x1
, int y1
, int x2
, int y2
,
2012 int mx
= (x1
< x2 ? x1
: x2
);
2013 int my
= (y1
< y2 ? y1
: y2
);
2014 int dx
= (x2
+ x1
- 2*mx
+ 1);
2015 int dy
= (y2
+ y1
- 2*my
+ 1);
2017 draw_rect(fe
, mx
, my
, dx
, dy
, colour
);
2020 static void draw_barrier_corner(frontend
*fe
, int x
, int y
, int dir
, int phase
)
2022 int bx
= WINDOW_OFFSET
+ TILE_SIZE
* x
;
2023 int by
= WINDOW_OFFSET
+ TILE_SIZE
* y
;
2024 int x1
, y1
, dx
, dy
, dir2
;
2029 dx
= X(dir
) + X(dir2
);
2030 dy
= Y(dir
) + Y(dir2
);
2031 x1
= (dx
> 0 ? TILE_SIZE
+TILE_BORDER
-1 : 0);
2032 y1
= (dy
> 0 ? TILE_SIZE
+TILE_BORDER
-1 : 0);
2035 draw_rect_coords(fe
, bx
+x1
, by
+y1
,
2036 bx
+x1
-TILE_BORDER
*dx
, by
+y1
-(TILE_BORDER
-1)*dy
,
2038 draw_rect_coords(fe
, bx
+x1
, by
+y1
,
2039 bx
+x1
-(TILE_BORDER
-1)*dx
, by
+y1
-TILE_BORDER
*dy
,
2042 draw_rect_coords(fe
, bx
+x1
, by
+y1
,
2043 bx
+x1
-(TILE_BORDER
-1)*dx
, by
+y1
-(TILE_BORDER
-1)*dy
,
2048 static void draw_barrier(frontend
*fe
, int x
, int y
, int dir
, int phase
)
2050 int bx
= WINDOW_OFFSET
+ TILE_SIZE
* x
;
2051 int by
= WINDOW_OFFSET
+ TILE_SIZE
* y
;
2054 x1
= (X(dir
) > 0 ? TILE_SIZE
: X(dir
) == 0 ? TILE_BORDER
: 0);
2055 y1
= (Y(dir
) > 0 ? TILE_SIZE
: Y(dir
) == 0 ? TILE_BORDER
: 0);
2056 w
= (X(dir
) ? TILE_BORDER
: TILE_SIZE
- TILE_BORDER
);
2057 h
= (Y(dir
) ? TILE_BORDER
: TILE_SIZE
- TILE_BORDER
);
2060 draw_rect(fe
, bx
+x1
-X(dir
), by
+y1
-Y(dir
), w
, h
, COL_WIRE
);
2062 draw_rect(fe
, bx
+x1
, by
+y1
, w
, h
, COL_BARRIER
);
2066 static void draw_tile(frontend
*fe
, game_state
*state
, int x
, int y
, int tile
,
2067 float angle
, int cursor
)
2069 int bx
= WINDOW_OFFSET
+ TILE_SIZE
* x
;
2070 int by
= WINDOW_OFFSET
+ TILE_SIZE
* y
;
2072 float cx
, cy
, ex
, ey
, tx
, ty
;
2073 int dir
, col
, phase
;
2076 * When we draw a single tile, we must draw everything up to
2077 * and including the borders around the tile. This means that
2078 * if the neighbouring tiles have connections to those borders,
2079 * we must draw those connections on the borders themselves.
2081 * This would be terribly fiddly if we ever had to draw a tile
2082 * while its neighbour was in mid-rotate, because we'd have to
2083 * arrange to _know_ that the neighbour was being rotated and
2084 * hence had an anomalous effect on the redraw of this tile.
2085 * Fortunately, the drawing algorithm avoids ever calling us in
2086 * this circumstance: we're either drawing lots of straight
2087 * tiles at game start or after a move is complete, or we're
2088 * repeatedly drawing only the rotating tile. So no problem.
2092 * So. First blank the tile out completely: draw a big
2093 * rectangle in border colour, and a smaller rectangle in
2094 * background colour to fill it in.
2096 draw_rect(fe
, bx
, by
, TILE_SIZE
+TILE_BORDER
, TILE_SIZE
+TILE_BORDER
,
2098 draw_rect(fe
, bx
+TILE_BORDER
, by
+TILE_BORDER
,
2099 TILE_SIZE
-TILE_BORDER
, TILE_SIZE
-TILE_BORDER
,
2100 tile
& LOCKED ? COL_LOCKED
: COL_BACKGROUND
);
2103 * Draw an inset outline rectangle as a cursor, in whichever of
2104 * COL_LOCKED and COL_BACKGROUND we aren't currently drawing
2108 draw_line(fe
, bx
+TILE_SIZE
/8, by
+TILE_SIZE
/8,
2109 bx
+TILE_SIZE
/8, by
+TILE_SIZE
-TILE_SIZE
/8,
2110 tile
& LOCKED ? COL_BACKGROUND
: COL_LOCKED
);
2111 draw_line(fe
, bx
+TILE_SIZE
/8, by
+TILE_SIZE
/8,
2112 bx
+TILE_SIZE
-TILE_SIZE
/8, by
+TILE_SIZE
/8,
2113 tile
& LOCKED ? COL_BACKGROUND
: COL_LOCKED
);
2114 draw_line(fe
, bx
+TILE_SIZE
-TILE_SIZE
/8, by
+TILE_SIZE
/8,
2115 bx
+TILE_SIZE
-TILE_SIZE
/8, by
+TILE_SIZE
-TILE_SIZE
/8,
2116 tile
& LOCKED ? COL_BACKGROUND
: COL_LOCKED
);
2117 draw_line(fe
, bx
+TILE_SIZE
/8, by
+TILE_SIZE
-TILE_SIZE
/8,
2118 bx
+TILE_SIZE
-TILE_SIZE
/8, by
+TILE_SIZE
-TILE_SIZE
/8,
2119 tile
& LOCKED ? COL_BACKGROUND
: COL_LOCKED
);
2123 * Set up the rotation matrix.
2125 matrix
[0] = (float)cos(angle
* PI
/ 180.0);
2126 matrix
[1] = (float)-sin(angle
* PI
/ 180.0);
2127 matrix
[2] = (float)sin(angle
* PI
/ 180.0);
2128 matrix
[3] = (float)cos(angle
* PI
/ 180.0);
2133 cx
= cy
= TILE_BORDER
+ (TILE_SIZE
-TILE_BORDER
) / 2.0F
- 0.5F
;
2134 col
= (tile
& ACTIVE ? COL_POWERED
: COL_WIRE
);
2135 for (dir
= 1; dir
< 0x10; dir
<<= 1) {
2137 ex
= (TILE_SIZE
- TILE_BORDER
- 1.0F
) / 2.0F
* X(dir
);
2138 ey
= (TILE_SIZE
- TILE_BORDER
- 1.0F
) / 2.0F
* Y(dir
);
2139 MATMUL(tx
, ty
, matrix
, ex
, ey
);
2140 draw_thick_line(fe
, bx
+(int)cx
, by
+(int)cy
,
2141 bx
+(int)(cx
+tx
), by
+(int)(cy
+ty
),
2145 for (dir
= 1; dir
< 0x10; dir
<<= 1) {
2147 ex
= (TILE_SIZE
- TILE_BORDER
- 1.0F
) / 2.0F
* X(dir
);
2148 ey
= (TILE_SIZE
- TILE_BORDER
- 1.0F
) / 2.0F
* Y(dir
);
2149 MATMUL(tx
, ty
, matrix
, ex
, ey
);
2150 draw_line(fe
, bx
+(int)cx
, by
+(int)cy
,
2151 bx
+(int)(cx
+tx
), by
+(int)(cy
+ty
), col
);
2156 * Draw the box in the middle. We do this in blue if the tile
2157 * is an unpowered endpoint, in cyan if the tile is a powered
2158 * endpoint, in black if the tile is the centrepiece, and
2159 * otherwise not at all.
2162 if (x
== state
->cx
&& y
== state
->cy
)
2164 else if (COUNT(tile
) == 1) {
2165 col
= (tile
& ACTIVE ? COL_POWERED
: COL_ENDPOINT
);
2170 points
[0] = +1; points
[1] = +1;
2171 points
[2] = +1; points
[3] = -1;
2172 points
[4] = -1; points
[5] = -1;
2173 points
[6] = -1; points
[7] = +1;
2175 for (i
= 0; i
< 8; i
+= 2) {
2176 ex
= (TILE_SIZE
* 0.24F
) * points
[i
];
2177 ey
= (TILE_SIZE
* 0.24F
) * points
[i
+1];
2178 MATMUL(tx
, ty
, matrix
, ex
, ey
);
2179 points
[i
] = bx
+(int)(cx
+tx
);
2180 points
[i
+1] = by
+(int)(cy
+ty
);
2183 draw_polygon(fe
, points
, 4, TRUE
, col
);
2184 draw_polygon(fe
, points
, 4, FALSE
, COL_WIRE
);
2188 * Draw the points on the border if other tiles are connected
2191 for (dir
= 1; dir
< 0x10; dir
<<= 1) {
2192 int dx
, dy
, px
, py
, lx
, ly
, vx
, vy
, ox
, oy
;
2200 if (ox
< 0 || ox
>= state
->width
|| oy
< 0 || oy
>= state
->height
)
2203 if (!(tile(state
, ox
, oy
) & F(dir
)))
2206 px
= bx
+ (int)(dx
>0 ? TILE_SIZE
+ TILE_BORDER
- 1 : dx
<0 ?
0 : cx
);
2207 py
= by
+ (int)(dy
>0 ? TILE_SIZE
+ TILE_BORDER
- 1 : dy
<0 ?
0 : cy
);
2208 lx
= dx
* (TILE_BORDER
-1);
2209 ly
= dy
* (TILE_BORDER
-1);
2213 if (angle
== 0.0 && (tile
& dir
)) {
2215 * If we are fully connected to the other tile, we must
2216 * draw right across the tile border. (We can use our
2217 * own ACTIVE state to determine what colour to do this
2218 * in: if we are fully connected to the other tile then
2219 * the two ACTIVE states will be the same.)
2221 draw_rect_coords(fe
, px
-vx
, py
-vy
, px
+lx
+vx
, py
+ly
+vy
, COL_WIRE
);
2222 draw_rect_coords(fe
, px
, py
, px
+lx
, py
+ly
,
2223 (tile
& ACTIVE
) ? COL_POWERED
: COL_WIRE
);
2226 * The other tile extends into our border, but isn't
2227 * actually connected to us. Just draw a single black
2230 draw_rect_coords(fe
, px
, py
, px
, py
, COL_WIRE
);
2235 * Draw barrier corners, and then barriers.
2237 for (phase
= 0; phase
< 2; phase
++) {
2238 for (dir
= 1; dir
< 0x10; dir
<<= 1)
2239 if (barrier(state
, x
, y
) & (dir
<< 4))
2240 draw_barrier_corner(fe
, x
, y
, dir
<< 4, phase
);
2241 for (dir
= 1; dir
< 0x10; dir
<<= 1)
2242 if (barrier(state
, x
, y
) & dir
)
2243 draw_barrier(fe
, x
, y
, dir
, phase
);
2246 draw_update(fe
, bx
, by
, TILE_SIZE
+TILE_BORDER
, TILE_SIZE
+TILE_BORDER
);
2249 static void game_redraw(frontend
*fe
, game_drawstate
*ds
, game_state
*oldstate
,
2250 game_state
*state
, int dir
, game_ui
*ui
, float t
, float ft
)
2252 int x
, y
, tx
, ty
, frame
, last_rotate_dir
;
2253 unsigned char *active
;
2257 * Clear the screen and draw the exterior barrier lines if this
2258 * is our first call.
2266 WINDOW_OFFSET
* 2 + TILE_SIZE
* state
->width
+ TILE_BORDER
,
2267 WINDOW_OFFSET
* 2 + TILE_SIZE
* state
->height
+ TILE_BORDER
,
2269 draw_update(fe
, 0, 0,
2270 WINDOW_OFFSET
*2 + TILE_SIZE
*state
->width
+ TILE_BORDER
,
2271 WINDOW_OFFSET
*2 + TILE_SIZE
*state
->height
+ TILE_BORDER
);
2273 for (phase
= 0; phase
< 2; phase
++) {
2275 for (x
= 0; x
< ds
->width
; x
++) {
2276 if (barrier(state
, x
, 0) & UL
)
2277 draw_barrier_corner(fe
, x
, -1, LD
, phase
);
2278 if (barrier(state
, x
, 0) & RU
)
2279 draw_barrier_corner(fe
, x
, -1, DR
, phase
);
2280 if (barrier(state
, x
, 0) & U
)
2281 draw_barrier(fe
, x
, -1, D
, phase
);
2282 if (barrier(state
, x
, ds
->height
-1) & DR
)
2283 draw_barrier_corner(fe
, x
, ds
->height
, RU
, phase
);
2284 if (barrier(state
, x
, ds
->height
-1) & LD
)
2285 draw_barrier_corner(fe
, x
, ds
->height
, UL
, phase
);
2286 if (barrier(state
, x
, ds
->height
-1) & D
)
2287 draw_barrier(fe
, x
, ds
->height
, U
, phase
);
2290 for (y
= 0; y
< ds
->height
; y
++) {
2291 if (barrier(state
, 0, y
) & UL
)
2292 draw_barrier_corner(fe
, -1, y
, RU
, phase
);
2293 if (barrier(state
, 0, y
) & LD
)
2294 draw_barrier_corner(fe
, -1, y
, DR
, phase
);
2295 if (barrier(state
, 0, y
) & L
)
2296 draw_barrier(fe
, -1, y
, R
, phase
);
2297 if (barrier(state
, ds
->width
-1, y
) & RU
)
2298 draw_barrier_corner(fe
, ds
->width
, y
, UL
, phase
);
2299 if (barrier(state
, ds
->width
-1, y
) & DR
)
2300 draw_barrier_corner(fe
, ds
->width
, y
, LD
, phase
);
2301 if (barrier(state
, ds
->width
-1, y
) & R
)
2302 draw_barrier(fe
, ds
->width
, y
, L
, phase
);
2308 last_rotate_dir
= dir
==-1 ? oldstate
->last_rotate_dir
:
2309 state
->last_rotate_dir
;
2310 if (oldstate
&& (t
< ROTATE_TIME
) && last_rotate_dir
) {
2312 * We're animating a single tile rotation. Find the turning
2315 tx
= (dir
==-1 ? oldstate
->last_rotate_x
: state
->last_rotate_x
);
2316 ty
= (dir
==-1 ? oldstate
->last_rotate_y
: state
->last_rotate_y
);
2317 angle
= last_rotate_dir
* dir
* 90.0F
* (t
/ ROTATE_TIME
);
2324 * We're animating a completion flash. Find which frame
2327 frame
= (int)(ft
/ FLASH_FRAME
);
2331 * Draw any tile which differs from the way it was last drawn.
2333 active
= compute_active(state
);
2335 for (x
= 0; x
< ds
->width
; x
++)
2336 for (y
= 0; y
< ds
->height
; y
++) {
2337 unsigned char c
= tile(state
, x
, y
) | index(state
, active
, x
, y
);
2340 * In a completion flash, we adjust the LOCKED bit
2341 * depending on our distance from the centre point and
2345 int xdist
, ydist
, dist
;
2346 xdist
= (x
< state
->cx ? state
->cx
- x
: x
- state
->cx
);
2347 ydist
= (y
< state
->cy ? state
->cy
- y
: y
- state
->cy
);
2348 dist
= (xdist
> ydist ? xdist
: ydist
);
2350 if (frame
>= dist
&& frame
< dist
+4) {
2351 int lock
= (frame
- dist
) & 1;
2352 lock
= lock ? LOCKED
: 0;
2353 c
= (c
&~ LOCKED
) | lock
;
2357 if (index(state
, ds
->visible
, x
, y
) != c
||
2358 index(state
, ds
->visible
, x
, y
) == 0xFF ||
2359 (x
== tx
&& y
== ty
) ||
2360 (ui
->cur_visible
&& x
== ui
->cur_x
&& y
== ui
->cur_y
)) {
2361 draw_tile(fe
, state
, x
, y
, c
,
2362 (x
== tx
&& y
== ty ? angle
: 0.0F
),
2363 (ui
->cur_visible
&& x
== ui
->cur_x
&& y
== ui
->cur_y
));
2364 if ((x
== tx
&& y
== ty
) ||
2365 (ui
->cur_visible
&& x
== ui
->cur_x
&& y
== ui
->cur_y
))
2366 index(state
, ds
->visible
, x
, y
) = 0xFF;
2368 index(state
, ds
->visible
, x
, y
) = c
;
2373 * Update the status bar.
2376 char statusbuf
[256];
2379 n
= state
->width
* state
->height
;
2380 for (i
= a
= n2
= 0; i
< n
; i
++) {
2383 if (state
->tiles
[i
] & 0xF)
2387 sprintf(statusbuf
, "%sActive: %d/%d",
2388 (state
->used_solve ?
"Auto-solved. " :
2389 state
->completed ?
"COMPLETED! " : ""), a
, n2
);
2391 status_bar(fe
, statusbuf
);
2397 static float game_anim_length(game_state
*oldstate
,
2398 game_state
*newstate
, int dir
)
2400 int last_rotate_dir
;
2403 * Don't animate an auto-solve move.
2405 if ((dir
> 0 && newstate
->just_used_solve
) ||
2406 (dir
< 0 && oldstate
->just_used_solve
))
2410 * Don't animate if last_rotate_dir is zero.
2412 last_rotate_dir
= dir
==-1 ? oldstate
->last_rotate_dir
:
2413 newstate
->last_rotate_dir
;
2414 if (last_rotate_dir
)
2420 static float game_flash_length(game_state
*oldstate
,
2421 game_state
*newstate
, int dir
)
2424 * If the game has just been completed, we display a completion
2427 if (!oldstate
->completed
&& newstate
->completed
&&
2428 !oldstate
->used_solve
&& !newstate
->used_solve
) {
2431 if (size
< newstate
->cx
+1)
2432 size
= newstate
->cx
+1;
2433 if (size
< newstate
->cy
+1)
2434 size
= newstate
->cy
+1;
2435 if (size
< newstate
->width
- newstate
->cx
)
2436 size
= newstate
->width
- newstate
->cx
;
2437 if (size
< newstate
->height
- newstate
->cy
)
2438 size
= newstate
->height
- newstate
->cy
;
2439 return FLASH_FRAME
* (size
+4);
2445 static int game_wants_statusbar(void)
2454 const struct game thegame
= {
2462 TRUE
, game_configure
, custom_params
,
2471 FALSE
, game_text_format
,
2478 game_free_drawstate
,
2482 game_wants_statusbar
,