2 * pattern.c: the pattern-reconstruction game known as `nonograms'.
23 #define PREFERRED_TILE_SIZE 24
24 #define TILE_SIZE (ds->tilesize)
25 #define BORDER (3 * TILE_SIZE / 4)
26 #define TLBORDER(d) ( (d) / 5 + 2 )
27 #define GUTTER (TILE_SIZE / 2)
29 #define FROMCOORD(d, x) \
30 ( ((x) - (BORDER + GUTTER + TILE_SIZE * TLBORDER(d))) / TILE_SIZE )
32 #define SIZE(d) (2*BORDER + GUTTER + TILE_SIZE * (TLBORDER(d) + (d)))
33 #define GETTILESIZE(d, w) (w / (2 + TLBORDER(d) + (d)))
35 #define TOCOORD(d, x) (BORDER + GUTTER + TILE_SIZE * (TLBORDER(d) + (x)))
41 #define GRID_UNKNOWN 2
49 int *rowdata, *rowlen;
50 int completed, cheated;
53 #define FLASH_TIME 0.13F
55 static game_params *default_params(void)
57 game_params *ret = snew(game_params);
64 static const struct game_params pattern_presets[] = {
74 static int game_fetch_preset(int i, char **name, game_params **params)
79 if (i < 0 || i >= lenof(pattern_presets))
82 ret = snew(game_params);
83 *ret = pattern_presets[i];
85 sprintf(str, "%dx%d", ret->w, ret->h);
92 static void free_params(game_params *params)
97 static game_params *dup_params(game_params *params)
99 game_params *ret = snew(game_params);
100 *ret = *params; /* structure copy */
104 static void decode_params(game_params *ret, char const *string)
106 char const *p = string;
109 while (*p && isdigit(*p)) p++;
113 while (*p && isdigit(*p)) p++;
119 static char *encode_params(game_params *params, int full)
124 len = sprintf(ret, "%dx%d", params->w, params->h);
125 assert(len < lenof(ret));
131 static config_item *game_configure(game_params *params)
136 ret = snewn(3, config_item);
138 ret[0].name = "Width";
139 ret[0].type = C_STRING;
140 sprintf(buf, "%d", params->w);
141 ret[0].sval = dupstr(buf);
144 ret[1].name = "Height";
145 ret[1].type = C_STRING;
146 sprintf(buf, "%d", params->h);
147 ret[1].sval = dupstr(buf);
158 static game_params *custom_params(config_item *cfg)
160 game_params *ret = snew(game_params);
162 ret->w = atoi(cfg[0].sval);
163 ret->h = atoi(cfg[1].sval);
168 static char *validate_params(game_params *params)
170 if (params->w <= 0 || params->h <= 0)
171 return "Width and height must both be greater than zero";
175 /* ----------------------------------------------------------------------
176 * Puzzle generation code.
178 * For this particular puzzle, it seemed important to me to ensure
179 * a unique solution. I do this the brute-force way, by having a
180 * solver algorithm alongside the generator, and repeatedly
181 * generating a random grid until I find one whose solution is
182 * unique. It turns out that this isn't too onerous on a modern PC
183 * provided you keep grid size below around 30. Any offers of
184 * better algorithms, however, will be very gratefully received.
186 * Another annoyance of this approach is that it limits the
187 * available puzzles to those solvable by the algorithm I've used.
188 * My algorithm only ever considers a single row or column at any
189 * one time, which means it's incapable of solving the following
190 * difficult example (found by Bella Image around 1995/6, when she
191 * and I were both doing maths degrees):
205 * Obviously this cannot be solved by a one-row-or-column-at-a-time
206 * algorithm (it would require at least one row or column reading
207 * `2 1', `1 2', `3' or `4' to get started). However, it can be
208 * proved to have a unique solution: if the top left square were
209 * empty, then the only option for the top row would be to fill the
210 * two squares in the 1 columns, which would imply the squares
211 * below those were empty, leaving no place for the 2 in the second
212 * row. Contradiction. Hence the top left square is full, and the
213 * unique solution follows easily from that starting point.
215 * (The game ID for this puzzle is 4x4:2/1/2/1/1.1/2/1/1 , in case
216 * it's useful to anyone.)
219 static int float_compare(const void *av, const void *bv)
221 const float *a = (const float *)av;
222 const float *b = (const float *)bv;
231 static void generate(random_state *rs, int w, int h, unsigned char *retgrid)
238 fgrid = snewn(w*h, float);
240 for (i = 0; i < h; i++) {
241 for (j = 0; j < w; j++) {
242 fgrid[i*w+j] = random_upto(rs, 100000000UL) / 100000000.F;
247 * The above gives a completely random splattering of black and
248 * white cells. We want to gently bias this in favour of _some_
249 * reasonably thick areas of white and black, while retaining
250 * some randomness and fine detail.
252 * So we evolve the starting grid using a cellular automaton.
253 * Currently, I'm doing something very simple indeed, which is
254 * to set each square to the average of the surrounding nine
255 * cells (or the average of fewer, if we're on a corner).
257 for (step = 0; step < 1; step++) {
258 fgrid2 = snewn(w*h, float);
260 for (i = 0; i < h; i++) {
261 for (j = 0; j < w; j++) {
266 * Compute the average of the surrounding cells.
270 for (p = -1; p <= +1; p++) {
271 for (q = -1; q <= +1; q++) {
272 if (i+p < 0 || i+p >= h || j+q < 0 || j+q >= w)
275 * An additional special case not mentioned
276 * above: if a grid dimension is 2xn then
277 * we do not average across that dimension
278 * at all. Otherwise a 2x2 grid would
279 * contain four identical squares.
281 if ((h==2 && p!=0) || (w==2 && q!=0))
284 sx += fgrid[(i+p)*w+(j+q)];
289 fgrid2[i*w+j] = xbar;
297 fgrid2 = snewn(w*h, float);
298 memcpy(fgrid2, fgrid, w*h*sizeof(float));
299 qsort(fgrid2, w*h, sizeof(float), float_compare);
300 threshold = fgrid2[w*h/2];
303 for (i = 0; i < h; i++) {
304 for (j = 0; j < w; j++) {
305 retgrid[i*w+j] = (fgrid[i*w+j] >= threshold ? GRID_FULL :
313 static int compute_rowdata(int *ret, unsigned char *start, int len, int step)
319 for (i = 0; i < len; i++) {
320 if (start[i*step] == GRID_FULL) {
322 while (i+runlen < len && start[(i+runlen)*step] == GRID_FULL)
328 if (i < len && start[i*step] == GRID_UNKNOWN)
338 #define STILL_UNKNOWN 3
340 static void do_recurse(unsigned char *known, unsigned char *deduced,
341 unsigned char *row, int *data, int len,
342 int freespace, int ndone, int lowest)
347 for (i=0; i<=freespace; i++) {
349 for (k=0; k<i; k++) row[j++] = DOT;
350 for (k=0; k<data[ndone]; k++) row[j++] = BLOCK;
351 if (j < len) row[j++] = DOT;
352 do_recurse(known, deduced, row, data, len,
353 freespace-i, ndone+1, j);
356 for (i=lowest; i<len; i++)
358 for (i=0; i<len; i++)
359 if (known[i] && known[i] != row[i])
361 for (i=0; i<len; i++)
362 deduced[i] |= row[i];
366 static int do_row(unsigned char *known, unsigned char *deduced,
368 unsigned char *start, int len, int step, int *data)
370 int rowlen, i, freespace, done_any;
373 for (rowlen = 0; data[rowlen]; rowlen++)
374 freespace -= data[rowlen]+1;
376 for (i = 0; i < len; i++) {
377 known[i] = start[i*step];
381 do_recurse(known, deduced, row, data, len, freespace, 0, 0);
383 for (i=0; i<len; i++)
384 if (deduced[i] && deduced[i] != STILL_UNKNOWN && !known[i]) {
385 start[i*step] = deduced[i];
391 static unsigned char *generate_soluble(random_state *rs, int w, int h)
393 int i, j, done_any, ok, ntries, max;
394 unsigned char *grid, *matrix, *workspace;
397 grid = snewn(w*h, unsigned char);
398 matrix = snewn(w*h, unsigned char);
400 workspace = snewn(max*3, unsigned char);
401 rowdata = snewn(max+1, int);
408 generate(rs, w, h, grid);
411 * The game is a bit too easy if any row or column is
412 * completely black or completely white. An exception is
413 * made for rows/columns that are under 3 squares,
414 * otherwise nothing will ever be successfully generated.
418 for (i = 0; i < h; i++) {
420 for (j = 0; j < w; j++)
421 colours |= (grid[i*w+j] == GRID_FULL ? 2 : 1);
427 for (j = 0; j < w; j++) {
429 for (i = 0; i < h; i++)
430 colours |= (grid[i*w+j] == GRID_FULL ? 2 : 1);
438 memset(matrix, 0, w*h);
442 for (i=0; i<h; i++) {
443 rowdata[compute_rowdata(rowdata, grid+i*w, w, 1)] = 0;
444 done_any |= do_row(workspace, workspace+max, workspace+2*max,
445 matrix+i*w, w, 1, rowdata);
447 for (i=0; i<w; i++) {
448 rowdata[compute_rowdata(rowdata, grid+i, h, w)] = 0;
449 done_any |= do_row(workspace, workspace+max, workspace+2*max,
450 matrix+i, h, w, rowdata);
455 for (i=0; i<h; i++) {
456 for (j=0; j<w; j++) {
457 if (matrix[i*w+j] == UNKNOWN)
469 struct game_aux_info {
474 static char *new_game_desc(game_params *params, random_state *rs,
475 game_aux_info **aux, int interactive)
478 int i, j, max, rowlen, *rowdata;
479 char intbuf[80], *desc;
480 int desclen, descpos;
482 grid = generate_soluble(rs, params->w, params->h);
483 max = max(params->w, params->h);
484 rowdata = snewn(max, int);
487 * Save the solved game in an aux_info.
490 game_aux_info *ai = snew(game_aux_info);
500 * Seed is a slash-separated list of row contents; each row
501 * contents section is a dot-separated list of integers. Row
502 * contents are listed in the order (columns left to right,
503 * then rows top to bottom).
505 * Simplest way to handle memory allocation is to make two
506 * passes, first computing the seed size and then writing it
510 for (i = 0; i < params->w + params->h; i++) {
512 rowlen = compute_rowdata(rowdata, grid+i, params->h, params->w);
514 rowlen = compute_rowdata(rowdata, grid+(i-params->w)*params->w,
517 for (j = 0; j < rowlen; j++) {
518 desclen += 1 + sprintf(intbuf, "%d", rowdata[j]);
524 desc = snewn(desclen, char);
526 for (i = 0; i < params->w + params->h; i++) {
528 rowlen = compute_rowdata(rowdata, grid+i, params->h, params->w);
530 rowlen = compute_rowdata(rowdata, grid+(i-params->w)*params->w,
533 for (j = 0; j < rowlen; j++) {
534 int len = sprintf(desc+descpos, "%d", rowdata[j]);
536 desc[descpos + len] = '.';
538 desc[descpos + len] = '/';
542 desc[descpos++] = '/';
545 assert(descpos == desclen);
546 assert(desc[desclen-1] == '/');
547 desc[desclen-1] = '\0';
552 static void game_free_aux_info(game_aux_info *aux)
558 static char *validate_desc(game_params *params, char *desc)
563 for (i = 0; i < params->w + params->h; i++) {
565 rowspace = params->h + 1;
567 rowspace = params->w + 1;
569 if (*desc && isdigit((unsigned char)*desc)) {
572 while (desc && isdigit((unsigned char)*desc)) desc++;
578 return "at least one column contains more numbers than will fit";
580 return "at least one row contains more numbers than will fit";
582 } while (*desc++ == '.');
584 desc++; /* expect a slash immediately */
587 if (desc[-1] == '/') {
588 if (i+1 == params->w + params->h)
589 return "too many row/column specifications";
590 } else if (desc[-1] == '\0') {
591 if (i+1 < params->w + params->h)
592 return "too few row/column specifications";
594 return "unrecognised character in game specification";
600 static game_state *new_game(midend_data *me, game_params *params, char *desc)
604 game_state *state = snew(game_state);
606 state->w = params->w;
607 state->h = params->h;
609 state->grid = snewn(state->w * state->h, unsigned char);
610 memset(state->grid, GRID_UNKNOWN, state->w * state->h);
612 state->rowsize = max(state->w, state->h);
613 state->rowdata = snewn(state->rowsize * (state->w + state->h), int);
614 state->rowlen = snewn(state->w + state->h, int);
616 state->completed = state->cheated = FALSE;
618 for (i = 0; i < params->w + params->h; i++) {
619 state->rowlen[i] = 0;
620 if (*desc && isdigit((unsigned char)*desc)) {
623 while (desc && isdigit((unsigned char)*desc)) desc++;
624 state->rowdata[state->rowsize * i + state->rowlen[i]++] =
626 } while (*desc++ == '.');
628 desc++; /* expect a slash immediately */
635 static game_state *dup_game(game_state *state)
637 game_state *ret = snew(game_state);
642 ret->grid = snewn(ret->w * ret->h, unsigned char);
643 memcpy(ret->grid, state->grid, ret->w * ret->h);
645 ret->rowsize = state->rowsize;
646 ret->rowdata = snewn(ret->rowsize * (ret->w + ret->h), int);
647 ret->rowlen = snewn(ret->w + ret->h, int);
648 memcpy(ret->rowdata, state->rowdata,
649 ret->rowsize * (ret->w + ret->h) * sizeof(int));
650 memcpy(ret->rowlen, state->rowlen,
651 (ret->w + ret->h) * sizeof(int));
653 ret->completed = state->completed;
654 ret->cheated = state->cheated;
659 static void free_game(game_state *state)
661 sfree(state->rowdata);
662 sfree(state->rowlen);
667 static char *solve_game(game_state *state, game_state *currstate,
668 game_aux_info *ai, char **error)
670 unsigned char *matrix;
671 int matrix_needs_freeing;
673 int w = state->w, h = state->h;
678 * If we already have the solved state in an aux_info, copy it
682 assert(ai->w == w && ai->h == h);
685 matrix_needs_freeing = FALSE;
690 unsigned char *workspace;
693 matrix = snewn(w*h, unsigned char);
695 workspace = snewn(max*3, unsigned char);
696 rowdata = snewn(max+1, int);
698 memset(matrix, 0, w*h);
702 for (i=0; i<h; i++) {
703 memcpy(rowdata, state->rowdata + state->rowsize*(w+i),
705 rowdata[state->rowlen[w+i]] = 0;
706 done_any |= do_row(workspace, workspace+max, workspace+2*max,
707 matrix+i*w, w, 1, rowdata);
709 for (i=0; i<w; i++) {
710 memcpy(rowdata, state->rowdata + state->rowsize*i, max*sizeof(int));
711 rowdata[state->rowlen[i]] = 0;
712 done_any |= do_row(workspace, workspace+max, workspace+2*max,
713 matrix+i, h, w, rowdata);
720 for (i = 0; i < w*h; i++) {
721 if (matrix[i] != BLOCK && matrix[i] != DOT) {
723 *error = "Solving algorithm cannot complete this puzzle";
728 matrix_needs_freeing = TRUE;
733 ret = snewn(w*h+2, char);
735 for (i = 0; i < w*h; i++) {
736 assert(matrix[i] == full || matrix[i] == empty);
737 ret[i+1] = (matrix[i] == full ? '1' : '0');
741 if (matrix_needs_freeing)
747 static char *game_text_format(game_state *state)
758 int drag, release, state;
761 static game_ui *new_ui(game_state *state)
766 ret->dragging = FALSE;
771 static void free_ui(game_ui *ui)
776 char *encode_ui(game_ui *ui)
781 void decode_ui(game_ui *ui, char *encoding)
785 static void game_changed_state(game_ui *ui, game_state *oldstate,
786 game_state *newstate)
790 struct game_drawstate {
794 unsigned char *visible;
797 static char *interpret_move(game_state *state, game_ui *ui, game_drawstate *ds,
798 int x, int y, int button)
802 x = FROMCOORD(state->w, x);
803 y = FROMCOORD(state->h, y);
805 if (x >= 0 && x < state->w && y >= 0 && y < state->h &&
806 (button == LEFT_BUTTON || button == RIGHT_BUTTON ||
807 button == MIDDLE_BUTTON)) {
811 if (button == LEFT_BUTTON) {
812 ui->drag = LEFT_DRAG;
813 ui->release = LEFT_RELEASE;
814 ui->state = GRID_FULL;
815 } else if (button == RIGHT_BUTTON) {
816 ui->drag = RIGHT_DRAG;
817 ui->release = RIGHT_RELEASE;
818 ui->state = GRID_EMPTY;
819 } else /* if (button == MIDDLE_BUTTON) */ {
820 ui->drag = MIDDLE_DRAG;
821 ui->release = MIDDLE_RELEASE;
822 ui->state = GRID_UNKNOWN;
825 ui->drag_start_x = ui->drag_end_x = x;
826 ui->drag_start_y = ui->drag_end_y = y;
828 return ""; /* UI activity occurred */
831 if (ui->dragging && button == ui->drag) {
833 * There doesn't seem much point in allowing a rectangle
834 * drag; people will generally only want to drag a single
835 * horizontal or vertical line, so we make that easy by
838 * Exception: if we're _middle_-button dragging to tag
839 * things as UNKNOWN, we may well want to trash an entire
840 * area and start over!
842 if (ui->state != GRID_UNKNOWN) {
843 if (abs(x - ui->drag_start_x) > abs(y - ui->drag_start_y))
844 y = ui->drag_start_y;
846 x = ui->drag_start_x;
851 if (x >= state->w) x = state->w - 1;
852 if (y >= state->h) y = state->h - 1;
857 return ""; /* UI activity occurred */
860 if (ui->dragging && button == ui->release) {
861 int x1, x2, y1, y2, xx, yy;
862 int move_needed = FALSE;
864 x1 = min(ui->drag_start_x, ui->drag_end_x);
865 x2 = max(ui->drag_start_x, ui->drag_end_x);
866 y1 = min(ui->drag_start_y, ui->drag_end_y);
867 y2 = max(ui->drag_start_y, ui->drag_end_y);
869 for (yy = y1; yy <= y2; yy++)
870 for (xx = x1; xx <= x2; xx++)
871 if (state->grid[yy * state->w + xx] != ui->state)
874 ui->dragging = FALSE;
878 sprintf(buf, "%c%d,%d,%d,%d",
879 (ui->state == GRID_FULL ? 'F' :
880 ui->state == GRID_EMPTY ? 'E' : 'U'),
881 x1, y1, x2-x1+1, y2-y1+1);
884 return ""; /* UI activity occurred */
890 static game_state *execute_move(game_state *from, char *move)
893 int x1, x2, y1, y2, xx, yy;
896 if (move[0] == 'S' && strlen(move) == from->w * from->h + 1) {
899 ret = dup_game(from);
901 for (i = 0; i < ret->w * ret->h; i++)
902 ret->grid[i] = (move[i+1] == '1' ? GRID_FULL : GRID_EMPTY);
904 ret->completed = ret->cheated = TRUE;
907 } else if ((move[0] == 'F' || move[0] == 'E' || move[0] == 'U') &&
908 sscanf(move+1, "%d,%d,%d,%d", &x1, &y1, &x2, &y2) == 4 &&
909 x1 >= 0 && x2 >= 0 && x1+x2 <= from->w &&
910 y1 >= 0 && y2 >= 0 && y1+y2 <= from->h) {
914 val = (move[0] == 'F' ? GRID_FULL :
915 move[0] == 'E' ? GRID_EMPTY : GRID_UNKNOWN);
917 ret = dup_game(from);
918 for (yy = y1; yy < y2; yy++)
919 for (xx = x1; xx < x2; xx++)
920 ret->grid[yy * ret->w + xx] = val;
923 * An actual change, so check to see if we've completed the
926 if (!ret->completed) {
927 int *rowdata = snewn(ret->rowsize, int);
930 ret->completed = TRUE;
932 for (i=0; i<ret->w; i++) {
933 len = compute_rowdata(rowdata,
934 ret->grid+i, ret->h, ret->w);
935 if (len != ret->rowlen[i] ||
936 memcmp(ret->rowdata+i*ret->rowsize, rowdata,
937 len * sizeof(int))) {
938 ret->completed = FALSE;
942 for (i=0; i<ret->h; i++) {
943 len = compute_rowdata(rowdata,
944 ret->grid+i*ret->w, ret->w, 1);
945 if (len != ret->rowlen[i+ret->w] ||
946 memcmp(ret->rowdata+(i+ret->w)*ret->rowsize, rowdata,
947 len * sizeof(int))) {
948 ret->completed = FALSE;
961 /* ----------------------------------------------------------------------
965 static void game_size(game_params *params, game_drawstate *ds,
966 int *x, int *y, int expand)
970 ts = min(GETTILESIZE(params->w, *x), GETTILESIZE(params->h, *y));
974 ds->tilesize = min(ts, PREFERRED_TILE_SIZE);
976 *x = SIZE(params->w);
977 *y = SIZE(params->h);
980 static float *game_colours(frontend *fe, game_state *state, int *ncolours)
982 float *ret = snewn(3 * NCOLOURS, float);
984 frontend_default_colour(fe, &ret[COL_BACKGROUND * 3]);
986 ret[COL_GRID * 3 + 0] = 0.3F;
987 ret[COL_GRID * 3 + 1] = 0.3F;
988 ret[COL_GRID * 3 + 2] = 0.3F;
990 ret[COL_UNKNOWN * 3 + 0] = 0.5F;
991 ret[COL_UNKNOWN * 3 + 1] = 0.5F;
992 ret[COL_UNKNOWN * 3 + 2] = 0.5F;
994 ret[COL_FULL * 3 + 0] = 0.0F;
995 ret[COL_FULL * 3 + 1] = 0.0F;
996 ret[COL_FULL * 3 + 2] = 0.0F;
998 ret[COL_EMPTY * 3 + 0] = 1.0F;
999 ret[COL_EMPTY * 3 + 1] = 1.0F;
1000 ret[COL_EMPTY * 3 + 2] = 1.0F;
1002 *ncolours = NCOLOURS;
1006 static game_drawstate *game_new_drawstate(game_state *state)
1008 struct game_drawstate *ds = snew(struct game_drawstate);
1010 ds->started = FALSE;
1013 ds->visible = snewn(ds->w * ds->h, unsigned char);
1014 ds->tilesize = 0; /* not decided yet */
1015 memset(ds->visible, 255, ds->w * ds->h);
1020 static void game_free_drawstate(game_drawstate *ds)
1026 static void grid_square(frontend *fe, game_drawstate *ds,
1027 int y, int x, int state)
1031 draw_rect(fe, TOCOORD(ds->w, x), TOCOORD(ds->h, y),
1032 TILE_SIZE, TILE_SIZE, COL_GRID);
1034 xl = (x % 5 == 0 ? 1 : 0);
1035 yt = (y % 5 == 0 ? 1 : 0);
1036 xr = (x % 5 == 4 || x == ds->w-1 ? 1 : 0);
1037 yb = (y % 5 == 4 || y == ds->h-1 ? 1 : 0);
1039 draw_rect(fe, TOCOORD(ds->w, x) + 1 + xl, TOCOORD(ds->h, y) + 1 + yt,
1040 TILE_SIZE - xl - xr - 1, TILE_SIZE - yt - yb - 1,
1041 (state == GRID_FULL ? COL_FULL :
1042 state == GRID_EMPTY ? COL_EMPTY : COL_UNKNOWN));
1044 draw_update(fe, TOCOORD(ds->w, x), TOCOORD(ds->h, y),
1045 TILE_SIZE, TILE_SIZE);
1048 static void game_redraw(frontend *fe, game_drawstate *ds, game_state *oldstate,
1049 game_state *state, int dir, game_ui *ui,
1050 float animtime, float flashtime)
1057 * The initial contents of the window are not guaranteed
1058 * and can vary with front ends. To be on the safe side,
1059 * all games should start by drawing a big background-
1060 * colour rectangle covering the whole window.
1062 draw_rect(fe, 0, 0, SIZE(ds->w), SIZE(ds->h), COL_BACKGROUND);
1067 for (i = 0; i < ds->w + ds->h; i++) {
1068 int rowlen = state->rowlen[i];
1069 int *rowdata = state->rowdata + state->rowsize * i;
1073 * Normally I space the numbers out by the same
1074 * distance as the tile size. However, if there are
1075 * more numbers than available spaces, I have to squash
1078 nfit = max(rowlen, TLBORDER(ds->h))-1;
1081 for (j = 0; j < rowlen; j++) {
1086 x = TOCOORD(ds->w, i);
1087 y = BORDER + TILE_SIZE * (TLBORDER(ds->h)-1);
1088 y -= ((rowlen-j-1)*TILE_SIZE) * (TLBORDER(ds->h)-1) / nfit;
1090 y = TOCOORD(ds->h, i - ds->w);
1091 x = BORDER + TILE_SIZE * (TLBORDER(ds->w)-1);
1092 x -= ((rowlen-j-1)*TILE_SIZE) * (TLBORDER(ds->h)-1) / nfit;
1095 sprintf(str, "%d", rowdata[j]);
1096 draw_text(fe, x+TILE_SIZE/2, y+TILE_SIZE/2, FONT_VARIABLE,
1097 TILE_SIZE/2, ALIGN_HCENTRE | ALIGN_VCENTRE,
1098 COL_FULL, str); /* FIXME: COL_TEXT */
1103 * Draw the grid outline.
1105 draw_rect(fe, TOCOORD(ds->w, 0) - 1, TOCOORD(ds->h, 0) - 1,
1106 ds->w * TILE_SIZE + 3, ds->h * TILE_SIZE + 3,
1111 draw_update(fe, 0, 0, SIZE(ds->w), SIZE(ds->h));
1115 x1 = min(ui->drag_start_x, ui->drag_end_x);
1116 x2 = max(ui->drag_start_x, ui->drag_end_x);
1117 y1 = min(ui->drag_start_y, ui->drag_end_y);
1118 y2 = max(ui->drag_start_y, ui->drag_end_y);
1120 x1 = x2 = y1 = y2 = -1; /* placate gcc warnings */
1124 * Now draw any grid squares which have changed since last
1127 for (i = 0; i < ds->h; i++) {
1128 for (j = 0; j < ds->w; j++) {
1132 * Work out what state this square should be drawn in,
1133 * taking any current drag operation into account.
1135 if (ui->dragging && x1 <= j && j <= x2 && y1 <= i && i <= y2)
1138 val = state->grid[i * state->w + j];
1141 * Briefly invert everything twice during a completion
1144 if (flashtime > 0 &&
1145 (flashtime <= FLASH_TIME/3 || flashtime >= FLASH_TIME*2/3) &&
1146 val != GRID_UNKNOWN)
1147 val = (GRID_FULL ^ GRID_EMPTY) ^ val;
1149 if (ds->visible[i * ds->w + j] != val) {
1150 grid_square(fe, ds, i, j, val);
1151 ds->visible[i * ds->w + j] = val;
1157 static float game_anim_length(game_state *oldstate,
1158 game_state *newstate, int dir, game_ui *ui)
1163 static float game_flash_length(game_state *oldstate,
1164 game_state *newstate, int dir, game_ui *ui)
1166 if (!oldstate->completed && newstate->completed &&
1167 !oldstate->cheated && !newstate->cheated)
1172 static int game_wants_statusbar(void)
1177 static int game_timing_state(game_state *state)
1183 #define thegame pattern
1186 const struct game thegame = {
1187 "Pattern", "games.pattern",
1194 TRUE, game_configure, custom_params,
1203 FALSE, game_text_format,
1214 game_free_drawstate,
1218 game_wants_statusbar,
1219 FALSE, game_timing_state,
1220 0, /* mouse_priorities */
1223 #ifdef STANDALONE_SOLVER
1226 * gcc -DSTANDALONE_SOLVER -o patternsolver pattern.c malloc.c
1231 void frontend_default_colour(frontend *fe, float *output) {}
1232 void draw_text(frontend *fe, int x, int y, int fonttype, int fontsize,
1233 int align, int colour, char *text) {}
1234 void draw_rect(frontend *fe, int x, int y, int w, int h, int colour) {}
1235 void draw_line(frontend *fe, int x1, int y1, int x2, int y2, int colour) {}
1236 void draw_polygon(frontend *fe, int *coords, int npoints,
1237 int fill, int colour) {}
1238 void clip(frontend *fe, int x, int y, int w, int h) {}
1239 void unclip(frontend *fe) {}
1240 void start_draw(frontend *fe) {}
1241 void draw_update(frontend *fe, int x, int y, int w, int h) {}
1242 void end_draw(frontend *fe) {}
1243 unsigned long random_upto(random_state *state, unsigned long limit)
1244 { assert(!"Shouldn't get randomness"); return 0; }
1246 void fatal(char *fmt, ...)
1250 fprintf(stderr, "fatal error: ");
1253 vfprintf(stderr, fmt, ap);
1256 fprintf(stderr, "\n");
1260 int main(int argc, char **argv)
1265 char *id = NULL, *desc, *err;
1269 while (--argc > 0) {
1272 fprintf(stderr, "%s: unrecognised option `%s'\n", argv[0]);
1280 fprintf(stderr, "usage: %s <game_id>\n", argv[0]);
1284 desc = strchr(id, ':');
1286 fprintf(stderr, "%s: game id expects a colon in it\n", argv[0]);
1291 p = default_params();
1292 decode_params(p, id);
1293 err = validate_desc(p, desc);
1295 fprintf(stderr, "%s: %s\n", argv[0], err);
1298 s = new_game(NULL, p, desc);
1301 int w = p->w, h = p->h, i, j, done_any, max;
1302 unsigned char *matrix, *workspace;
1305 matrix = snewn(w*h, unsigned char);
1307 workspace = snewn(max*3, unsigned char);
1308 rowdata = snewn(max+1, int);
1310 memset(matrix, 0, w*h);
1314 for (i=0; i<h; i++) {
1315 memcpy(rowdata, s->rowdata + s->rowsize*(w+i),
1317 rowdata[s->rowlen[w+i]] = 0;
1318 done_any |= do_row(workspace, workspace+max, workspace+2*max,
1319 matrix+i*w, w, 1, rowdata);
1321 for (i=0; i<w; i++) {
1322 memcpy(rowdata, s->rowdata + s->rowsize*i, max*sizeof(int));
1323 rowdata[s->rowlen[i]] = 0;
1324 done_any |= do_row(workspace, workspace+max, workspace+2*max,
1325 matrix+i, h, w, rowdata);
1329 for (i = 0; i < h; i++) {
1330 for (j = 0; j < w; j++) {
1331 int c = (matrix[i*w+j] == UNKNOWN ? '?' :
1332 matrix[i*w+j] == BLOCK ? '#' :
1333 matrix[i*w+j] == DOT ? '.' :