2 * twiddle.c: Puzzle involving rearranging a grid of squares by
3 * rotating subsquares. Adapted and generalised from a
4 * door-unlocking puzzle in Metroid Prime 2 (the one in the Main
17 #define PREFERRED_TILE_SIZE 48
18 #define TILE_SIZE (ds->tilesize)
19 #define BORDER (TILE_SIZE / 2)
20 #define HIGHLIGHT_WIDTH (TILE_SIZE / 20)
21 #define COORD(x) ( (x) * TILE_SIZE + BORDER )
22 #define FROMCOORD(x) ( ((x) - BORDER + TILE_SIZE) / TILE_SIZE - 1 )
24 #define ANIM_PER_BLKSIZE_UNIT 0.13F
25 #define FLASH_FRAME 0.13F
34 COL_HIGHCURSOR, COL_LOWCURSOR,
50 int used_solve; /* used to suppress completion flash */
51 int movecount, movetarget;
52 int lastx, lasty, lastr; /* coordinates of last rotation */
55 static game_params *default_params(void)
57 game_params *ret = snew(game_params);
61 ret->rowsonly = ret->orientable = FALSE;
68 static void free_params(game_params *params)
73 static game_params *dup_params(const game_params *params)
75 game_params *ret = snew(game_params);
76 *ret = *params; /* structure copy */
80 static int game_fetch_preset(int i, char **name, game_params **params)
86 { "3x3 rows only", { 3, 3, 2, TRUE, FALSE } },
87 { "3x3 normal", { 3, 3, 2, FALSE, FALSE } },
88 { "3x3 orientable", { 3, 3, 2, FALSE, TRUE } },
89 { "4x4 normal", { 4, 4, 2, FALSE } },
90 { "4x4 orientable", { 4, 4, 2, FALSE, TRUE } },
91 { "4x4, rotating 3x3 blocks", { 4, 4, 3, FALSE } },
92 { "5x5, rotating 3x3 blocks", { 5, 5, 3, FALSE } },
93 { "6x6, rotating 4x4 blocks", { 6, 6, 4, FALSE } },
96 if (i < 0 || i >= lenof(presets))
99 *name = dupstr(presets[i].title);
100 *params = dup_params(&presets[i].params);
105 static void decode_params(game_params *ret, char const *string)
107 ret->w = ret->h = atoi(string);
109 ret->rowsonly = ret->orientable = FALSE;
111 while (*string && isdigit((unsigned char)*string)) string++;
112 if (*string == 'x') {
114 ret->h = atoi(string);
115 while (*string && isdigit((unsigned char)*string)) string++;
117 if (*string == 'n') {
119 ret->n = atoi(string);
120 while (*string && isdigit((unsigned char)*string)) string++;
123 if (*string == 'r') {
124 ret->rowsonly = TRUE;
125 } else if (*string == 'o') {
126 ret->orientable = TRUE;
127 } else if (*string == 'm') {
129 ret->movetarget = atoi(string);
130 while (string[1] && isdigit((unsigned char)string[1])) string++;
136 static char *encode_params(const game_params *params, int full)
139 sprintf(buf, "%dx%dn%d%s%s", params->w, params->h, params->n,
140 params->rowsonly ? "r" : "",
141 params->orientable ? "o" : "");
142 /* Shuffle limit is part of the limited parameters, because we have to
143 * supply the target move count. */
144 if (params->movetarget)
145 sprintf(buf + strlen(buf), "m%d", params->movetarget);
149 static config_item *game_configure(const game_params *params)
154 ret = snewn(7, config_item);
156 ret[0].name = "Width";
157 ret[0].type = C_STRING;
158 sprintf(buf, "%d", params->w);
159 ret[0].sval = dupstr(buf);
162 ret[1].name = "Height";
163 ret[1].type = C_STRING;
164 sprintf(buf, "%d", params->h);
165 ret[1].sval = dupstr(buf);
168 ret[2].name = "Rotating block size";
169 ret[2].type = C_STRING;
170 sprintf(buf, "%d", params->n);
171 ret[2].sval = dupstr(buf);
174 ret[3].name = "One number per row";
175 ret[3].type = C_BOOLEAN;
177 ret[3].ival = params->rowsonly;
179 ret[4].name = "Orientation matters";
180 ret[4].type = C_BOOLEAN;
182 ret[4].ival = params->orientable;
184 ret[5].name = "Number of shuffling moves";
185 ret[5].type = C_STRING;
186 sprintf(buf, "%d", params->movetarget);
187 ret[5].sval = dupstr(buf);
198 static game_params *custom_params(const config_item *cfg)
200 game_params *ret = snew(game_params);
202 ret->w = atoi(cfg[0].sval);
203 ret->h = atoi(cfg[1].sval);
204 ret->n = atoi(cfg[2].sval);
205 ret->rowsonly = cfg[3].ival;
206 ret->orientable = cfg[4].ival;
207 ret->movetarget = atoi(cfg[5].sval);
212 static char *validate_params(const game_params *params, int full)
215 return "Rotating block size must be at least two";
216 if (params->w < params->n)
217 return "Width must be at least the rotating block size";
218 if (params->h < params->n)
219 return "Height must be at least the rotating block size";
224 * This function actually performs a rotation on a grid. The `x'
225 * and `y' coordinates passed in are the coordinates of the _top
226 * left corner_ of the rotated region. (Using the centre would have
227 * involved half-integers and been annoyingly fiddly. Clicking in
228 * the centre is good for a user interface, but too inconvenient to
231 static void do_rotate(int *grid, int w, int h, int n, int orientable,
232 int x, int y, int dir)
236 assert(x >= 0 && x+n <= w);
237 assert(y >= 0 && y+n <= h);
240 return; /* nothing to do */
242 grid += y*w+x; /* translate region to top corner */
245 * If we were leaving the result of the rotation in a separate
246 * grid, the simple thing to do would be to loop over each
247 * square within the rotated region and assign it from its
248 * source square. However, to do it in place without taking
249 * O(n^2) memory, we need to be marginally more clever. What
250 * I'm going to do is loop over about one _quarter_ of the
251 * rotated region and permute each element within that quarter
252 * with its rotational coset.
254 * The size of the region I need to loop over is (n+1)/2 by
255 * n/2, which is an obvious exact quarter for even n and is a
256 * rectangle for odd n. (For odd n, this technique leaves out
257 * one element of the square, which is of course the central
258 * one that never moves anyway.)
260 for (i = 0; i < (n+1)/2; i++) {
261 for (j = 0; j < n/2; j++) {
268 p[2] = (n-j-1)*w+(n-i-1);
271 for (k = 0; k < 4; k++)
274 for (k = 0; k < 4; k++) {
275 int v = g[(k+dir) & 3];
277 v ^= ((v+dir) ^ v) & 3; /* alter orientation */
284 * Don't forget the orientation on the centre square, if n is
287 if (orientable && (n & 1)) {
288 int v = grid[n/2*(w+1)];
289 v ^= ((v+dir) ^ v) & 3; /* alter orientation */
294 static int grid_complete(int *grid, int wh, int orientable)
298 for (i = 1; i < wh; i++)
299 if (grid[i] < grid[i-1])
302 for (i = 0; i < wh; i++)
309 static char *new_game_desc(const game_params *params, random_state *rs,
310 char **aux, int interactive)
313 int w = params->w, h = params->h, n = params->n, wh = w*h;
320 * Set up a solved grid.
322 grid = snewn(wh, int);
323 for (i = 0; i < wh; i++)
324 grid[i] = ((params->rowsonly ? i/w : i) + 1) * 4;
327 * Shuffle it. This game is complex enough that I don't feel up
328 * to analysing its full symmetry properties (particularly at
329 * n=4 and above!), so I'm going to do it the pedestrian way
330 * and simply shuffle the grid by making a long sequence of
331 * randomly chosen moves.
333 total_moves = params->movetarget;
335 /* Add a random move to avoid parity issues. */
336 total_moves = w*h*n*n*2 + random_upto(rs, 2);
340 int rw, rh; /* w/h of rotation centre space */
344 prevmoves = snewn(rw * rh, int);
345 for (i = 0; i < rw * rh; i++)
348 for (i = 0; i < total_moves; i++) {
349 int x, y, r, oldtotal, newtotal, dx, dy;
352 x = random_upto(rs, w - n + 1);
353 y = random_upto(rs, h - n + 1);
354 r = 2 * random_upto(rs, 2) - 1;
357 * See if any previous rotations has happened at
358 * this point which nothing has overlapped since.
359 * If so, ensure we haven't either undone a
360 * previous move or repeated one so many times that
361 * it turns into fewer moves in the inverse
362 * direction (i.e. three identical rotations).
364 oldtotal = prevmoves[y*rw+x];
365 newtotal = oldtotal + r;
368 * Special case here for w==h==n, in which case
369 * there is actually no way to _avoid_ all moves
370 * repeating or undoing previous ones.
372 } while ((w != n || h != n) &&
373 (abs(newtotal) < abs(oldtotal) || abs(newtotal) > 2));
375 do_rotate(grid, w, h, n, params->orientable, x, y, r);
378 * Log the rotation we've just performed at this point,
379 * for inversion detection in the next move.
381 * Also zero a section of the prevmoves array, because
382 * any rotation area which _overlaps_ this one is now
383 * entirely safe to perform further moves in.
385 * Two rotation areas overlap if their top left
386 * coordinates differ by strictly less than n in both
389 prevmoves[y*rw+x] += r;
390 for (dy = -n+1; dy <= n-1; dy++) {
391 if (y + dy < 0 || y + dy >= rh)
393 for (dx = -n+1; dx <= n-1; dx++) {
394 if (x + dx < 0 || x + dx >= rw)
396 if (dx == 0 && dy == 0)
398 prevmoves[(y+dy)*rw+(x+dx)] = 0;
405 } while (grid_complete(grid, wh, params->orientable));
408 * Now construct the game description, by describing the grid
409 * as a simple sequence of integers. They're comma-separated,
410 * unless the puzzle is orientable in which case they're
411 * separated by orientation letters `u', `d', `l' and `r'.
415 for (i = 0; i < wh; i++) {
419 k = sprintf(buf, "%d%c", grid[i] / 4,
420 (char)(params->orientable ? "uldr"[grid[i] & 3] : ','));
422 ret = sresize(ret, retlen + k + 1, char);
423 strcpy(ret + retlen, buf);
426 if (!params->orientable)
427 ret[retlen-1] = '\0'; /* delete last comma */
433 static char *validate_desc(const game_params *params, const char *desc)
436 int w = params->w, h = params->h, wh = w*h;
441 for (i = 0; i < wh; i++) {
442 if (*p < '0' || *p > '9')
443 return "Not enough numbers in string";
444 while (*p >= '0' && *p <= '9')
446 if (!params->orientable && i < wh-1) {
448 return "Expected comma after number";
449 } else if (params->orientable && i < wh) {
450 if (*p != 'l' && *p != 'r' && *p != 'u' && *p != 'd')
451 return "Expected orientation letter after number";
452 } else if (i == wh-1 && *p) {
453 return "Excess junk at end of string";
456 if (*p) p++; /* eat comma */
462 static game_state *new_game(midend *me, const game_params *params,
465 game_state *state = snew(game_state);
466 int w = params->w, h = params->h, n = params->n, wh = w*h;
473 state->orientable = params->orientable;
474 state->completed = 0;
475 state->used_solve = FALSE;
476 state->movecount = 0;
477 state->movetarget = params->movetarget;
478 state->lastx = state->lasty = state->lastr = -1;
480 state->grid = snewn(wh, int);
484 for (i = 0; i < wh; i++) {
485 state->grid[i] = 4 * atoi(p);
486 while (*p >= '0' && *p <= '9')
489 if (params->orientable) {
491 case 'l': state->grid[i] |= 1; break;
492 case 'd': state->grid[i] |= 2; break;
493 case 'r': state->grid[i] |= 3; break;
503 static game_state *dup_game(const game_state *state)
505 game_state *ret = snew(game_state);
510 ret->orientable = state->orientable;
511 ret->completed = state->completed;
512 ret->movecount = state->movecount;
513 ret->movetarget = state->movetarget;
514 ret->lastx = state->lastx;
515 ret->lasty = state->lasty;
516 ret->lastr = state->lastr;
517 ret->used_solve = state->used_solve;
519 ret->grid = snewn(ret->w * ret->h, int);
520 memcpy(ret->grid, state->grid, ret->w * ret->h * sizeof(int));
525 static void free_game(game_state *state)
531 static int compare_int(const void *av, const void *bv)
533 const int *a = (const int *)av;
534 const int *b = (const int *)bv;
543 static char *solve_game(const game_state *state, const game_state *currstate,
544 const char *aux, char **error)
549 static int game_can_format_as_text_now(const game_params *params)
554 static char *game_text_format(const game_state *state)
556 char *ret, *p, buf[80];
557 int i, x, y, col, o, maxlen;
560 * First work out how many characters we need to display each
561 * number. We're pretty flexible on grid contents here, so we
562 * have to scan the entire grid.
565 for (i = 0; i < state->w * state->h; i++) {
566 x = sprintf(buf, "%d", state->grid[i] / 4);
567 if (col < x) col = x;
569 o = (state->orientable ? 1 : 0);
572 * Now we know the exact total size of the grid we're going to
573 * produce: it's got h rows, each containing w lots of col+o,
574 * w-1 spaces and a trailing newline.
576 maxlen = state->h * state->w * (col+o+1);
578 ret = snewn(maxlen+1, char);
581 for (y = 0; y < state->h; y++) {
582 for (x = 0; x < state->w; x++) {
583 int v = state->grid[state->w*y+x];
584 sprintf(buf, "%*d", col, v/4);
588 *p++ = "^<v>"[v & 3];
596 assert(p - ret == maxlen);
606 static game_ui *new_ui(const game_state *state)
608 game_ui *ui = snew(game_ui);
612 ui->cur_visible = FALSE;
617 static void free_ui(game_ui *ui)
622 static char *encode_ui(const game_ui *ui)
627 static void decode_ui(game_ui *ui, const char *encoding)
631 static void game_changed_state(game_ui *ui, const game_state *oldstate,
632 const game_state *newstate)
636 struct game_drawstate {
644 static char *interpret_move(const game_state *state, game_ui *ui,
645 const game_drawstate *ds,
646 int x, int y, int button)
648 int w = state->w, h = state->h, n = state->n /* , wh = w*h */;
652 button = button & (~MOD_MASK | MOD_NUM_KEYPAD);
654 if (IS_CURSOR_MOVE(button)) {
655 if (button == CURSOR_LEFT && ui->cur_x > 0)
657 if (button == CURSOR_RIGHT && (ui->cur_x+n) < (w))
659 if (button == CURSOR_UP && ui->cur_y > 0)
661 if (button == CURSOR_DOWN && (ui->cur_y+n) < (h))
667 if (button == LEFT_BUTTON || button == RIGHT_BUTTON) {
669 * Determine the coordinates of the click. We offset by n-1
670 * half-blocks so that the user must click at the centre of
671 * a rotation region rather than at the corner.
673 x -= (n-1) * TILE_SIZE / 2;
674 y -= (n-1) * TILE_SIZE / 2;
677 dir = (button == LEFT_BUTTON ? 1 : -1);
678 if (x < 0 || x > w-n || y < 0 || y > h-n)
681 } else if (IS_CURSOR_SELECT(button)) {
682 if (ui->cur_visible) {
685 dir = (button == CURSOR_SELECT2) ? -1 : +1;
690 } else if (button == 'a' || button == 'A' || button==MOD_NUM_KEYPAD+'7') {
692 dir = (button == 'A' ? -1 : +1);
693 } else if (button == 'b' || button == 'B' || button==MOD_NUM_KEYPAD+'9') {
696 dir = (button == 'B' ? -1 : +1);
697 } else if (button == 'c' || button == 'C' || button==MOD_NUM_KEYPAD+'1') {
700 dir = (button == 'C' ? -1 : +1);
701 } else if (button == 'd' || button == 'D' || button==MOD_NUM_KEYPAD+'3') {
704 dir = (button == 'D' ? -1 : +1);
705 } else if (button==MOD_NUM_KEYPAD+'8' && (w-n) % 2 == 0) {
709 } else if (button==MOD_NUM_KEYPAD+'2' && (w-n) % 2 == 0) {
713 } else if (button==MOD_NUM_KEYPAD+'4' && (h-n) % 2 == 0) {
717 } else if (button==MOD_NUM_KEYPAD+'6' && (h-n) % 2 == 0) {
721 } else if (button==MOD_NUM_KEYPAD+'5' && (w-n) % 2 == 0 && (h-n) % 2 == 0){
726 return NULL; /* no move to be made */
730 * If we reach here, we have a valid move.
732 sprintf(buf, "M%d,%d,%d", x, y, dir);
736 static game_state *execute_move(const game_state *from, const char *move)
739 int w = from->w, h = from->h, n = from->n, wh = w*h;
742 if (!strcmp(move, "S")) {
744 ret = dup_game(from);
747 * Simply replace the grid with a solved one. For this game,
748 * this isn't a useful operation for actually telling the user
749 * what they should have done, but it is useful for
750 * conveniently being able to get hold of a clean state from
751 * which to practise manoeuvres.
753 qsort(ret->grid, ret->w*ret->h, sizeof(int), compare_int);
754 for (i = 0; i < ret->w*ret->h; i++)
756 ret->used_solve = TRUE;
757 ret->completed = ret->movecount = 1;
762 if (move[0] != 'M' ||
763 sscanf(move+1, "%d,%d,%d", &x, &y, &dir) != 3 ||
764 x < 0 || y < 0 || x > from->w - n || y > from->h - n)
765 return NULL; /* can't parse this move string */
767 ret = dup_game(from);
769 do_rotate(ret->grid, w, h, n, ret->orientable, x, y, dir);
775 * See if the game has been completed. To do this we simply
776 * test that the grid contents are in increasing order.
778 if (!ret->completed && grid_complete(ret->grid, wh, ret->orientable))
779 ret->completed = ret->movecount;
783 /* ----------------------------------------------------------------------
787 static void game_compute_size(const game_params *params, int tilesize,
790 /* Ick: fake up `ds->tilesize' for macro expansion purposes */
791 struct { int tilesize; } ads, *ds = &ads;
792 ads.tilesize = tilesize;
794 *x = TILE_SIZE * params->w + 2 * BORDER;
795 *y = TILE_SIZE * params->h + 2 * BORDER;
798 static void game_set_size(drawing *dr, game_drawstate *ds,
799 const game_params *params, int tilesize)
801 ds->tilesize = tilesize;
804 static float *game_colours(frontend *fe, int *ncolours)
806 float *ret = snewn(3 * NCOLOURS, float);
809 game_mkhighlight(fe, ret, COL_BACKGROUND, COL_HIGHLIGHT, COL_LOWLIGHT);
811 /* cursor is light-background with a red tinge. */
812 ret[COL_HIGHCURSOR * 3 + 0] = ret[COL_BACKGROUND * 3 + 0] * 1.0F;
813 ret[COL_HIGHCURSOR * 3 + 1] = ret[COL_BACKGROUND * 3 + 1] * 0.5F;
814 ret[COL_HIGHCURSOR * 3 + 2] = ret[COL_BACKGROUND * 3 + 2] * 0.5F;
816 for (i = 0; i < 3; i++) {
817 ret[COL_HIGHLIGHT_GENTLE * 3 + i] = ret[COL_BACKGROUND * 3 + i] * 1.1F;
818 ret[COL_LOWLIGHT_GENTLE * 3 + i] = ret[COL_BACKGROUND * 3 + i] * 0.9F;
819 ret[COL_TEXT * 3 + i] = 0.0;
820 ret[COL_LOWCURSOR * 3 + i] = ret[COL_HIGHCURSOR * 3 + i] * 0.6F;
823 *ncolours = NCOLOURS;
827 static game_drawstate *game_new_drawstate(drawing *dr, const game_state *state)
829 struct game_drawstate *ds = snew(struct game_drawstate);
835 ds->bgcolour = COL_BACKGROUND;
836 ds->grid = snewn(ds->w*ds->h, int);
837 ds->tilesize = 0; /* haven't decided yet */
838 for (i = 0; i < ds->w*ds->h; i++)
840 ds->cur_x = ds->cur_y = -state->n;
845 static void game_free_drawstate(drawing *dr, game_drawstate *ds)
852 int cx, cy, cw, ch; /* clip region */
853 int ox, oy; /* rotation origin */
854 float c, s; /* cos and sin of rotation angle */
855 int lc, rc, tc, bc; /* colours of tile edges */
858 static void rotate(int *xy, struct rotation *rot)
861 float xf = (float)xy[0] - rot->ox, yf = (float)xy[1] - rot->oy;
864 xf2 = rot->c * xf + rot->s * yf;
865 yf2 = - rot->s * xf + rot->c * yf;
867 xy[0] = (int)(xf2 + rot->ox + 0.5); /* round to nearest */
868 xy[1] = (int)(yf2 + rot->oy + 0.5); /* round to nearest */
877 static void draw_tile(drawing *dr, game_drawstate *ds, const game_state *state,
878 int x, int y, int tile, int flash_colour,
879 struct rotation *rot, unsigned cedges)
885 * If we've been passed a rotation region but we're drawing a
886 * tile which is outside it, we must draw it normally. This can
887 * occur if we're cleaning up after a completion flash while a
888 * new move is also being made.
890 if (rot && (x < rot->cx || y < rot->cy ||
891 x >= rot->cx+rot->cw || y >= rot->cy+rot->ch))
895 clip(dr, rot->cx, rot->cy, rot->cw, rot->ch);
898 * We must draw each side of the tile's highlight separately,
899 * because in some cases (during rotation) they will all need
900 * to be different colours.
903 /* The centre point is common to all sides. */
904 coords[4] = x + TILE_SIZE / 2;
905 coords[5] = y + TILE_SIZE / 2;
906 rotate(coords+4, rot);
909 coords[0] = x + TILE_SIZE - 1;
910 coords[1] = y + TILE_SIZE - 1;
911 rotate(coords+0, rot);
912 coords[2] = x + TILE_SIZE - 1;
914 rotate(coords+2, rot);
915 draw_polygon(dr, coords, 3, rot ? rot->rc : COL_LOWLIGHT,
916 rot ? rot->rc : (cedges & CUR_RIGHT) ? COL_LOWCURSOR : COL_LOWLIGHT);
920 coords[3] = y + TILE_SIZE - 1;
921 rotate(coords+2, rot);
922 draw_polygon(dr, coords, 3, rot ? rot->bc : COL_LOWLIGHT,
923 rot ? rot->bc : (cedges & CUR_BOTTOM) ? COL_LOWCURSOR : COL_LOWLIGHT);
928 rotate(coords+0, rot);
929 draw_polygon(dr, coords, 3, rot ? rot->lc : COL_HIGHLIGHT,
930 rot ? rot->lc : (cedges & CUR_LEFT) ? COL_HIGHCURSOR : COL_HIGHLIGHT);
933 coords[2] = x + TILE_SIZE - 1;
935 rotate(coords+2, rot);
936 draw_polygon(dr, coords, 3, rot ? rot->tc : COL_HIGHLIGHT,
937 rot ? rot->tc : (cedges & CUR_TOP) ? COL_HIGHCURSOR : COL_HIGHLIGHT);
940 * Now the main blank area in the centre of the tile.
943 coords[0] = x + HIGHLIGHT_WIDTH;
944 coords[1] = y + HIGHLIGHT_WIDTH;
945 rotate(coords+0, rot);
946 coords[2] = x + HIGHLIGHT_WIDTH;
947 coords[3] = y + TILE_SIZE - 1 - HIGHLIGHT_WIDTH;
948 rotate(coords+2, rot);
949 coords[4] = x + TILE_SIZE - 1 - HIGHLIGHT_WIDTH;
950 coords[5] = y + TILE_SIZE - 1 - HIGHLIGHT_WIDTH;
951 rotate(coords+4, rot);
952 coords[6] = x + TILE_SIZE - 1 - HIGHLIGHT_WIDTH;
953 coords[7] = y + HIGHLIGHT_WIDTH;
954 rotate(coords+6, rot);
955 draw_polygon(dr, coords, 4, flash_colour, flash_colour);
957 draw_rect(dr, x + HIGHLIGHT_WIDTH, y + HIGHLIGHT_WIDTH,
958 TILE_SIZE - 2*HIGHLIGHT_WIDTH, TILE_SIZE - 2*HIGHLIGHT_WIDTH,
963 * Next, the triangles for orientation.
965 if (state->orientable) {
966 int xdx, xdy, ydx, ydy;
967 int cx, cy, displ, displ2;
981 default /* case 3 */:
987 cx = x + TILE_SIZE / 2;
988 cy = y + TILE_SIZE / 2;
989 displ = TILE_SIZE / 2 - HIGHLIGHT_WIDTH - 2;
990 displ2 = TILE_SIZE / 3 - HIGHLIGHT_WIDTH;
992 coords[0] = cx - displ * xdx + displ2 * ydx;
993 coords[1] = cy - displ * xdy + displ2 * ydy;
994 rotate(coords+0, rot);
995 coords[2] = cx + displ * xdx + displ2 * ydx;
996 coords[3] = cy + displ * xdy + displ2 * ydy;
997 rotate(coords+2, rot);
998 coords[4] = cx - displ * ydx;
999 coords[5] = cy - displ * ydy;
1000 rotate(coords+4, rot);
1001 draw_polygon(dr, coords, 3, COL_LOWLIGHT_GENTLE, COL_LOWLIGHT_GENTLE);
1004 coords[0] = x + TILE_SIZE/2;
1005 coords[1] = y + TILE_SIZE/2;
1006 rotate(coords+0, rot);
1007 sprintf(str, "%d", tile / 4);
1008 draw_text(dr, coords[0], coords[1],
1009 FONT_VARIABLE, TILE_SIZE/3, ALIGN_VCENTRE | ALIGN_HCENTRE,
1015 draw_update(dr, x, y, TILE_SIZE, TILE_SIZE);
1018 static int highlight_colour(float angle)
1022 COL_LOWLIGHT_GENTLE,
1023 COL_LOWLIGHT_GENTLE,
1024 COL_LOWLIGHT_GENTLE,
1025 COL_HIGHLIGHT_GENTLE,
1026 COL_HIGHLIGHT_GENTLE,
1027 COL_HIGHLIGHT_GENTLE,
1038 COL_HIGHLIGHT_GENTLE,
1039 COL_HIGHLIGHT_GENTLE,
1040 COL_HIGHLIGHT_GENTLE,
1041 COL_LOWLIGHT_GENTLE,
1042 COL_LOWLIGHT_GENTLE,
1043 COL_LOWLIGHT_GENTLE,
1055 return colours[(int)((angle + 2*PI) / (PI/16)) & 31];
1058 static float game_anim_length_real(const game_state *oldstate,
1059 const game_state *newstate, int dir,
1063 * Our game_anim_length doesn't need to modify its game_ui, so
1064 * this is the real function which declares ui as const. We must
1065 * wrap this for the backend structure with a version that has ui
1066 * non-const, but we still need this version to call from within
1067 * game_redraw which only has a const ui available.
1069 return (float)(ANIM_PER_BLKSIZE_UNIT * sqrt(newstate->n-1));
1072 static float game_anim_length(const game_state *oldstate,
1073 const game_state *newstate, int dir, game_ui *ui)
1075 return game_anim_length_real(oldstate, newstate, dir, ui);
1079 static float game_flash_length(const game_state *oldstate,
1080 const game_state *newstate, int dir, game_ui *ui)
1082 if (!oldstate->completed && newstate->completed &&
1083 !oldstate->used_solve && !newstate->used_solve)
1084 return 2 * FLASH_FRAME;
1089 static int game_status(const game_state *state)
1091 return state->completed ? +1 : 0;
1094 static void game_redraw(drawing *dr, game_drawstate *ds,
1095 const game_state *oldstate, const game_state *state,
1096 int dir, const game_ui *ui,
1097 float animtime, float flashtime)
1100 struct rotation srot, *rot;
1101 int lastx = -1, lasty = -1, lastr = -1;
1102 int cx, cy, cmoved = 0, n = state->n;
1104 cx = ui->cur_visible ? ui->cur_x : -state->n;
1105 cy = ui->cur_visible ? ui->cur_y : -state->n;
1106 if (cx != ds->cur_x || cy != ds->cur_y)
1109 if (flashtime > 0) {
1110 int frame = (int)(flashtime / FLASH_FRAME);
1111 bgcolour = (frame % 2 ? COL_LOWLIGHT : COL_HIGHLIGHT);
1113 bgcolour = COL_BACKGROUND;
1119 TILE_SIZE * state->w + 2 * BORDER,
1120 TILE_SIZE * state->h + 2 * BORDER, COL_BACKGROUND);
1121 draw_update(dr, 0, 0,
1122 TILE_SIZE * state->w + 2 * BORDER,
1123 TILE_SIZE * state->h + 2 * BORDER);
1126 * Recessed area containing the whole puzzle.
1128 coords[0] = COORD(state->w) + HIGHLIGHT_WIDTH - 1;
1129 coords[1] = COORD(state->h) + HIGHLIGHT_WIDTH - 1;
1130 coords[2] = COORD(state->w) + HIGHLIGHT_WIDTH - 1;
1131 coords[3] = COORD(0) - HIGHLIGHT_WIDTH;
1132 coords[4] = coords[2] - TILE_SIZE;
1133 coords[5] = coords[3] + TILE_SIZE;
1134 coords[8] = COORD(0) - HIGHLIGHT_WIDTH;
1135 coords[9] = COORD(state->h) + HIGHLIGHT_WIDTH - 1;
1136 coords[6] = coords[8] + TILE_SIZE;
1137 coords[7] = coords[9] - TILE_SIZE;
1138 draw_polygon(dr, coords, 5, COL_HIGHLIGHT, COL_HIGHLIGHT);
1140 coords[1] = COORD(0) - HIGHLIGHT_WIDTH;
1141 coords[0] = COORD(0) - HIGHLIGHT_WIDTH;
1142 draw_polygon(dr, coords, 5, COL_LOWLIGHT, COL_LOWLIGHT);
1148 * If we're drawing any rotated tiles, sort out the rotation
1149 * parameters, and also zap the rotation region to the
1150 * background colour before doing anything else.
1154 float anim_max = game_anim_length_real(oldstate, state, dir, ui);
1157 lastx = state->lastx;
1158 lasty = state->lasty;
1159 lastr = state->lastr;
1161 lastx = oldstate->lastx;
1162 lasty = oldstate->lasty;
1163 lastr = -oldstate->lastr;
1167 rot->cx = COORD(lastx);
1168 rot->cy = COORD(lasty);
1169 rot->cw = rot->ch = TILE_SIZE * state->n;
1170 rot->ox = rot->cx + rot->cw/2;
1171 rot->oy = rot->cy + rot->ch/2;
1172 angle = (float)((-PI/2 * lastr) * (1.0 - animtime / anim_max));
1173 rot->c = (float)cos(angle);
1174 rot->s = (float)sin(angle);
1177 * Sort out the colours of the various sides of the tile.
1179 rot->lc = highlight_colour((float)PI + angle);
1180 rot->rc = highlight_colour(angle);
1181 rot->tc = highlight_colour((float)(PI/2.0) + angle);
1182 rot->bc = highlight_colour((float)(-PI/2.0) + angle);
1184 draw_rect(dr, rot->cx, rot->cy, rot->cw, rot->ch, bgcolour);
1189 * Now draw each tile.
1191 for (i = 0; i < state->w * state->h; i++) {
1193 int tx = i % state->w, ty = i / state->w;
1196 * Figure out what should be displayed at this location.
1197 * Usually it will be state->grid[i], unless we're in the
1198 * middle of animating an actual rotation and this cell is
1199 * within the rotation region, in which case we set -1
1202 if (oldstate && lastx >= 0 && lasty >= 0 &&
1203 tx >= lastx && tx < lastx + state->n &&
1204 ty >= lasty && ty < lasty + state->n)
1210 /* cursor has moved (or changed visibility)... */
1211 if (tx == cx || tx == cx+n-1 || ty == cy || ty == cy+n-1)
1212 cc = 1; /* ...we're on new cursor, redraw */
1213 if (tx == ds->cur_x || tx == ds->cur_x+n-1 ||
1214 ty == ds->cur_y || ty == ds->cur_y+n-1)
1215 cc = 1; /* ...we were on old cursor, redraw */
1218 if (ds->bgcolour != bgcolour || /* always redraw when flashing */
1219 ds->grid[i] != t || ds->grid[i] == -1 || t == -1 || cc) {
1220 int x = COORD(tx), y = COORD(ty);
1221 unsigned cedges = 0;
1223 if (tx == cx && ty >= cy && ty <= cy+n-1) cedges |= CUR_LEFT;
1224 if (ty == cy && tx >= cx && tx <= cx+n-1) cedges |= CUR_TOP;
1225 if (tx == cx+n-1 && ty >= cy && ty <= cy+n-1) cedges |= CUR_RIGHT;
1226 if (ty == cy+n-1 && tx >= cx && tx <= cx+n-1) cedges |= CUR_BOTTOM;
1228 draw_tile(dr, ds, state, x, y, state->grid[i], bgcolour, rot, cedges);
1232 ds->bgcolour = bgcolour;
1233 ds->cur_x = cx; ds->cur_y = cy;
1236 * Update the status bar.
1239 char statusbuf[256];
1242 * Don't show the new status until we're also showing the
1243 * new _state_ - after the game animation is complete.
1248 if (state->used_solve)
1249 sprintf(statusbuf, "Moves since auto-solve: %d",
1250 state->movecount - state->completed);
1252 sprintf(statusbuf, "%sMoves: %d",
1253 (state->completed ? "COMPLETED! " : ""),
1254 (state->completed ? state->completed : state->movecount));
1255 if (state->movetarget)
1256 sprintf(statusbuf+strlen(statusbuf), " (target %d)",
1260 status_bar(dr, statusbuf);
1264 static int game_timing_state(const game_state *state, game_ui *ui)
1269 static void game_print_size(const game_params *params, float *x, float *y)
1273 static void game_print(drawing *dr, const game_state *state, int tilesize)
1278 #define thegame twiddle
1281 const struct game thegame = {
1282 "Twiddle", "games.twiddle", "twiddle",
1284 game_fetch_preset, NULL,
1289 TRUE, game_configure, custom_params,
1297 TRUE, game_can_format_as_text_now, game_text_format,
1305 PREFERRED_TILE_SIZE, game_compute_size, game_set_size,
1308 game_free_drawstate,
1313 FALSE, FALSE, game_print_size, game_print,
1314 TRUE, /* wants_statusbar */
1315 FALSE, game_timing_state,
1319 /* vim: set shiftwidth=4 tabstop=8: */