4 * An implementation of the Nikoli game 'Loop the loop'.
5 * (c) Mike Pinna, 2005, 2006
6 * Substantially rewritten to allowing for more general types of grid.
7 * (c) Lambros Lambrou 2008
9 * vim: set shiftwidth=4 :set textwidth=80:
13 * Possible future solver enhancements:
15 * - There's an interesting deductive technique which makes use
16 * of topology rather than just graph theory. Each _face_ in
17 * the grid is either inside or outside the loop; you can tell
18 * that two faces are on the same side of the loop if they're
19 * separated by a LINE_NO (or, more generally, by a path
20 * crossing no LINE_UNKNOWNs and an even number of LINE_YESes),
21 * and on the opposite side of the loop if they're separated by
22 * a LINE_YES (or an odd number of LINE_YESes and no
23 * LINE_UNKNOWNs). Oh, and any face separated from the outside
24 * of the grid by a LINE_YES or a LINE_NO is on the inside or
25 * outside respectively. So if you can track this for all
26 * faces, you figure out the state of the line between a pair
27 * once their relative insideness is known.
28 * + The way I envisage this working is simply to keep an edsf
29 * of all _faces_, which indicates whether they're on
30 * opposite sides of the loop from one another. We also
31 * include a special entry in the edsf for the infinite
33 * + So, the simple way to do this is to just go through the
34 * edges: every time we see an edge in a state other than
35 * LINE_UNKNOWN which separates two faces that aren't in the
36 * same edsf class, we can rectify that by merging the
37 * classes. Then, conversely, an edge in LINE_UNKNOWN state
38 * which separates two faces that _are_ in the same edsf
39 * class can immediately have its state determined.
40 * + But you can go one better, if you're prepared to loop
41 * over all _pairs_ of edges. Suppose we have edges A and B,
42 * which respectively separate faces A1,A2 and B1,B2.
43 * Suppose that A,B are in the same edge-edsf class and that
44 * A1,B1 (wlog) are in the same face-edsf class; then we can
45 * immediately place A2,B2 into the same face-edsf class (as
46 * each other, not as A1 and A2) one way round or the other.
47 * And conversely again, if A1,B1 are in the same face-edsf
48 * class and so are A2,B2, then we can put A,B into the same
50 * * Of course, this deduction requires a quadratic-time
51 * loop over all pairs of edges in the grid, so it should
52 * be reserved until there's nothing easier left to be
55 * - The generalised grid support has made me (SGT) notice a
56 * possible extension to the loop-avoidance code. When you have
57 * a path of connected edges such that no other edges at all
58 * are incident on any vertex in the middle of the path - or,
59 * alternatively, such that any such edges are already known to
60 * be LINE_NO - then you know those edges are either all
61 * LINE_YES or all LINE_NO. Hence you can mentally merge the
62 * entire path into a single long curly edge for the purposes
63 * of loop avoidance, and look directly at whether or not the
64 * extreme endpoints of the path are connected by some other
65 * route. I find this coming up fairly often when I play on the
66 * octagonal grid setting, so it might be worth implementing in
69 * - (Just a speed optimisation.) Consider some todo list queue where every
70 * time we modify something we mark it for consideration by other bits of
71 * the solver, to save iteration over things that have already been done.
87 /* Debugging options */
95 /* ----------------------------------------------------------------------
96 * Struct, enum and function declarations
111 grid
*game_grid
; /* ref-counted (internally) */
113 /* Put -1 in a face that doesn't get a clue */
116 /* Array of line states, to store whether each line is
117 * YES, NO or UNKNOWN */
120 unsigned char *line_errors
;
125 /* Used in game_text_format(), so that it knows what type of
126 * grid it's trying to render as ASCII text. */
131 SOLVER_SOLVED
, /* This is the only solution the solver could find */
132 SOLVER_MISTAKE
, /* This is definitely not a solution */
133 SOLVER_AMBIGUOUS
, /* This _might_ be an ambiguous solution */
134 SOLVER_INCOMPLETE
/* This may be a partial solution */
137 /* ------ Solver state ------ */
138 typedef struct solver_state
{
140 enum solver_status solver_status
;
141 /* NB looplen is the number of dots that are joined together at a point, ie a
142 * looplen of 1 means there are no lines to a particular dot */
145 /* Difficulty level of solver. Used by solver functions that want to
146 * vary their behaviour depending on the requested difficulty level. */
152 char *face_yes_count
;
154 char *dot_solved
, *face_solved
;
157 /* Information for Normal level deductions:
158 * For each dline, store a bitmask for whether we know:
159 * (bit 0) at least one is YES
160 * (bit 1) at most one is YES */
163 /* Hard level information */
168 * Difficulty levels. I do some macro ickery here to ensure that my
169 * enum and the various forms of my name list always match up.
172 #define DIFFLIST(A) \
177 #define ENUM(upper,title,lower) DIFF_ ## upper,
178 #define TITLE(upper,title,lower) #title,
179 #define ENCODE(upper,title,lower) #lower
180 #define CONFIG(upper,title,lower) ":" #title
181 enum { DIFFLIST(ENUM
) DIFF_MAX
};
182 static char const *const diffnames
[] = { DIFFLIST(TITLE
) };
183 static char const diffchars
[] = DIFFLIST(ENCODE
);
184 #define DIFFCONFIG DIFFLIST(CONFIG)
187 * Solver routines, sorted roughly in order of computational cost.
188 * The solver will run the faster deductions first, and slower deductions are
189 * only invoked when the faster deductions are unable to make progress.
190 * Each function is associated with a difficulty level, so that the generated
191 * puzzles are solvable by applying only the functions with the chosen
192 * difficulty level or lower.
194 #define SOLVERLIST(A) \
195 A(trivial_deductions, DIFF_EASY) \
196 A(dline_deductions, DIFF_NORMAL) \
197 A(linedsf_deductions, DIFF_HARD) \
198 A(loop_deductions, DIFF_EASY)
199 #define SOLVER_FN_DECL(fn,diff) static int fn(solver_state *);
200 #define SOLVER_FN(fn,diff) &fn,
201 #define SOLVER_DIFF(fn,diff) diff,
202 SOLVERLIST(SOLVER_FN_DECL
)
203 static int (*(solver_fns
[]))(solver_state
*) = { SOLVERLIST(SOLVER_FN
) };
204 static int const solver_diffs
[] = { SOLVERLIST(SOLVER_DIFF
) };
205 static const int NUM_SOLVERS
= sizeof(solver_diffs
)/sizeof(*solver_diffs
);
214 /* line_drawstate is the same as line_state, but with the extra ERROR
215 * possibility. The drawing code copies line_state to line_drawstate,
216 * except in the case that the line is an error. */
217 enum line_state
{ LINE_YES
, LINE_UNKNOWN
, LINE_NO
};
218 enum line_drawstate
{ DS_LINE_YES
, DS_LINE_UNKNOWN
,
219 DS_LINE_NO
, DS_LINE_ERROR
};
221 #define OPP(line_state) \
225 struct game_drawstate
{
232 char *clue_satisfied
;
235 static char *validate_desc(game_params
*params
, char *desc
);
236 static int dot_order(const game_state
* state
, int i
, char line_type
);
237 static int face_order(const game_state
* state
, int i
, char line_type
);
238 static solver_state
*solve_game_rec(const solver_state
*sstate
);
241 static void check_caches(const solver_state
* sstate
);
243 #define check_caches(s)
246 /* ------- List of grid generators ------- */
247 #define GRIDLIST(A) \
248 A(Squares,GRID_SQUARE,3,3) \
249 A(Triangular,GRID_TRIANGULAR,3,3) \
250 A(Honeycomb,GRID_HONEYCOMB,3,3) \
251 A(Snub-Square,GRID_SNUBSQUARE,3,3) \
252 A(Cairo,GRID_CAIRO,3,4) \
253 A(Great-Hexagonal,GRID_GREATHEXAGONAL,3,3) \
254 A(Octagonal,GRID_OCTAGONAL,3,3) \
255 A(Kites,GRID_KITE,3,3) \
256 A(Floret,GRID_FLORET,1,2) \
257 A(Dodecagonal,GRID_DODECAGONAL,2,2) \
258 A(Great-Dodecagonal,GRID_GREATDODECAGONAL,2,2) \
259 A(Penrose (kite/dart),GRID_PENROSE_P2,3,3) \
260 A(Penrose (rhombs),GRID_PENROSE_P3,3,3) \
262 #define GRID_NAME(title,type,amin,omin) #title,
263 #define GRID_CONFIG(title,type,amin,omin) ":" #title
264 #define GRID_TYPE(title,type,amin,omin) type,
265 #define GRID_SIZES(title,type,amin,omin) \
267 "Width and height for this grid type must both be at least " #amin, \
268 "At least one of width and height for this grid type must be at least " #omin,},
269 static char const *const gridnames
[] = { GRIDLIST(GRID_NAME
) };
270 static char const *const dualnames
[] = { "", "(dual) " };
271 #define GRID_CONFIGS GRIDLIST(GRID_CONFIG)
272 static grid_type grid_types
[] = { GRIDLIST(GRID_TYPE
) };
273 #define NUM_GRID_TYPES (sizeof(grid_types) / sizeof(grid_types[0]))
274 static const struct {
277 } grid_size_limits
[] = { GRIDLIST(GRID_SIZES
) };
279 /* Generates a (dynamically allocated) new grid, according to the
280 * type and size requested in params. Does nothing if the grid is already
282 static grid
*loopy_generate_grid(game_params
*params
, char *grid_desc
)
284 return grid_new(grid_types
[params
->type
], params
->w
, params
->h
, params
->dual
, grid_desc
);
287 /* ----------------------------------------------------------------------
291 /* General constants */
292 #define PREFERRED_TILE_SIZE 32
293 #define BORDER(tilesize) ((tilesize) / 2)
294 #define FLASH_TIME 0.5F
296 #define BIT_SET(field, bit) ((field) & (1<<(bit)))
298 #define SET_BIT(field, bit) (BIT_SET(field, bit) ? FALSE : \
299 ((field) |= (1<<(bit)), TRUE))
301 #define CLEAR_BIT(field, bit) (BIT_SET(field, bit) ? \
302 ((field) &= ~(1<<(bit)), TRUE) : FALSE)
304 #define CLUE2CHAR(c) \
305 ((c < 0) ? ' ' : c < 10 ? c + '0' : c - 10 + 'A')
307 /* ----------------------------------------------------------------------
308 * General struct manipulation and other straightforward code
311 static game_state
*dup_game(game_state
*state
)
313 game_state
*ret
= snew(game_state
);
315 ret
->game_grid
= state
->game_grid
;
316 ret
->game_grid
->refcount
++;
318 ret
->solved
= state
->solved
;
319 ret
->cheated
= state
->cheated
;
321 ret
->clues
= snewn(state
->game_grid
->num_faces
, signed char);
322 memcpy(ret
->clues
, state
->clues
, state
->game_grid
->num_faces
);
324 ret
->lines
= snewn(state
->game_grid
->num_edges
, char);
325 memcpy(ret
->lines
, state
->lines
, state
->game_grid
->num_edges
);
327 ret
->line_errors
= snewn(state
->game_grid
->num_edges
, unsigned char);
328 memcpy(ret
->line_errors
, state
->line_errors
, state
->game_grid
->num_edges
);
330 ret
->grid_type
= state
->grid_type
;
334 static void free_game(game_state
*state
)
337 grid_free(state
->game_grid
);
340 sfree(state
->line_errors
);
345 static solver_state
*new_solver_state(game_state
*state
, int diff
) {
347 int num_dots
= state
->game_grid
->num_dots
;
348 int num_faces
= state
->game_grid
->num_faces
;
349 int num_edges
= state
->game_grid
->num_edges
;
350 solver_state
*ret
= snew(solver_state
);
352 ret
->state
= dup_game(state
);
354 ret
->solver_status
= SOLVER_INCOMPLETE
;
357 ret
->dotdsf
= snew_dsf(num_dots
);
358 ret
->looplen
= snewn(num_dots
, int);
360 for (i
= 0; i
< num_dots
; i
++) {
364 ret
->dot_solved
= snewn(num_dots
, char);
365 ret
->face_solved
= snewn(num_faces
, char);
366 memset(ret
->dot_solved
, FALSE
, num_dots
);
367 memset(ret
->face_solved
, FALSE
, num_faces
);
369 ret
->dot_yes_count
= snewn(num_dots
, char);
370 memset(ret
->dot_yes_count
, 0, num_dots
);
371 ret
->dot_no_count
= snewn(num_dots
, char);
372 memset(ret
->dot_no_count
, 0, num_dots
);
373 ret
->face_yes_count
= snewn(num_faces
, char);
374 memset(ret
->face_yes_count
, 0, num_faces
);
375 ret
->face_no_count
= snewn(num_faces
, char);
376 memset(ret
->face_no_count
, 0, num_faces
);
378 if (diff
< DIFF_NORMAL
) {
381 ret
->dlines
= snewn(2*num_edges
, char);
382 memset(ret
->dlines
, 0, 2*num_edges
);
385 if (diff
< DIFF_HARD
) {
388 ret
->linedsf
= snew_dsf(state
->game_grid
->num_edges
);
394 static void free_solver_state(solver_state
*sstate
) {
396 free_game(sstate
->state
);
397 sfree(sstate
->dotdsf
);
398 sfree(sstate
->looplen
);
399 sfree(sstate
->dot_solved
);
400 sfree(sstate
->face_solved
);
401 sfree(sstate
->dot_yes_count
);
402 sfree(sstate
->dot_no_count
);
403 sfree(sstate
->face_yes_count
);
404 sfree(sstate
->face_no_count
);
406 /* OK, because sfree(NULL) is a no-op */
407 sfree(sstate
->dlines
);
408 sfree(sstate
->linedsf
);
414 static solver_state
*dup_solver_state(const solver_state
*sstate
) {
415 game_state
*state
= sstate
->state
;
416 int num_dots
= state
->game_grid
->num_dots
;
417 int num_faces
= state
->game_grid
->num_faces
;
418 int num_edges
= state
->game_grid
->num_edges
;
419 solver_state
*ret
= snew(solver_state
);
421 ret
->state
= state
= dup_game(sstate
->state
);
423 ret
->solver_status
= sstate
->solver_status
;
424 ret
->diff
= sstate
->diff
;
426 ret
->dotdsf
= snewn(num_dots
, int);
427 ret
->looplen
= snewn(num_dots
, int);
428 memcpy(ret
->dotdsf
, sstate
->dotdsf
,
429 num_dots
* sizeof(int));
430 memcpy(ret
->looplen
, sstate
->looplen
,
431 num_dots
* sizeof(int));
433 ret
->dot_solved
= snewn(num_dots
, char);
434 ret
->face_solved
= snewn(num_faces
, char);
435 memcpy(ret
->dot_solved
, sstate
->dot_solved
, num_dots
);
436 memcpy(ret
->face_solved
, sstate
->face_solved
, num_faces
);
438 ret
->dot_yes_count
= snewn(num_dots
, char);
439 memcpy(ret
->dot_yes_count
, sstate
->dot_yes_count
, num_dots
);
440 ret
->dot_no_count
= snewn(num_dots
, char);
441 memcpy(ret
->dot_no_count
, sstate
->dot_no_count
, num_dots
);
443 ret
->face_yes_count
= snewn(num_faces
, char);
444 memcpy(ret
->face_yes_count
, sstate
->face_yes_count
, num_faces
);
445 ret
->face_no_count
= snewn(num_faces
, char);
446 memcpy(ret
->face_no_count
, sstate
->face_no_count
, num_faces
);
448 if (sstate
->dlines
) {
449 ret
->dlines
= snewn(2*num_edges
, char);
450 memcpy(ret
->dlines
, sstate
->dlines
,
456 if (sstate
->linedsf
) {
457 ret
->linedsf
= snewn(num_edges
, int);
458 memcpy(ret
->linedsf
, sstate
->linedsf
,
459 num_edges
* sizeof(int));
467 static game_params
*default_params(void)
469 game_params
*ret
= snew(game_params
);
478 ret
->diff
= DIFF_EASY
;
485 static game_params
*dup_params(game_params
*params
)
487 game_params
*ret
= snew(game_params
);
489 *ret
= *params
; /* structure copy */
493 static const game_params presets
[] = {
495 { 7, 7, DIFF_EASY
, 0, 0 },
496 { 7, 7, DIFF_NORMAL
, 0, 0 },
497 { 7, 7, DIFF_HARD
, 0, 0 },
498 { 7, 7, DIFF_HARD
, 1, 0 },
499 { 7, 7, DIFF_HARD
, 2, 0 },
500 { 5, 5, DIFF_HARD
, 3, 0 },
501 { 7, 7, DIFF_HARD
, 4, 0 },
502 { 5, 4, DIFF_HARD
, 5, 0 },
503 { 5, 5, DIFF_HARD
, 6, 0 },
504 { 5, 5, DIFF_HARD
, 7, 0 },
505 { 3, 3, DIFF_HARD
, 8, 0 },
506 { 3, 3, DIFF_HARD
, 8, 1 },
507 { 3, 3, DIFF_HARD
, 9, 0 },
508 { 3, 3, DIFF_HARD
, 10, 0 },
509 { 6, 6, DIFF_HARD
, 11, 0 },
510 { 6, 6, DIFF_HARD
, 12, 0 },
512 { 7, 7, DIFF_EASY
, 0, 0 },
513 { 10, 10, DIFF_EASY
, 0, 0 },
514 { 7, 7, DIFF_NORMAL
, 0, 0 },
515 { 10, 10, DIFF_NORMAL
, 0, 0 },
516 { 7, 7, DIFF_HARD
, 0, 0 },
517 { 10, 10, DIFF_HARD
, 0, 0 },
518 { 10, 10, DIFF_HARD
, 1, 0 },
519 { 12, 10, DIFF_HARD
, 2, 0 },
520 { 7, 7, DIFF_HARD
, 3, 0 },
521 { 9, 9, DIFF_HARD
, 4, 0 },
522 { 5, 4, DIFF_HARD
, 5, 0 },
523 { 7, 7, DIFF_HARD
, 6, 0 },
524 { 5, 5, DIFF_HARD
, 7, 0 },
525 { 5, 5, DIFF_HARD
, 8, 0 },
526 { 5, 5, DIFF_HARD
, 8, 1 },
527 { 5, 4, DIFF_HARD
, 9, 0 },
528 { 5, 4, DIFF_HARD
, 10, 0 },
529 { 10, 10, DIFF_HARD
, 11, 0 },
530 { 10, 10, DIFF_HARD
, 12, 0 }
534 static int game_fetch_preset(int i
, char **name
, game_params
**params
)
539 if (i
< 0 || i
>= lenof(presets
))
542 tmppar
= snew(game_params
);
543 *tmppar
= presets
[i
];
545 sprintf(buf
, "%dx%d %s %s- %s", tmppar
->h
, tmppar
->w
,
546 gridnames
[tmppar
->type
], dualnames
[tmppar
->dual
],
547 diffnames
[tmppar
->diff
]);
553 static void free_params(game_params
*params
)
558 static void decode_params(game_params
*params
, char const *string
)
560 debug(("Decoding params '%s'\n",string
));
561 params
->h
= params
->w
= atoi(string
);
562 params
->diff
= DIFF_EASY
;
564 while (*string
&& isdigit((unsigned char)*string
)) string
++;
565 if (*string
== 'x') {
567 params
->h
= atoi(string
);
568 while (*string
&& isdigit((unsigned char)*string
)) string
++;
570 if (*string
== 't') {
572 params
->type
= atoi(string
);
573 while (*string
&& isdigit((unsigned char)*string
)) string
++;
575 if (*string
== 'l') {
579 if (*string
== 'd') {
582 for (i
= 0; i
< DIFF_MAX
; i
++)
583 if (*string
== diffchars
[i
])
585 if (*string
) string
++;
589 static char *encode_params(game_params
*params
, int full
)
592 sprintf(str
, "%dx%dt%d%s", params
->w
, params
->h
, params
->type
,
593 params
->dual ?
"l" : "");
595 sprintf(str
+ strlen(str
), "d%c", diffchars
[params
->diff
]);
596 debug(("Encoded to '%s'\n",str
));
600 static config_item
*game_configure(game_params
*params
)
605 ret
= snewn(6, config_item
);
607 ret
[0].name
= "Width";
608 ret
[0].type
= C_STRING
;
609 sprintf(buf
, "%d", params
->w
);
610 ret
[0].sval
= dupstr(buf
);
613 ret
[1].name
= "Height";
614 ret
[1].type
= C_STRING
;
615 sprintf(buf
, "%d", params
->h
);
616 ret
[1].sval
= dupstr(buf
);
619 ret
[2].name
= "Grid type";
620 ret
[2].type
= C_CHOICES
;
621 ret
[2].sval
= GRID_CONFIGS
;
622 ret
[2].ival
= params
->type
;
624 ret
[3].name
= "Difficulty";
625 ret
[3].type
= C_CHOICES
;
626 ret
[3].sval
= DIFFCONFIG
;
627 ret
[3].ival
= params
->diff
;
629 ret
[4].name
= "Dual";
630 ret
[4].type
= C_BOOLEAN
;
632 ret
[4].ival
= params
->dual
;
642 static game_params
*custom_params(config_item
*cfg
)
644 game_params
*ret
= snew(game_params
);
646 ret
->w
= atoi(cfg
[0].sval
);
647 ret
->h
= atoi(cfg
[1].sval
);
648 ret
->type
= cfg
[2].ival
;
649 ret
->diff
= cfg
[3].ival
;
650 ret
->dual
= cfg
[4].ival
;
655 static char *validate_params(game_params
*params
, int full
)
657 if (params
->type
< 0 || params
->type
>= NUM_GRID_TYPES
)
658 return "Illegal grid type";
659 if (params
->w
< grid_size_limits
[params
->type
].amin
||
660 params
->h
< grid_size_limits
[params
->type
].amin
)
661 return grid_size_limits
[params
->type
].aerr
;
662 if (params
->w
< grid_size_limits
[params
->type
].omin
&&
663 params
->h
< grid_size_limits
[params
->type
].omin
)
664 return grid_size_limits
[params
->type
].oerr
;
667 * This shouldn't be able to happen at all, since decode_params
668 * and custom_params will never generate anything that isn't
671 assert(params
->diff
< DIFF_MAX
);
676 /* Returns a newly allocated string describing the current puzzle */
677 static char *state_to_text(const game_state
*state
)
679 grid
*g
= state
->game_grid
;
681 int num_faces
= g
->num_faces
;
682 char *description
= snewn(num_faces
+ 1, char);
683 char *dp
= description
;
687 for (i
= 0; i
< num_faces
; i
++) {
688 if (state
->clues
[i
] < 0) {
689 if (empty_count
> 25) {
690 dp
+= sprintf(dp
, "%c", (int)(empty_count
+ 'a' - 1));
696 dp
+= sprintf(dp
, "%c", (int)(empty_count
+ 'a' - 1));
699 dp
+= sprintf(dp
, "%c", (int)CLUE2CHAR(state
->clues
[i
]));
704 dp
+= sprintf(dp
, "%c", (int)(empty_count
+ 'a' - 1));
706 retval
= dupstr(description
);
712 #define GRID_DESC_SEP '_'
714 /* Splits up a (optional) grid_desc from the game desc. Returns the
715 * grid_desc (which needs freeing) and updates the desc pointer to
716 * start of real desc, or returns NULL if no desc. */
717 static char *extract_grid_desc(char **desc
)
719 char *sep
= strchr(*desc
, GRID_DESC_SEP
), *gd
;
722 if (!sep
) return NULL
;
724 gd_len
= sep
- (*desc
);
725 gd
= snewn(gd_len
+1, char);
726 memcpy(gd
, *desc
, gd_len
);
734 /* We require that the params pass the test in validate_params and that the
735 * description fills the entire game area */
736 static char *validate_desc(game_params
*params
, char *desc
)
740 char *grid_desc
, *ret
;
742 /* It's pretty inefficient to do this just for validation. All we need to
743 * know is the precise number of faces. */
744 grid_desc
= extract_grid_desc(&desc
);
745 ret
= grid_validate_desc(grid_types
[params
->type
], params
->w
, params
->h
, params
->dual
, grid_desc
);
748 g
= loopy_generate_grid(params
, grid_desc
);
749 if (grid_desc
) sfree(grid_desc
);
751 debug(("Validating '%s' type %d %dx%d dual: %d\n",
752 desc
, params
->type
, params
->w
, params
->h
, params
->dual
));
754 for (; *desc
; ++desc
) {
755 if ((*desc
>= '0' && *desc
<= '9') || (*desc
>= 'A' && *desc
<= 'Z')) {
760 count
+= *desc
- 'a' + 1;
763 return "Unknown character in description";
766 if (count
< g
->num_faces
)
767 return "Description too short for board size";
768 if (count
> g
->num_faces
)
769 return "Description too long for board size";
776 /* Sums the lengths of the numbers in range [0,n) */
777 /* See equivalent function in solo.c for justification of this. */
778 static int len_0_to_n(int n
)
780 int len
= 1; /* Counting 0 as a bit of a special case */
783 for (i
= 1; i
< n
; i
*= 10) {
784 len
+= max(n
- i
, 0);
790 static char *encode_solve_move(const game_state
*state
)
795 int num_edges
= state
->game_grid
->num_edges
;
797 /* This is going to return a string representing the moves needed to set
798 * every line in a grid to be the same as the ones in 'state'. The exact
799 * length of this string is predictable. */
801 len
= 1; /* Count the 'S' prefix */
802 /* Numbers in all lines */
803 len
+= len_0_to_n(num_edges
);
804 /* For each line we also have a letter */
807 ret
= snewn(len
+ 1, char);
810 p
+= sprintf(p
, "S");
812 for (i
= 0; i
< num_edges
; i
++) {
813 switch (state
->lines
[i
]) {
815 p
+= sprintf(p
, "%dy", i
);
818 p
+= sprintf(p
, "%dn", i
);
823 /* No point in doing sums like that if they're going to be wrong */
824 assert(strlen(ret
) <= (size_t)len
);
828 static game_ui
*new_ui(game_state
*state
)
833 static void free_ui(game_ui
*ui
)
837 static char *encode_ui(game_ui
*ui
)
842 static void decode_ui(game_ui
*ui
, char *encoding
)
846 static void game_changed_state(game_ui
*ui
, game_state
*oldstate
,
847 game_state
*newstate
)
851 static void game_compute_size(game_params
*params
, int tilesize
,
854 int grid_width
, grid_height
, rendered_width
, rendered_height
;
857 grid_compute_size(grid_types
[params
->type
], params
->w
, params
->h
,
858 &g_tilesize
, &grid_width
, &grid_height
);
860 /* multiply first to minimise rounding error on integer division */
861 rendered_width
= grid_width
* tilesize
/ g_tilesize
;
862 rendered_height
= grid_height
* tilesize
/ g_tilesize
;
863 *x
= rendered_width
+ 2 * BORDER(tilesize
) + 1;
864 *y
= rendered_height
+ 2 * BORDER(tilesize
) + 1;
867 static void game_set_size(drawing
*dr
, game_drawstate
*ds
,
868 game_params
*params
, int tilesize
)
870 ds
->tilesize
= tilesize
;
873 static float *game_colours(frontend
*fe
, int *ncolours
)
875 float *ret
= snewn(4 * NCOLOURS
, float);
877 frontend_default_colour(fe
, &ret
[COL_BACKGROUND
* 3]);
879 ret
[COL_FOREGROUND
* 3 + 0] = 0.0F
;
880 ret
[COL_FOREGROUND
* 3 + 1] = 0.0F
;
881 ret
[COL_FOREGROUND
* 3 + 2] = 0.0F
;
884 * We want COL_LINEUNKNOWN to be a yellow which is a bit darker
885 * than the background. (I previously set it to 0.8,0.8,0, but
886 * found that this went badly with the 0.8,0.8,0.8 favoured as a
887 * background by the Java frontend.)
889 ret
[COL_LINEUNKNOWN
* 3 + 0] = ret
[COL_BACKGROUND
* 3 + 0] * 0.9F
;
890 ret
[COL_LINEUNKNOWN
* 3 + 1] = ret
[COL_BACKGROUND
* 3 + 1] * 0.9F
;
891 ret
[COL_LINEUNKNOWN
* 3 + 2] = 0.0F
;
893 ret
[COL_HIGHLIGHT
* 3 + 0] = 1.0F
;
894 ret
[COL_HIGHLIGHT
* 3 + 1] = 1.0F
;
895 ret
[COL_HIGHLIGHT
* 3 + 2] = 1.0F
;
897 ret
[COL_MISTAKE
* 3 + 0] = 1.0F
;
898 ret
[COL_MISTAKE
* 3 + 1] = 0.0F
;
899 ret
[COL_MISTAKE
* 3 + 2] = 0.0F
;
901 ret
[COL_SATISFIED
* 3 + 0] = 0.0F
;
902 ret
[COL_SATISFIED
* 3 + 1] = 0.0F
;
903 ret
[COL_SATISFIED
* 3 + 2] = 0.0F
;
905 /* We want the faint lines to be a bit darker than the background.
906 * Except if the background is pretty dark already; then it ought to be a
907 * bit lighter. Oy vey.
909 ret
[COL_FAINT
* 3 + 0] = ret
[COL_BACKGROUND
* 3 + 0] * 0.9F
;
910 ret
[COL_FAINT
* 3 + 1] = ret
[COL_BACKGROUND
* 3 + 1] * 0.9F
;
911 ret
[COL_FAINT
* 3 + 2] = ret
[COL_BACKGROUND
* 3 + 2] * 0.9F
;
913 *ncolours
= NCOLOURS
;
917 static game_drawstate
*game_new_drawstate(drawing
*dr
, game_state
*state
)
919 struct game_drawstate
*ds
= snew(struct game_drawstate
);
920 int num_faces
= state
->game_grid
->num_faces
;
921 int num_edges
= state
->game_grid
->num_edges
;
926 ds
->lines
= snewn(num_edges
, char);
927 ds
->clue_error
= snewn(num_faces
, char);
928 ds
->clue_satisfied
= snewn(num_faces
, char);
929 ds
->textx
= snewn(num_faces
, int);
930 ds
->texty
= snewn(num_faces
, int);
933 memset(ds
->lines
, LINE_UNKNOWN
, num_edges
);
934 memset(ds
->clue_error
, 0, num_faces
);
935 memset(ds
->clue_satisfied
, 0, num_faces
);
936 for (i
= 0; i
< num_faces
; i
++)
937 ds
->textx
[i
] = ds
->texty
[i
] = -1;
942 static void game_free_drawstate(drawing
*dr
, game_drawstate
*ds
)
946 sfree(ds
->clue_error
);
947 sfree(ds
->clue_satisfied
);
952 static int game_timing_state(game_state
*state
, game_ui
*ui
)
957 static float game_anim_length(game_state
*oldstate
, game_state
*newstate
,
958 int dir
, game_ui
*ui
)
963 static int game_can_format_as_text_now(game_params
*params
)
965 if (params
->type
!= 0)
970 static char *game_text_format(game_state
*state
)
976 grid
*g
= state
->game_grid
;
979 assert(state
->grid_type
== 0);
981 /* Work out the basic size unit */
982 f
= g
->faces
; /* first face */
983 assert(f
->order
== 4);
984 /* The dots are ordered clockwise, so the two opposite
985 * corners are guaranteed to span the square */
986 cell_size
= abs(f
->dots
[0]->x
- f
->dots
[2]->x
);
988 w
= (g
->highest_x
- g
->lowest_x
) / cell_size
;
989 h
= (g
->highest_y
- g
->lowest_y
) / cell_size
;
991 /* Create a blank "canvas" to "draw" on */
994 ret
= snewn(W
* H
+ 1, char);
995 for (y
= 0; y
< H
; y
++) {
996 for (x
= 0; x
< W
-1; x
++) {
999 ret
[y
*W
+ W
-1] = '\n';
1003 /* Fill in edge info */
1004 for (i
= 0; i
< g
->num_edges
; i
++) {
1005 grid_edge
*e
= g
->edges
+ i
;
1006 /* Cell coordinates, from (0,0) to (w-1,h-1) */
1007 int x1
= (e
->dot1
->x
- g
->lowest_x
) / cell_size
;
1008 int x2
= (e
->dot2
->x
- g
->lowest_x
) / cell_size
;
1009 int y1
= (e
->dot1
->y
- g
->lowest_y
) / cell_size
;
1010 int y2
= (e
->dot2
->y
- g
->lowest_y
) / cell_size
;
1011 /* Midpoint, in canvas coordinates (canvas coordinates are just twice
1012 * cell coordinates) */
1015 switch (state
->lines
[i
]) {
1017 ret
[y
*W
+ x
] = (y1
== y2
) ?
'-' : '|';
1023 break; /* already a space */
1025 assert(!"Illegal line state");
1030 for (i
= 0; i
< g
->num_faces
; i
++) {
1034 assert(f
->order
== 4);
1035 /* Cell coordinates, from (0,0) to (w-1,h-1) */
1036 x1
= (f
->dots
[0]->x
- g
->lowest_x
) / cell_size
;
1037 x2
= (f
->dots
[2]->x
- g
->lowest_x
) / cell_size
;
1038 y1
= (f
->dots
[0]->y
- g
->lowest_y
) / cell_size
;
1039 y2
= (f
->dots
[2]->y
- g
->lowest_y
) / cell_size
;
1040 /* Midpoint, in canvas coordinates */
1043 ret
[y
*W
+ x
] = CLUE2CHAR(state
->clues
[i
]);
1048 /* ----------------------------------------------------------------------
1053 static void check_caches(const solver_state
* sstate
)
1056 const game_state
*state
= sstate
->state
;
1057 const grid
*g
= state
->game_grid
;
1059 for (i
= 0; i
< g
->num_dots
; i
++) {
1060 assert(dot_order(state
, i
, LINE_YES
) == sstate
->dot_yes_count
[i
]);
1061 assert(dot_order(state
, i
, LINE_NO
) == sstate
->dot_no_count
[i
]);
1064 for (i
= 0; i
< g
->num_faces
; i
++) {
1065 assert(face_order(state
, i
, LINE_YES
) == sstate
->face_yes_count
[i
]);
1066 assert(face_order(state
, i
, LINE_NO
) == sstate
->face_no_count
[i
]);
1071 #define check_caches(s) \
1073 fprintf(stderr, "check_caches at line %d\n", __LINE__); \
1077 #endif /* DEBUG_CACHES */
1079 /* ----------------------------------------------------------------------
1080 * Solver utility functions
1083 /* Sets the line (with index i) to the new state 'line_new', and updates
1084 * the cached counts of any affected faces and dots.
1085 * Returns TRUE if this actually changed the line's state. */
1086 static int solver_set_line(solver_state
*sstate
, int i
,
1087 enum line_state line_new
1089 , const char *reason
1093 game_state
*state
= sstate
->state
;
1097 assert(line_new
!= LINE_UNKNOWN
);
1099 check_caches(sstate
);
1101 if (state
->lines
[i
] == line_new
) {
1102 return FALSE
; /* nothing changed */
1104 state
->lines
[i
] = line_new
;
1107 fprintf(stderr
, "solver: set line [%d] to %s (%s)\n",
1108 i
, line_new
== LINE_YES ?
"YES" : "NO",
1112 g
= state
->game_grid
;
1115 /* Update the cache for both dots and both faces affected by this. */
1116 if (line_new
== LINE_YES
) {
1117 sstate
->dot_yes_count
[e
->dot1
- g
->dots
]++;
1118 sstate
->dot_yes_count
[e
->dot2
- g
->dots
]++;
1120 sstate
->face_yes_count
[e
->face1
- g
->faces
]++;
1123 sstate
->face_yes_count
[e
->face2
- g
->faces
]++;
1126 sstate
->dot_no_count
[e
->dot1
- g
->dots
]++;
1127 sstate
->dot_no_count
[e
->dot2
- g
->dots
]++;
1129 sstate
->face_no_count
[e
->face1
- g
->faces
]++;
1132 sstate
->face_no_count
[e
->face2
- g
->faces
]++;
1136 check_caches(sstate
);
1141 #define solver_set_line(a, b, c) \
1142 solver_set_line(a, b, c, __FUNCTION__)
1146 * Merge two dots due to the existence of an edge between them.
1147 * Updates the dsf tracking equivalence classes, and keeps track of
1148 * the length of path each dot is currently a part of.
1149 * Returns TRUE if the dots were already linked, ie if they are part of a
1150 * closed loop, and false otherwise.
1152 static int merge_dots(solver_state
*sstate
, int edge_index
)
1155 grid
*g
= sstate
->state
->game_grid
;
1156 grid_edge
*e
= g
->edges
+ edge_index
;
1158 i
= e
->dot1
- g
->dots
;
1159 j
= e
->dot2
- g
->dots
;
1161 i
= dsf_canonify(sstate
->dotdsf
, i
);
1162 j
= dsf_canonify(sstate
->dotdsf
, j
);
1167 len
= sstate
->looplen
[i
] + sstate
->looplen
[j
];
1168 dsf_merge(sstate
->dotdsf
, i
, j
);
1169 i
= dsf_canonify(sstate
->dotdsf
, i
);
1170 sstate
->looplen
[i
] = len
;
1175 /* Merge two lines because the solver has deduced that they must be either
1176 * identical or opposite. Returns TRUE if this is new information, otherwise
1178 static int merge_lines(solver_state
*sstate
, int i
, int j
, int inverse
1180 , const char *reason
1186 assert(i
< sstate
->state
->game_grid
->num_edges
);
1187 assert(j
< sstate
->state
->game_grid
->num_edges
);
1189 i
= edsf_canonify(sstate
->linedsf
, i
, &inv_tmp
);
1191 j
= edsf_canonify(sstate
->linedsf
, j
, &inv_tmp
);
1194 edsf_merge(sstate
->linedsf
, i
, j
, inverse
);
1198 fprintf(stderr
, "%s [%d] [%d] %s(%s)\n",
1200 inverse ?
"inverse " : "", reason
);
1207 #define merge_lines(a, b, c, d) \
1208 merge_lines(a, b, c, d, __FUNCTION__)
1211 /* Count the number of lines of a particular type currently going into the
1213 static int dot_order(const game_state
* state
, int dot
, char line_type
)
1216 grid
*g
= state
->game_grid
;
1217 grid_dot
*d
= g
->dots
+ dot
;
1220 for (i
= 0; i
< d
->order
; i
++) {
1221 grid_edge
*e
= d
->edges
[i
];
1222 if (state
->lines
[e
- g
->edges
] == line_type
)
1228 /* Count the number of lines of a particular type currently surrounding the
1230 static int face_order(const game_state
* state
, int face
, char line_type
)
1233 grid
*g
= state
->game_grid
;
1234 grid_face
*f
= g
->faces
+ face
;
1237 for (i
= 0; i
< f
->order
; i
++) {
1238 grid_edge
*e
= f
->edges
[i
];
1239 if (state
->lines
[e
- g
->edges
] == line_type
)
1245 /* Set all lines bordering a dot of type old_type to type new_type
1246 * Return value tells caller whether this function actually did anything */
1247 static int dot_setall(solver_state
*sstate
, int dot
,
1248 char old_type
, char new_type
)
1250 int retval
= FALSE
, r
;
1251 game_state
*state
= sstate
->state
;
1256 if (old_type
== new_type
)
1259 g
= state
->game_grid
;
1262 for (i
= 0; i
< d
->order
; i
++) {
1263 int line_index
= d
->edges
[i
] - g
->edges
;
1264 if (state
->lines
[line_index
] == old_type
) {
1265 r
= solver_set_line(sstate
, line_index
, new_type
);
1273 /* Set all lines bordering a face of type old_type to type new_type */
1274 static int face_setall(solver_state
*sstate
, int face
,
1275 char old_type
, char new_type
)
1277 int retval
= FALSE
, r
;
1278 game_state
*state
= sstate
->state
;
1283 if (old_type
== new_type
)
1286 g
= state
->game_grid
;
1287 f
= g
->faces
+ face
;
1289 for (i
= 0; i
< f
->order
; i
++) {
1290 int line_index
= f
->edges
[i
] - g
->edges
;
1291 if (state
->lines
[line_index
] == old_type
) {
1292 r
= solver_set_line(sstate
, line_index
, new_type
);
1300 /* ----------------------------------------------------------------------
1301 * Loop generation and clue removal
1304 static void add_full_clues(game_state
*state
, random_state
*rs
)
1306 signed char *clues
= state
->clues
;
1307 grid
*g
= state
->game_grid
;
1308 char *board
= snewn(g
->num_faces
, char);
1311 generate_loop(g
, board
, rs
, NULL
, NULL
);
1313 /* Fill out all the clues by initialising to 0, then iterating over
1314 * all edges and incrementing each clue as we find edges that border
1315 * between BLACK/WHITE faces. While we're at it, we verify that the
1316 * algorithm does work, and there aren't any GREY faces still there. */
1317 memset(clues
, 0, g
->num_faces
);
1318 for (i
= 0; i
< g
->num_edges
; i
++) {
1319 grid_edge
*e
= g
->edges
+ i
;
1320 grid_face
*f1
= e
->face1
;
1321 grid_face
*f2
= e
->face2
;
1322 enum face_colour c1
= FACE_COLOUR(f1
);
1323 enum face_colour c2
= FACE_COLOUR(f2
);
1324 assert(c1
!= FACE_GREY
);
1325 assert(c2
!= FACE_GREY
);
1327 if (f1
) clues
[f1
- g
->faces
]++;
1328 if (f2
) clues
[f2
- g
->faces
]++;
1335 static int game_has_unique_soln(const game_state
*state
, int diff
)
1338 solver_state
*sstate_new
;
1339 solver_state
*sstate
= new_solver_state((game_state
*)state
, diff
);
1341 sstate_new
= solve_game_rec(sstate
);
1343 assert(sstate_new
->solver_status
!= SOLVER_MISTAKE
);
1344 ret
= (sstate_new
->solver_status
== SOLVER_SOLVED
);
1346 free_solver_state(sstate_new
);
1347 free_solver_state(sstate
);
1353 /* Remove clues one at a time at random. */
1354 static game_state
*remove_clues(game_state
*state
, random_state
*rs
,
1358 int num_faces
= state
->game_grid
->num_faces
;
1359 game_state
*ret
= dup_game(state
), *saved_ret
;
1362 /* We need to remove some clues. We'll do this by forming a list of all
1363 * available clues, shuffling it, then going along one at a
1364 * time clearing each clue in turn for which doing so doesn't render the
1365 * board unsolvable. */
1366 face_list
= snewn(num_faces
, int);
1367 for (n
= 0; n
< num_faces
; ++n
) {
1371 shuffle(face_list
, num_faces
, sizeof(int), rs
);
1373 for (n
= 0; n
< num_faces
; ++n
) {
1374 saved_ret
= dup_game(ret
);
1375 ret
->clues
[face_list
[n
]] = -1;
1377 if (game_has_unique_soln(ret
, diff
)) {
1378 free_game(saved_ret
);
1390 static char *new_game_desc(game_params
*params
, random_state
*rs
,
1391 char **aux
, int interactive
)
1393 /* solution and description both use run-length encoding in obvious ways */
1394 char *retval
, *game_desc
, *grid_desc
;
1396 game_state
*state
= snew(game_state
);
1397 game_state
*state_new
;
1399 grid_desc
= grid_new_desc(grid_types
[params
->type
], params
->w
, params
->h
, params
->dual
, rs
);
1400 state
->game_grid
= g
= loopy_generate_grid(params
, grid_desc
);
1402 state
->clues
= snewn(g
->num_faces
, signed char);
1403 state
->lines
= snewn(g
->num_edges
, char);
1404 state
->line_errors
= snewn(g
->num_edges
, unsigned char);
1406 state
->grid_type
= params
->type
;
1410 memset(state
->lines
, LINE_UNKNOWN
, g
->num_edges
);
1411 memset(state
->line_errors
, 0, g
->num_edges
);
1413 state
->solved
= state
->cheated
= FALSE
;
1415 /* Get a new random solvable board with all its clues filled in. Yes, this
1416 * can loop for ever if the params are suitably unfavourable, but
1417 * preventing games smaller than 4x4 seems to stop this happening */
1419 add_full_clues(state
, rs
);
1420 } while (!game_has_unique_soln(state
, params
->diff
));
1422 state_new
= remove_clues(state
, rs
, params
->diff
);
1427 if (params
->diff
> 0 && game_has_unique_soln(state
, params
->diff
-1)) {
1429 fprintf(stderr
, "Rejecting board, it is too easy\n");
1431 goto newboard_please
;
1434 game_desc
= state_to_text(state
);
1439 retval
= snewn(strlen(grid_desc
) + 1 + strlen(game_desc
) + 1, char);
1440 sprintf(retval
, "%s%c%s", grid_desc
, (int)GRID_DESC_SEP
, game_desc
);
1447 assert(!validate_desc(params
, retval
));
1452 static game_state
*new_game(midend
*me
, game_params
*params
, char *desc
)
1455 game_state
*state
= snew(game_state
);
1456 int empties_to_make
= 0;
1461 int num_faces
, num_edges
;
1463 grid_desc
= extract_grid_desc(&desc
);
1464 state
->game_grid
= g
= loopy_generate_grid(params
, grid_desc
);
1465 if (grid_desc
) sfree(grid_desc
);
1469 num_faces
= g
->num_faces
;
1470 num_edges
= g
->num_edges
;
1472 state
->clues
= snewn(num_faces
, signed char);
1473 state
->lines
= snewn(num_edges
, char);
1474 state
->line_errors
= snewn(num_edges
, unsigned char);
1476 state
->solved
= state
->cheated
= FALSE
;
1478 state
->grid_type
= params
->type
;
1480 for (i
= 0; i
< num_faces
; i
++) {
1481 if (empties_to_make
) {
1483 state
->clues
[i
] = -1;
1489 n2
= *dp
- 'A' + 10;
1490 if (n
>= 0 && n
< 10) {
1491 state
->clues
[i
] = n
;
1492 } else if (n2
>= 10 && n2
< 36) {
1493 state
->clues
[i
] = n2
;
1497 state
->clues
[i
] = -1;
1498 empties_to_make
= n
- 1;
1503 memset(state
->lines
, LINE_UNKNOWN
, num_edges
);
1504 memset(state
->line_errors
, 0, num_edges
);
1508 /* Calculates the line_errors data, and checks if the current state is a
1510 static int check_completion(game_state
*state
)
1512 grid
*g
= state
->game_grid
;
1514 int num_faces
= g
->num_faces
;
1516 int infinite_area
, finite_area
;
1517 int loops_found
= 0;
1518 int found_edge_not_in_loop
= FALSE
;
1520 memset(state
->line_errors
, 0, g
->num_edges
);
1522 /* LL implementation of SGT's idea:
1523 * A loop will partition the grid into an inside and an outside.
1524 * If there is more than one loop, the grid will be partitioned into
1525 * even more distinct regions. We can therefore track equivalence of
1526 * faces, by saying that two faces are equivalent when there is a non-YES
1527 * edge between them.
1528 * We could keep track of the number of connected components, by counting
1529 * the number of dsf-merges that aren't no-ops.
1530 * But we're only interested in 3 separate cases:
1531 * no loops, one loop, more than one loop.
1533 * No loops: all faces are equivalent to the infinite face.
1534 * One loop: only two equivalence classes - finite and infinite.
1535 * >= 2 loops: there are 2 distinct finite regions.
1537 * So we simply make two passes through all the edges.
1538 * In the first pass, we dsf-merge the two faces bordering each non-YES
1540 * In the second pass, we look for YES-edges bordering:
1541 * a) two non-equivalent faces.
1542 * b) two non-equivalent faces, and one of them is part of a different
1543 * finite area from the first finite area we've seen.
1545 * An occurrence of a) means there is at least one loop.
1546 * An occurrence of b) means there is more than one loop.
1547 * Edges satisfying a) are marked as errors.
1549 * While we're at it, we set a flag if we find a YES edge that is not
1551 * This information will help decide, if there's a single loop, whether it
1552 * is a candidate for being a solution (that is, all YES edges are part of
1555 * If there is a candidate loop, we then go through all clues and check
1556 * they are all satisfied. If so, we have found a solution and we can
1557 * unmark all line_errors.
1560 /* Infinite face is at the end - its index is num_faces.
1561 * This macro is just to make this obvious! */
1562 #define INF_FACE num_faces
1563 dsf
= snewn(num_faces
+ 1, int);
1564 dsf_init(dsf
, num_faces
+ 1);
1567 for (i
= 0; i
< g
->num_edges
; i
++) {
1568 grid_edge
*e
= g
->edges
+ i
;
1569 int f1
= e
->face1 ? e
->face1
- g
->faces
: INF_FACE
;
1570 int f2
= e
->face2 ? e
->face2
- g
->faces
: INF_FACE
;
1571 if (state
->lines
[i
] != LINE_YES
)
1572 dsf_merge(dsf
, f1
, f2
);
1576 infinite_area
= dsf_canonify(dsf
, INF_FACE
);
1578 for (i
= 0; i
< g
->num_edges
; i
++) {
1579 grid_edge
*e
= g
->edges
+ i
;
1580 int f1
= e
->face1 ? e
->face1
- g
->faces
: INF_FACE
;
1581 int can1
= dsf_canonify(dsf
, f1
);
1582 int f2
= e
->face2 ? e
->face2
- g
->faces
: INF_FACE
;
1583 int can2
= dsf_canonify(dsf
, f2
);
1584 if (state
->lines
[i
] != LINE_YES
) continue;
1587 /* Faces are equivalent, so this edge not part of a loop */
1588 found_edge_not_in_loop
= TRUE
;
1591 state
->line_errors
[i
] = TRUE
;
1592 if (loops_found
== 0) loops_found
= 1;
1594 /* Don't bother with further checks if we've already found 2 loops */
1595 if (loops_found
== 2) continue;
1597 if (finite_area
== -1) {
1598 /* Found our first finite area */
1599 if (can1
!= infinite_area
)
1605 /* Have we found a second area? */
1606 if (finite_area
!= -1) {
1607 if (can1
!= infinite_area
&& can1
!= finite_area
) {
1611 if (can2
!= infinite_area
&& can2
!= finite_area
) {
1618 printf("loops_found = %d\n", loops_found);
1619 printf("found_edge_not_in_loop = %s\n",
1620 found_edge_not_in_loop ? "TRUE" : "FALSE");
1623 sfree(dsf
); /* No longer need the dsf */
1625 /* Have we found a candidate loop? */
1626 if (loops_found
== 1 && !found_edge_not_in_loop
) {
1627 /* Yes, so check all clues are satisfied */
1628 int found_clue_violation
= FALSE
;
1629 for (i
= 0; i
< num_faces
; i
++) {
1630 int c
= state
->clues
[i
];
1632 if (face_order(state
, i
, LINE_YES
) != c
) {
1633 found_clue_violation
= TRUE
;
1639 if (!found_clue_violation
) {
1640 /* The loop is good */
1641 memset(state
->line_errors
, 0, g
->num_edges
);
1642 return TRUE
; /* No need to bother checking for dot violations */
1646 /* Check for dot violations */
1647 for (i
= 0; i
< g
->num_dots
; i
++) {
1648 int yes
= dot_order(state
, i
, LINE_YES
);
1649 int unknown
= dot_order(state
, i
, LINE_UNKNOWN
);
1650 if ((yes
== 1 && unknown
== 0) || (yes
>= 3)) {
1651 /* violation, so mark all YES edges as errors */
1652 grid_dot
*d
= g
->dots
+ i
;
1654 for (j
= 0; j
< d
->order
; j
++) {
1655 int e
= d
->edges
[j
] - g
->edges
;
1656 if (state
->lines
[e
] == LINE_YES
)
1657 state
->line_errors
[e
] = TRUE
;
1664 /* ----------------------------------------------------------------------
1667 * Our solver modes operate as follows. Each mode also uses the modes above it.
1670 * Just implement the rules of the game.
1672 * Normal and Tricky Modes
1673 * For each (adjacent) pair of lines through each dot we store a bit for
1674 * whether at least one of them is on and whether at most one is on. (If we
1675 * know both or neither is on that's already stored more directly.)
1678 * Use edsf data structure to make equivalence classes of lines that are
1679 * known identical to or opposite to one another.
1684 * For general grids, we consider "dlines" to be pairs of lines joined
1685 * at a dot. The lines must be adjacent around the dot, so we can think of
1686 * a dline as being a dot+face combination. Or, a dot+edge combination where
1687 * the second edge is taken to be the next clockwise edge from the dot.
1688 * Original loopy code didn't have this extra restriction of the lines being
1689 * adjacent. From my tests with square grids, this extra restriction seems to
1690 * take little, if anything, away from the quality of the puzzles.
1691 * A dline can be uniquely identified by an edge/dot combination, given that
1692 * a dline-pair always goes clockwise around its common dot. The edge/dot
1693 * combination can be represented by an edge/bool combination - if bool is
1694 * TRUE, use edge->dot1 else use edge->dot2. So the total number of dlines is
1695 * exactly twice the number of edges in the grid - although the dlines
1696 * spanning the infinite face are not all that useful to the solver.
1697 * Note that, by convention, a dline goes clockwise around its common dot,
1698 * which means the dline goes anti-clockwise around its common face.
1701 /* Helper functions for obtaining an index into an array of dlines, given
1702 * various information. We assume the grid layout conventions about how
1703 * the various lists are interleaved - see grid_make_consistent() for
1706 /* i points to the first edge of the dline pair, reading clockwise around
1708 static int dline_index_from_dot(grid
*g
, grid_dot
*d
, int i
)
1710 grid_edge
*e
= d
->edges
[i
];
1715 if (i2
== d
->order
) i2
= 0;
1718 ret
= 2 * (e
- g
->edges
) + ((e
->dot1
== d
) ?
1 : 0);
1720 printf("dline_index_from_dot: d=%d,i=%d, edges [%d,%d] - %d\n",
1721 (int)(d
- g
->dots
), i
, (int)(e
- g
->edges
),
1722 (int)(e2
- g
->edges
), ret
);
1726 /* i points to the second edge of the dline pair, reading clockwise around
1727 * the face. That is, the edges of the dline, starting at edge{i}, read
1728 * anti-clockwise around the face. By layout conventions, the common dot
1729 * of the dline will be f->dots[i] */
1730 static int dline_index_from_face(grid
*g
, grid_face
*f
, int i
)
1732 grid_edge
*e
= f
->edges
[i
];
1733 grid_dot
*d
= f
->dots
[i
];
1738 if (i2
< 0) i2
+= f
->order
;
1741 ret
= 2 * (e
- g
->edges
) + ((e
->dot1
== d
) ?
1 : 0);
1743 printf("dline_index_from_face: f=%d,i=%d, edges [%d,%d] - %d\n",
1744 (int)(f
- g
->faces
), i
, (int)(e
- g
->edges
),
1745 (int)(e2
- g
->edges
), ret
);
1749 static int is_atleastone(const char *dline_array
, int index
)
1751 return BIT_SET(dline_array
[index
], 0);
1753 static int set_atleastone(char *dline_array
, int index
)
1755 return SET_BIT(dline_array
[index
], 0);
1757 static int is_atmostone(const char *dline_array
, int index
)
1759 return BIT_SET(dline_array
[index
], 1);
1761 static int set_atmostone(char *dline_array
, int index
)
1763 return SET_BIT(dline_array
[index
], 1);
1766 static void array_setall(char *array
, char from
, char to
, int len
)
1768 char *p
= array
, *p_old
= p
;
1769 int len_remaining
= len
;
1771 while ((p
= memchr(p
, from
, len_remaining
))) {
1773 len_remaining
-= p
- p_old
;
1778 /* Helper, called when doing dline dot deductions, in the case where we
1779 * have 4 UNKNOWNs, and two of them (adjacent) have *exactly* one YES between
1780 * them (because of dline atmostone/atleastone).
1781 * On entry, edge points to the first of these two UNKNOWNs. This function
1782 * will find the opposite UNKNOWNS (if they are adjacent to one another)
1783 * and set their corresponding dline to atleastone. (Setting atmostone
1784 * already happens in earlier dline deductions) */
1785 static int dline_set_opp_atleastone(solver_state
*sstate
,
1786 grid_dot
*d
, int edge
)
1788 game_state
*state
= sstate
->state
;
1789 grid
*g
= state
->game_grid
;
1792 for (opp
= 0; opp
< N
; opp
++) {
1793 int opp_dline_index
;
1794 if (opp
== edge
|| opp
== edge
+1 || opp
== edge
-1)
1796 if (opp
== 0 && edge
== N
-1)
1798 if (opp
== N
-1 && edge
== 0)
1801 if (opp2
== N
) opp2
= 0;
1802 /* Check if opp, opp2 point to LINE_UNKNOWNs */
1803 if (state
->lines
[d
->edges
[opp
] - g
->edges
] != LINE_UNKNOWN
)
1805 if (state
->lines
[d
->edges
[opp2
] - g
->edges
] != LINE_UNKNOWN
)
1807 /* Found opposite UNKNOWNS and they're next to each other */
1808 opp_dline_index
= dline_index_from_dot(g
, d
, opp
);
1809 return set_atleastone(sstate
->dlines
, opp_dline_index
);
1815 /* Set pairs of lines around this face which are known to be identical, to
1816 * the given line_state */
1817 static int face_setall_identical(solver_state
*sstate
, int face_index
,
1818 enum line_state line_new
)
1820 /* can[dir] contains the canonical line associated with the line in
1821 * direction dir from the square in question. Similarly inv[dir] is
1822 * whether or not the line in question is inverse to its canonical
1825 game_state
*state
= sstate
->state
;
1826 grid
*g
= state
->game_grid
;
1827 grid_face
*f
= g
->faces
+ face_index
;
1830 int can1
, can2
, inv1
, inv2
;
1832 for (i
= 0; i
< N
; i
++) {
1833 int line1_index
= f
->edges
[i
] - g
->edges
;
1834 if (state
->lines
[line1_index
] != LINE_UNKNOWN
)
1836 for (j
= i
+ 1; j
< N
; j
++) {
1837 int line2_index
= f
->edges
[j
] - g
->edges
;
1838 if (state
->lines
[line2_index
] != LINE_UNKNOWN
)
1841 /* Found two UNKNOWNS */
1842 can1
= edsf_canonify(sstate
->linedsf
, line1_index
, &inv1
);
1843 can2
= edsf_canonify(sstate
->linedsf
, line2_index
, &inv2
);
1844 if (can1
== can2
&& inv1
== inv2
) {
1845 solver_set_line(sstate
, line1_index
, line_new
);
1846 solver_set_line(sstate
, line2_index
, line_new
);
1853 /* Given a dot or face, and a count of LINE_UNKNOWNs, find them and
1854 * return the edge indices into e. */
1855 static void find_unknowns(game_state
*state
,
1856 grid_edge
**edge_list
, /* Edge list to search (from a face or a dot) */
1857 int expected_count
, /* Number of UNKNOWNs (comes from solver's cache) */
1858 int *e
/* Returned edge indices */)
1861 grid
*g
= state
->game_grid
;
1862 while (c
< expected_count
) {
1863 int line_index
= *edge_list
- g
->edges
;
1864 if (state
->lines
[line_index
] == LINE_UNKNOWN
) {
1872 /* If we have a list of edges, and we know whether the number of YESs should
1873 * be odd or even, and there are only a few UNKNOWNs, we can do some simple
1874 * linedsf deductions. This can be used for both face and dot deductions.
1875 * Returns the difficulty level of the next solver that should be used,
1876 * or DIFF_MAX if no progress was made. */
1877 static int parity_deductions(solver_state
*sstate
,
1878 grid_edge
**edge_list
, /* Edge list (from a face or a dot) */
1879 int total_parity
, /* Expected number of YESs modulo 2 (either 0 or 1) */
1882 game_state
*state
= sstate
->state
;
1883 int diff
= DIFF_MAX
;
1884 int *linedsf
= sstate
->linedsf
;
1886 if (unknown_count
== 2) {
1887 /* Lines are known alike/opposite, depending on inv. */
1889 find_unknowns(state
, edge_list
, 2, e
);
1890 if (merge_lines(sstate
, e
[0], e
[1], total_parity
))
1891 diff
= min(diff
, DIFF_HARD
);
1892 } else if (unknown_count
== 3) {
1894 int can
[3]; /* canonical edges */
1895 int inv
[3]; /* whether can[x] is inverse to e[x] */
1896 find_unknowns(state
, edge_list
, 3, e
);
1897 can
[0] = edsf_canonify(linedsf
, e
[0], inv
);
1898 can
[1] = edsf_canonify(linedsf
, e
[1], inv
+1);
1899 can
[2] = edsf_canonify(linedsf
, e
[2], inv
+2);
1900 if (can
[0] == can
[1]) {
1901 if (solver_set_line(sstate
, e
[2], (total_parity
^inv
[0]^inv
[1]) ?
1902 LINE_YES
: LINE_NO
))
1903 diff
= min(diff
, DIFF_EASY
);
1905 if (can
[0] == can
[2]) {
1906 if (solver_set_line(sstate
, e
[1], (total_parity
^inv
[0]^inv
[2]) ?
1907 LINE_YES
: LINE_NO
))
1908 diff
= min(diff
, DIFF_EASY
);
1910 if (can
[1] == can
[2]) {
1911 if (solver_set_line(sstate
, e
[0], (total_parity
^inv
[1]^inv
[2]) ?
1912 LINE_YES
: LINE_NO
))
1913 diff
= min(diff
, DIFF_EASY
);
1915 } else if (unknown_count
== 4) {
1917 int can
[4]; /* canonical edges */
1918 int inv
[4]; /* whether can[x] is inverse to e[x] */
1919 find_unknowns(state
, edge_list
, 4, e
);
1920 can
[0] = edsf_canonify(linedsf
, e
[0], inv
);
1921 can
[1] = edsf_canonify(linedsf
, e
[1], inv
+1);
1922 can
[2] = edsf_canonify(linedsf
, e
[2], inv
+2);
1923 can
[3] = edsf_canonify(linedsf
, e
[3], inv
+3);
1924 if (can
[0] == can
[1]) {
1925 if (merge_lines(sstate
, e
[2], e
[3], total_parity
^inv
[0]^inv
[1]))
1926 diff
= min(diff
, DIFF_HARD
);
1927 } else if (can
[0] == can
[2]) {
1928 if (merge_lines(sstate
, e
[1], e
[3], total_parity
^inv
[0]^inv
[2]))
1929 diff
= min(diff
, DIFF_HARD
);
1930 } else if (can
[0] == can
[3]) {
1931 if (merge_lines(sstate
, e
[1], e
[2], total_parity
^inv
[0]^inv
[3]))
1932 diff
= min(diff
, DIFF_HARD
);
1933 } else if (can
[1] == can
[2]) {
1934 if (merge_lines(sstate
, e
[0], e
[3], total_parity
^inv
[1]^inv
[2]))
1935 diff
= min(diff
, DIFF_HARD
);
1936 } else if (can
[1] == can
[3]) {
1937 if (merge_lines(sstate
, e
[0], e
[2], total_parity
^inv
[1]^inv
[3]))
1938 diff
= min(diff
, DIFF_HARD
);
1939 } else if (can
[2] == can
[3]) {
1940 if (merge_lines(sstate
, e
[0], e
[1], total_parity
^inv
[2]^inv
[3]))
1941 diff
= min(diff
, DIFF_HARD
);
1949 * These are the main solver functions.
1951 * Their return values are diff values corresponding to the lowest mode solver
1952 * that would notice the work that they have done. For example if the normal
1953 * mode solver adds actual lines or crosses, it will return DIFF_EASY as the
1954 * easy mode solver might be able to make progress using that. It doesn't make
1955 * sense for one of them to return a diff value higher than that of the
1958 * Each function returns the lowest value it can, as early as possible, in
1959 * order to try and pass as much work as possible back to the lower level
1960 * solvers which progress more quickly.
1963 /* PROPOSED NEW DESIGN:
1964 * We have a work queue consisting of 'events' notifying us that something has
1965 * happened that a particular solver mode might be interested in. For example
1966 * the hard mode solver might do something that helps the normal mode solver at
1967 * dot [x,y] in which case it will enqueue an event recording this fact. Then
1968 * we pull events off the work queue, and hand each in turn to the solver that
1969 * is interested in them. If a solver reports that it failed we pass the same
1970 * event on to progressively more advanced solvers and the loop detector. Once
1971 * we've exhausted an event, or it has helped us progress, we drop it and
1972 * continue to the next one. The events are sorted first in order of solver
1973 * complexity (easy first) then order of insertion (oldest first).
1974 * Once we run out of events we loop over each permitted solver in turn
1975 * (easiest first) until either a deduction is made (and an event therefore
1976 * emerges) or no further deductions can be made (in which case we've failed).
1979 * * How do we 'loop over' a solver when both dots and squares are concerned.
1980 * Answer: first all squares then all dots.
1983 static int trivial_deductions(solver_state
*sstate
)
1985 int i
, current_yes
, current_no
;
1986 game_state
*state
= sstate
->state
;
1987 grid
*g
= state
->game_grid
;
1988 int diff
= DIFF_MAX
;
1990 /* Per-face deductions */
1991 for (i
= 0; i
< g
->num_faces
; i
++) {
1992 grid_face
*f
= g
->faces
+ i
;
1994 if (sstate
->face_solved
[i
])
1997 current_yes
= sstate
->face_yes_count
[i
];
1998 current_no
= sstate
->face_no_count
[i
];
2000 if (current_yes
+ current_no
== f
->order
) {
2001 sstate
->face_solved
[i
] = TRUE
;
2005 if (state
->clues
[i
] < 0)
2009 * This code checks whether the numeric clue on a face is so
2010 * large as to permit all its remaining LINE_UNKNOWNs to be
2011 * filled in as LINE_YES, or alternatively so small as to
2012 * permit them all to be filled in as LINE_NO.
2015 if (state
->clues
[i
] < current_yes
) {
2016 sstate
->solver_status
= SOLVER_MISTAKE
;
2019 if (state
->clues
[i
] == current_yes
) {
2020 if (face_setall(sstate
, i
, LINE_UNKNOWN
, LINE_NO
))
2021 diff
= min(diff
, DIFF_EASY
);
2022 sstate
->face_solved
[i
] = TRUE
;
2026 if (f
->order
- state
->clues
[i
] < current_no
) {
2027 sstate
->solver_status
= SOLVER_MISTAKE
;
2030 if (f
->order
- state
->clues
[i
] == current_no
) {
2031 if (face_setall(sstate
, i
, LINE_UNKNOWN
, LINE_YES
))
2032 diff
= min(diff
, DIFF_EASY
);
2033 sstate
->face_solved
[i
] = TRUE
;
2037 if (f
->order
- state
->clues
[i
] == current_no
+ 1 &&
2038 f
->order
- current_yes
- current_no
> 2) {
2040 * One small refinement to the above: we also look for any
2041 * adjacent pair of LINE_UNKNOWNs around the face with
2042 * some LINE_YES incident on it from elsewhere. If we find
2043 * one, then we know that pair of LINE_UNKNOWNs can't
2044 * _both_ be LINE_YES, and hence that pushes us one line
2045 * closer to being able to determine all the rest.
2047 int j
, k
, e1
, e2
, e
, d
;
2049 for (j
= 0; j
< f
->order
; j
++) {
2050 e1
= f
->edges
[j
] - g
->edges
;
2051 e2
= f
->edges
[j
+1 < f
->order ? j
+1 : 0] - g
->edges
;
2053 if (g
->edges
[e1
].dot1
== g
->edges
[e2
].dot1
||
2054 g
->edges
[e1
].dot1
== g
->edges
[e2
].dot2
) {
2055 d
= g
->edges
[e1
].dot1
- g
->dots
;
2057 assert(g
->edges
[e1
].dot2
== g
->edges
[e2
].dot1
||
2058 g
->edges
[e1
].dot2
== g
->edges
[e2
].dot2
);
2059 d
= g
->edges
[e1
].dot2
- g
->dots
;
2062 if (state
->lines
[e1
] == LINE_UNKNOWN
&&
2063 state
->lines
[e2
] == LINE_UNKNOWN
) {
2064 for (k
= 0; k
< g
->dots
[d
].order
; k
++) {
2065 int e
= g
->dots
[d
].edges
[k
] - g
->edges
;
2066 if (state
->lines
[e
] == LINE_YES
)
2067 goto found
; /* multi-level break */
2075 * If we get here, we've found such a pair of edges, and
2076 * they're e1 and e2.
2078 for (j
= 0; j
< f
->order
; j
++) {
2079 e
= f
->edges
[j
] - g
->edges
;
2080 if (state
->lines
[e
] == LINE_UNKNOWN
&& e
!= e1
&& e
!= e2
) {
2081 int r
= solver_set_line(sstate
, e
, LINE_YES
);
2083 diff
= min(diff
, DIFF_EASY
);
2089 check_caches(sstate
);
2091 /* Per-dot deductions */
2092 for (i
= 0; i
< g
->num_dots
; i
++) {
2093 grid_dot
*d
= g
->dots
+ i
;
2094 int yes
, no
, unknown
;
2096 if (sstate
->dot_solved
[i
])
2099 yes
= sstate
->dot_yes_count
[i
];
2100 no
= sstate
->dot_no_count
[i
];
2101 unknown
= d
->order
- yes
- no
;
2105 sstate
->dot_solved
[i
] = TRUE
;
2106 } else if (unknown
== 1) {
2107 dot_setall(sstate
, i
, LINE_UNKNOWN
, LINE_NO
);
2108 diff
= min(diff
, DIFF_EASY
);
2109 sstate
->dot_solved
[i
] = TRUE
;
2111 } else if (yes
== 1) {
2113 sstate
->solver_status
= SOLVER_MISTAKE
;
2115 } else if (unknown
== 1) {
2116 dot_setall(sstate
, i
, LINE_UNKNOWN
, LINE_YES
);
2117 diff
= min(diff
, DIFF_EASY
);
2119 } else if (yes
== 2) {
2121 dot_setall(sstate
, i
, LINE_UNKNOWN
, LINE_NO
);
2122 diff
= min(diff
, DIFF_EASY
);
2124 sstate
->dot_solved
[i
] = TRUE
;
2126 sstate
->solver_status
= SOLVER_MISTAKE
;
2131 check_caches(sstate
);
2136 static int dline_deductions(solver_state
*sstate
)
2138 game_state
*state
= sstate
->state
;
2139 grid
*g
= state
->game_grid
;
2140 char *dlines
= sstate
->dlines
;
2142 int diff
= DIFF_MAX
;
2144 /* ------ Face deductions ------ */
2146 /* Given a set of dline atmostone/atleastone constraints, need to figure
2147 * out if we can deduce any further info. For more general faces than
2148 * squares, this turns out to be a tricky problem.
2149 * The approach taken here is to define (per face) NxN matrices:
2150 * "maxs" and "mins".
2151 * The entries maxs(j,k) and mins(j,k) define the upper and lower limits
2152 * for the possible number of edges that are YES between positions j and k
2153 * going clockwise around the face. Can think of j and k as marking dots
2154 * around the face (recall the labelling scheme: edge0 joins dot0 to dot1,
2155 * edge1 joins dot1 to dot2 etc).
2156 * Trivially, mins(j,j) = maxs(j,j) = 0, and we don't even bother storing
2157 * these. mins(j,j+1) and maxs(j,j+1) are determined by whether edge{j}
2158 * is YES, NO or UNKNOWN. mins(j,j+2) and maxs(j,j+2) are related to
2159 * the dline atmostone/atleastone status for edges j and j+1.
2161 * Then we calculate the remaining entries recursively. We definitely
2163 * mins(j,k) >= { mins(j,u) + mins(u,k) } for any u between j and k.
2164 * This is because any valid placement of YESs between j and k must give
2165 * a valid placement between j and u, and also between u and k.
2166 * I believe it's sufficient to use just the two values of u:
2167 * j+1 and j+2. Seems to work well in practice - the bounds we compute
2168 * are rigorous, even if they might not be best-possible.
2170 * Once we have maxs and mins calculated, we can make inferences about
2171 * each dline{j,j+1} by looking at the possible complementary edge-counts
2172 * mins(j+2,j) and maxs(j+2,j) and comparing these with the face clue.
2173 * As well as dlines, we can make similar inferences about single edges.
2174 * For example, consider a pentagon with clue 3, and we know at most one
2175 * of (edge0, edge1) is YES, and at most one of (edge2, edge3) is YES.
2176 * We could then deduce edge4 is YES, because maxs(0,4) would be 2, so
2177 * that final edge would have to be YES to make the count up to 3.
2180 /* Much quicker to allocate arrays on the stack than the heap, so
2181 * define the largest possible face size, and base our array allocations
2182 * on that. We check this with an assertion, in case someone decides to
2183 * make a grid which has larger faces than this. Note, this algorithm
2184 * could get quite expensive if there are many large faces. */
2185 #define MAX_FACE_SIZE 12
2187 for (i
= 0; i
< g
->num_faces
; i
++) {
2188 int maxs
[MAX_FACE_SIZE
][MAX_FACE_SIZE
];
2189 int mins
[MAX_FACE_SIZE
][MAX_FACE_SIZE
];
2190 grid_face
*f
= g
->faces
+ i
;
2193 int clue
= state
->clues
[i
];
2194 assert(N
<= MAX_FACE_SIZE
);
2195 if (sstate
->face_solved
[i
])
2197 if (clue
< 0) continue;
2199 /* Calculate the (j,j+1) entries */
2200 for (j
= 0; j
< N
; j
++) {
2201 int edge_index
= f
->edges
[j
] - g
->edges
;
2203 enum line_state line1
= state
->lines
[edge_index
];
2204 enum line_state line2
;
2208 maxs
[j
][k
] = (line1
== LINE_NO
) ?
0 : 1;
2209 mins
[j
][k
] = (line1
== LINE_YES
) ?
1 : 0;
2210 /* Calculate the (j,j+2) entries */
2211 dline_index
= dline_index_from_face(g
, f
, k
);
2212 edge_index
= f
->edges
[k
] - g
->edges
;
2213 line2
= state
->lines
[edge_index
];
2219 if (line1
== LINE_NO
) tmp
--;
2220 if (line2
== LINE_NO
) tmp
--;
2221 if (tmp
== 2 && is_atmostone(dlines
, dline_index
))
2227 if (line1
== LINE_YES
) tmp
++;
2228 if (line2
== LINE_YES
) tmp
++;
2229 if (tmp
== 0 && is_atleastone(dlines
, dline_index
))
2234 /* Calculate the (j,j+m) entries for m between 3 and N-1 */
2235 for (m
= 3; m
< N
; m
++) {
2236 for (j
= 0; j
< N
; j
++) {
2244 maxs
[j
][k
] = maxs
[j
][u
] + maxs
[u
][k
];
2245 mins
[j
][k
] = mins
[j
][u
] + mins
[u
][k
];
2246 tmp
= maxs
[j
][v
] + maxs
[v
][k
];
2247 maxs
[j
][k
] = min(maxs
[j
][k
], tmp
);
2248 tmp
= mins
[j
][v
] + mins
[v
][k
];
2249 mins
[j
][k
] = max(mins
[j
][k
], tmp
);
2253 /* See if we can make any deductions */
2254 for (j
= 0; j
< N
; j
++) {
2256 grid_edge
*e
= f
->edges
[j
];
2257 int line_index
= e
- g
->edges
;
2260 if (state
->lines
[line_index
] != LINE_UNKNOWN
)
2265 /* minimum YESs in the complement of this edge */
2266 if (mins
[k
][j
] > clue
) {
2267 sstate
->solver_status
= SOLVER_MISTAKE
;
2270 if (mins
[k
][j
] == clue
) {
2271 /* setting this edge to YES would make at least
2272 * (clue+1) edges - contradiction */
2273 solver_set_line(sstate
, line_index
, LINE_NO
);
2274 diff
= min(diff
, DIFF_EASY
);
2276 if (maxs
[k
][j
] < clue
- 1) {
2277 sstate
->solver_status
= SOLVER_MISTAKE
;
2280 if (maxs
[k
][j
] == clue
- 1) {
2281 /* Only way to satisfy the clue is to set edge{j} as YES */
2282 solver_set_line(sstate
, line_index
, LINE_YES
);
2283 diff
= min(diff
, DIFF_EASY
);
2286 /* More advanced deduction that allows propagation along diagonal
2287 * chains of faces connected by dots, for example, 3-2-...-2-3
2288 * in square grids. */
2289 if (sstate
->diff
>= DIFF_TRICKY
) {
2290 /* Now see if we can make dline deduction for edges{j,j+1} */
2292 if (state
->lines
[e
- g
->edges
] != LINE_UNKNOWN
)
2293 /* Only worth doing this for an UNKNOWN,UNKNOWN pair.
2294 * Dlines where one of the edges is known, are handled in the
2298 dline_index
= dline_index_from_face(g
, f
, k
);
2302 /* minimum YESs in the complement of this dline */
2303 if (mins
[k
][j
] > clue
- 2) {
2304 /* Adding 2 YESs would break the clue */
2305 if (set_atmostone(dlines
, dline_index
))
2306 diff
= min(diff
, DIFF_NORMAL
);
2308 /* maximum YESs in the complement of this dline */
2309 if (maxs
[k
][j
] < clue
) {
2310 /* Adding 2 NOs would mean not enough YESs */
2311 if (set_atleastone(dlines
, dline_index
))
2312 diff
= min(diff
, DIFF_NORMAL
);
2318 if (diff
< DIFF_NORMAL
)
2321 /* ------ Dot deductions ------ */
2323 for (i
= 0; i
< g
->num_dots
; i
++) {
2324 grid_dot
*d
= g
->dots
+ i
;
2326 int yes
, no
, unknown
;
2328 if (sstate
->dot_solved
[i
])
2330 yes
= sstate
->dot_yes_count
[i
];
2331 no
= sstate
->dot_no_count
[i
];
2332 unknown
= N
- yes
- no
;
2334 for (j
= 0; j
< N
; j
++) {
2337 int line1_index
, line2_index
;
2338 enum line_state line1
, line2
;
2341 dline_index
= dline_index_from_dot(g
, d
, j
);
2342 line1_index
= d
->edges
[j
] - g
->edges
;
2343 line2_index
= d
->edges
[k
] - g
->edges
;
2344 line1
= state
->lines
[line1_index
];
2345 line2
= state
->lines
[line2_index
];
2347 /* Infer dline state from line state */
2348 if (line1
== LINE_NO
|| line2
== LINE_NO
) {
2349 if (set_atmostone(dlines
, dline_index
))
2350 diff
= min(diff
, DIFF_NORMAL
);
2352 if (line1
== LINE_YES
|| line2
== LINE_YES
) {
2353 if (set_atleastone(dlines
, dline_index
))
2354 diff
= min(diff
, DIFF_NORMAL
);
2356 /* Infer line state from dline state */
2357 if (is_atmostone(dlines
, dline_index
)) {
2358 if (line1
== LINE_YES
&& line2
== LINE_UNKNOWN
) {
2359 solver_set_line(sstate
, line2_index
, LINE_NO
);
2360 diff
= min(diff
, DIFF_EASY
);
2362 if (line2
== LINE_YES
&& line1
== LINE_UNKNOWN
) {
2363 solver_set_line(sstate
, line1_index
, LINE_NO
);
2364 diff
= min(diff
, DIFF_EASY
);
2367 if (is_atleastone(dlines
, dline_index
)) {
2368 if (line1
== LINE_NO
&& line2
== LINE_UNKNOWN
) {
2369 solver_set_line(sstate
, line2_index
, LINE_YES
);
2370 diff
= min(diff
, DIFF_EASY
);
2372 if (line2
== LINE_NO
&& line1
== LINE_UNKNOWN
) {
2373 solver_set_line(sstate
, line1_index
, LINE_YES
);
2374 diff
= min(diff
, DIFF_EASY
);
2377 /* Deductions that depend on the numbers of lines.
2378 * Only bother if both lines are UNKNOWN, otherwise the
2379 * easy-mode solver (or deductions above) would have taken
2381 if (line1
!= LINE_UNKNOWN
|| line2
!= LINE_UNKNOWN
)
2384 if (yes
== 0 && unknown
== 2) {
2385 /* Both these unknowns must be identical. If we know
2386 * atmostone or atleastone, we can make progress. */
2387 if (is_atmostone(dlines
, dline_index
)) {
2388 solver_set_line(sstate
, line1_index
, LINE_NO
);
2389 solver_set_line(sstate
, line2_index
, LINE_NO
);
2390 diff
= min(diff
, DIFF_EASY
);
2392 if (is_atleastone(dlines
, dline_index
)) {
2393 solver_set_line(sstate
, line1_index
, LINE_YES
);
2394 solver_set_line(sstate
, line2_index
, LINE_YES
);
2395 diff
= min(diff
, DIFF_EASY
);
2399 if (set_atmostone(dlines
, dline_index
))
2400 diff
= min(diff
, DIFF_NORMAL
);
2402 if (set_atleastone(dlines
, dline_index
))
2403 diff
= min(diff
, DIFF_NORMAL
);
2407 /* More advanced deduction that allows propagation along diagonal
2408 * chains of faces connected by dots, for example: 3-2-...-2-3
2409 * in square grids. */
2410 if (sstate
->diff
>= DIFF_TRICKY
) {
2411 /* If we have atleastone set for this dline, infer
2412 * atmostone for each "opposite" dline (that is, each
2413 * dline without edges in common with this one).
2414 * Again, this test is only worth doing if both these
2415 * lines are UNKNOWN. For if one of these lines were YES,
2416 * the (yes == 1) test above would kick in instead. */
2417 if (is_atleastone(dlines
, dline_index
)) {
2419 for (opp
= 0; opp
< N
; opp
++) {
2420 int opp_dline_index
;
2421 if (opp
== j
|| opp
== j
+1 || opp
== j
-1)
2423 if (j
== 0 && opp
== N
-1)
2425 if (j
== N
-1 && opp
== 0)
2427 opp_dline_index
= dline_index_from_dot(g
, d
, opp
);
2428 if (set_atmostone(dlines
, opp_dline_index
))
2429 diff
= min(diff
, DIFF_NORMAL
);
2431 if (yes
== 0 && is_atmostone(dlines
, dline_index
)) {
2432 /* This dline has *exactly* one YES and there are no
2433 * other YESs. This allows more deductions. */
2435 /* Third unknown must be YES */
2436 for (opp
= 0; opp
< N
; opp
++) {
2438 if (opp
== j
|| opp
== k
)
2440 opp_index
= d
->edges
[opp
] - g
->edges
;
2441 if (state
->lines
[opp_index
] == LINE_UNKNOWN
) {
2442 solver_set_line(sstate
, opp_index
,
2444 diff
= min(diff
, DIFF_EASY
);
2447 } else if (unknown
== 4) {
2448 /* Exactly one of opposite UNKNOWNS is YES. We've
2449 * already set atmostone, so set atleastone as
2452 if (dline_set_opp_atleastone(sstate
, d
, j
))
2453 diff
= min(diff
, DIFF_NORMAL
);
2463 static int linedsf_deductions(solver_state
*sstate
)
2465 game_state
*state
= sstate
->state
;
2466 grid
*g
= state
->game_grid
;
2467 char *dlines
= sstate
->dlines
;
2469 int diff
= DIFF_MAX
;
2472 /* ------ Face deductions ------ */
2474 /* A fully-general linedsf deduction seems overly complicated
2475 * (I suspect the problem is NP-complete, though in practice it might just
2476 * be doable because faces are limited in size).
2477 * For simplicity, we only consider *pairs* of LINE_UNKNOWNS that are
2478 * known to be identical. If setting them both to YES (or NO) would break
2479 * the clue, set them to NO (or YES). */
2481 for (i
= 0; i
< g
->num_faces
; i
++) {
2482 int N
, yes
, no
, unknown
;
2485 if (sstate
->face_solved
[i
])
2487 clue
= state
->clues
[i
];
2491 N
= g
->faces
[i
].order
;
2492 yes
= sstate
->face_yes_count
[i
];
2493 if (yes
+ 1 == clue
) {
2494 if (face_setall_identical(sstate
, i
, LINE_NO
))
2495 diff
= min(diff
, DIFF_EASY
);
2497 no
= sstate
->face_no_count
[i
];
2498 if (no
+ 1 == N
- clue
) {
2499 if (face_setall_identical(sstate
, i
, LINE_YES
))
2500 diff
= min(diff
, DIFF_EASY
);
2503 /* Reload YES count, it might have changed */
2504 yes
= sstate
->face_yes_count
[i
];
2505 unknown
= N
- no
- yes
;
2507 /* Deductions with small number of LINE_UNKNOWNs, based on overall
2508 * parity of lines. */
2509 diff_tmp
= parity_deductions(sstate
, g
->faces
[i
].edges
,
2510 (clue
- yes
) % 2, unknown
);
2511 diff
= min(diff
, diff_tmp
);
2514 /* ------ Dot deductions ------ */
2515 for (i
= 0; i
< g
->num_dots
; i
++) {
2516 grid_dot
*d
= g
->dots
+ i
;
2519 int yes
, no
, unknown
;
2520 /* Go through dlines, and do any dline<->linedsf deductions wherever
2521 * we find two UNKNOWNS. */
2522 for (j
= 0; j
< N
; j
++) {
2523 int dline_index
= dline_index_from_dot(g
, d
, j
);
2526 int can1
, can2
, inv1
, inv2
;
2528 line1_index
= d
->edges
[j
] - g
->edges
;
2529 if (state
->lines
[line1_index
] != LINE_UNKNOWN
)
2532 if (j2
== N
) j2
= 0;
2533 line2_index
= d
->edges
[j2
] - g
->edges
;
2534 if (state
->lines
[line2_index
] != LINE_UNKNOWN
)
2536 /* Infer dline flags from linedsf */
2537 can1
= edsf_canonify(sstate
->linedsf
, line1_index
, &inv1
);
2538 can2
= edsf_canonify(sstate
->linedsf
, line2_index
, &inv2
);
2539 if (can1
== can2
&& inv1
!= inv2
) {
2540 /* These are opposites, so set dline atmostone/atleastone */
2541 if (set_atmostone(dlines
, dline_index
))
2542 diff
= min(diff
, DIFF_NORMAL
);
2543 if (set_atleastone(dlines
, dline_index
))
2544 diff
= min(diff
, DIFF_NORMAL
);
2547 /* Infer linedsf from dline flags */
2548 if (is_atmostone(dlines
, dline_index
)
2549 && is_atleastone(dlines
, dline_index
)) {
2550 if (merge_lines(sstate
, line1_index
, line2_index
, 1))
2551 diff
= min(diff
, DIFF_HARD
);
2555 /* Deductions with small number of LINE_UNKNOWNs, based on overall
2556 * parity of lines. */
2557 yes
= sstate
->dot_yes_count
[i
];
2558 no
= sstate
->dot_no_count
[i
];
2559 unknown
= N
- yes
- no
;
2560 diff_tmp
= parity_deductions(sstate
, d
->edges
,
2562 diff
= min(diff
, diff_tmp
);
2565 /* ------ Edge dsf deductions ------ */
2567 /* If the state of a line is known, deduce the state of its canonical line
2568 * too, and vice versa. */
2569 for (i
= 0; i
< g
->num_edges
; i
++) {
2572 can
= edsf_canonify(sstate
->linedsf
, i
, &inv
);
2575 s
= sstate
->state
->lines
[can
];
2576 if (s
!= LINE_UNKNOWN
) {
2577 if (solver_set_line(sstate
, i
, inv ?
OPP(s
) : s
))
2578 diff
= min(diff
, DIFF_EASY
);
2580 s
= sstate
->state
->lines
[i
];
2581 if (s
!= LINE_UNKNOWN
) {
2582 if (solver_set_line(sstate
, can
, inv ?
OPP(s
) : s
))
2583 diff
= min(diff
, DIFF_EASY
);
2591 static int loop_deductions(solver_state
*sstate
)
2593 int edgecount
= 0, clues
= 0, satclues
= 0, sm1clues
= 0;
2594 game_state
*state
= sstate
->state
;
2595 grid
*g
= state
->game_grid
;
2596 int shortest_chainlen
= g
->num_dots
;
2597 int loop_found
= FALSE
;
2599 int progress
= FALSE
;
2603 * Go through the grid and update for all the new edges.
2604 * Since merge_dots() is idempotent, the simplest way to
2605 * do this is just to update for _all_ the edges.
2606 * Also, while we're here, we count the edges.
2608 for (i
= 0; i
< g
->num_edges
; i
++) {
2609 if (state
->lines
[i
] == LINE_YES
) {
2610 loop_found
|= merge_dots(sstate
, i
);
2616 * Count the clues, count the satisfied clues, and count the
2617 * satisfied-minus-one clues.
2619 for (i
= 0; i
< g
->num_faces
; i
++) {
2620 int c
= state
->clues
[i
];
2622 int o
= sstate
->face_yes_count
[i
];
2631 for (i
= 0; i
< g
->num_dots
; ++i
) {
2633 sstate
->looplen
[dsf_canonify(sstate
->dotdsf
, i
)];
2634 if (dots_connected
> 1)
2635 shortest_chainlen
= min(shortest_chainlen
, dots_connected
);
2638 assert(sstate
->solver_status
== SOLVER_INCOMPLETE
);
2640 if (satclues
== clues
&& shortest_chainlen
== edgecount
) {
2641 sstate
->solver_status
= SOLVER_SOLVED
;
2642 /* This discovery clearly counts as progress, even if we haven't
2643 * just added any lines or anything */
2645 goto finished_loop_deductionsing
;
2649 * Now go through looking for LINE_UNKNOWN edges which
2650 * connect two dots that are already in the same
2651 * equivalence class. If we find one, test to see if the
2652 * loop it would create is a solution.
2654 for (i
= 0; i
< g
->num_edges
; i
++) {
2655 grid_edge
*e
= g
->edges
+ i
;
2656 int d1
= e
->dot1
- g
->dots
;
2657 int d2
= e
->dot2
- g
->dots
;
2659 if (state
->lines
[i
] != LINE_UNKNOWN
)
2662 eqclass
= dsf_canonify(sstate
->dotdsf
, d1
);
2663 if (eqclass
!= dsf_canonify(sstate
->dotdsf
, d2
))
2666 val
= LINE_NO
; /* loop is bad until proven otherwise */
2669 * This edge would form a loop. Next
2670 * question: how long would the loop be?
2671 * Would it equal the total number of edges
2672 * (plus the one we'd be adding if we added
2675 if (sstate
->looplen
[eqclass
] == edgecount
+ 1) {
2679 * This edge would form a loop which
2680 * took in all the edges in the entire
2681 * grid. So now we need to work out
2682 * whether it would be a valid solution
2683 * to the puzzle, which means we have to
2684 * check if it satisfies all the clues.
2685 * This means that every clue must be
2686 * either satisfied or satisfied-minus-
2687 * 1, and also that the number of
2688 * satisfied-minus-1 clues must be at
2689 * most two and they must lie on either
2690 * side of this edge.
2694 int f
= e
->face1
- g
->faces
;
2695 int c
= state
->clues
[f
];
2696 if (c
>= 0 && sstate
->face_yes_count
[f
] == c
- 1)
2700 int f
= e
->face2
- g
->faces
;
2701 int c
= state
->clues
[f
];
2702 if (c
>= 0 && sstate
->face_yes_count
[f
] == c
- 1)
2705 if (sm1clues
== sm1_nearby
&&
2706 sm1clues
+ satclues
== clues
) {
2707 val
= LINE_YES
; /* loop is good! */
2712 * Right. Now we know that adding this edge
2713 * would form a loop, and we know whether
2714 * that loop would be a viable solution or
2717 * If adding this edge produces a solution,
2718 * then we know we've found _a_ solution but
2719 * we don't know that it's _the_ solution -
2720 * if it were provably the solution then
2721 * we'd have deduced this edge some time ago
2722 * without the need to do loop detection. So
2723 * in this state we return SOLVER_AMBIGUOUS,
2724 * which has the effect that hitting Solve
2725 * on a user-provided puzzle will fill in a
2726 * solution but using the solver to
2727 * construct new puzzles won't consider this
2728 * a reasonable deduction for the user to
2731 progress
= solver_set_line(sstate
, i
, val
);
2732 assert(progress
== TRUE
);
2733 if (val
== LINE_YES
) {
2734 sstate
->solver_status
= SOLVER_AMBIGUOUS
;
2735 goto finished_loop_deductionsing
;
2739 finished_loop_deductionsing
:
2740 return progress ? DIFF_EASY
: DIFF_MAX
;
2743 /* This will return a dynamically allocated solver_state containing the (more)
2745 static solver_state
*solve_game_rec(const solver_state
*sstate_start
)
2747 solver_state
*sstate
;
2749 /* Index of the solver we should call next. */
2752 /* As a speed-optimisation, we avoid re-running solvers that we know
2753 * won't make any progress. This happens when a high-difficulty
2754 * solver makes a deduction that can only help other high-difficulty
2756 * For example: if a new 'dline' flag is set by dline_deductions, the
2757 * trivial_deductions solver cannot do anything with this information.
2758 * If we've already run the trivial_deductions solver (because it's
2759 * earlier in the list), there's no point running it again.
2761 * Therefore: if a solver is earlier in the list than "threshold_index",
2762 * we don't bother running it if it's difficulty level is less than
2765 int threshold_diff
= 0;
2766 int threshold_index
= 0;
2768 sstate
= dup_solver_state(sstate_start
);
2770 check_caches(sstate
);
2772 while (i
< NUM_SOLVERS
) {
2773 if (sstate
->solver_status
== SOLVER_MISTAKE
)
2775 if (sstate
->solver_status
== SOLVER_SOLVED
||
2776 sstate
->solver_status
== SOLVER_AMBIGUOUS
) {
2777 /* solver finished */
2781 if ((solver_diffs
[i
] >= threshold_diff
|| i
>= threshold_index
)
2782 && solver_diffs
[i
] <= sstate
->diff
) {
2783 /* current_solver is eligible, so use it */
2784 int next_diff
= solver_fns
[i
](sstate
);
2785 if (next_diff
!= DIFF_MAX
) {
2786 /* solver made progress, so use new thresholds and
2787 * start again at top of list. */
2788 threshold_diff
= next_diff
;
2789 threshold_index
= i
;
2794 /* current_solver is ineligible, or failed to make progress, so
2795 * go to the next solver in the list */
2799 if (sstate
->solver_status
== SOLVER_SOLVED
||
2800 sstate
->solver_status
== SOLVER_AMBIGUOUS
) {
2801 /* s/LINE_UNKNOWN/LINE_NO/g */
2802 array_setall(sstate
->state
->lines
, LINE_UNKNOWN
, LINE_NO
,
2803 sstate
->state
->game_grid
->num_edges
);
2810 static char *solve_game(game_state
*state
, game_state
*currstate
,
2811 char *aux
, char **error
)
2814 solver_state
*sstate
, *new_sstate
;
2816 sstate
= new_solver_state(state
, DIFF_MAX
);
2817 new_sstate
= solve_game_rec(sstate
);
2819 if (new_sstate
->solver_status
== SOLVER_SOLVED
) {
2820 soln
= encode_solve_move(new_sstate
->state
);
2821 } else if (new_sstate
->solver_status
== SOLVER_AMBIGUOUS
) {
2822 soln
= encode_solve_move(new_sstate
->state
);
2823 /**error = "Solver found ambiguous solutions"; */
2825 soln
= encode_solve_move(new_sstate
->state
);
2826 /**error = "Solver failed"; */
2829 free_solver_state(new_sstate
);
2830 free_solver_state(sstate
);
2835 /* ----------------------------------------------------------------------
2836 * Drawing and mouse-handling
2839 static char *interpret_move(game_state
*state
, game_ui
*ui
, game_drawstate
*ds
,
2840 int x
, int y
, int button
)
2842 grid
*g
= state
->game_grid
;
2846 char button_char
= ' ';
2847 enum line_state old_state
;
2849 button
&= ~MOD_MASK
;
2851 /* Convert mouse-click (x,y) to grid coordinates */
2852 x
-= BORDER(ds
->tilesize
);
2853 y
-= BORDER(ds
->tilesize
);
2854 x
= x
* g
->tilesize
/ ds
->tilesize
;
2855 y
= y
* g
->tilesize
/ ds
->tilesize
;
2859 e
= grid_nearest_edge(g
, x
, y
);
2865 /* I think it's only possible to play this game with mouse clicks, sorry */
2866 /* Maybe will add mouse drag support some time */
2867 old_state
= state
->lines
[i
];
2871 switch (old_state
) {
2889 switch (old_state
) {
2908 sprintf(buf
, "%d%c", i
, (int)button_char
);
2914 static game_state
*execute_move(game_state
*state
, char *move
)
2917 game_state
*newstate
= dup_game(state
);
2919 if (move
[0] == 'S') {
2921 newstate
->cheated
= TRUE
;
2926 if (i
< 0 || i
>= newstate
->game_grid
->num_edges
)
2928 move
+= strspn(move
, "1234567890");
2929 switch (*(move
++)) {
2931 newstate
->lines
[i
] = LINE_YES
;
2934 newstate
->lines
[i
] = LINE_NO
;
2937 newstate
->lines
[i
] = LINE_UNKNOWN
;
2945 * Check for completion.
2947 if (check_completion(newstate
))
2948 newstate
->solved
= TRUE
;
2953 free_game(newstate
);
2957 /* ----------------------------------------------------------------------
2961 /* Convert from grid coordinates to screen coordinates */
2962 static void grid_to_screen(const game_drawstate
*ds
, const grid
*g
,
2963 int grid_x
, int grid_y
, int *x
, int *y
)
2965 *x
= grid_x
- g
->lowest_x
;
2966 *y
= grid_y
- g
->lowest_y
;
2967 *x
= *x
* ds
->tilesize
/ g
->tilesize
;
2968 *y
= *y
* ds
->tilesize
/ g
->tilesize
;
2969 *x
+= BORDER(ds
->tilesize
);
2970 *y
+= BORDER(ds
->tilesize
);
2973 /* Returns (into x,y) position of centre of face for rendering the text clue.
2975 static void face_text_pos(const game_drawstate
*ds
, const grid
*g
,
2976 grid_face
*f
, int *xret
, int *yret
)
2978 int faceindex
= f
- g
->faces
;
2981 * Return the cached position for this face, if we've already
2984 if (ds
->textx
[faceindex
] >= 0) {
2985 *xret
= ds
->textx
[faceindex
];
2986 *yret
= ds
->texty
[faceindex
];
2991 * Otherwise, use the incentre computed by grid.c and convert it
2992 * to screen coordinates.
2994 grid_find_incentre(f
);
2995 grid_to_screen(ds
, g
, f
->ix
, f
->iy
,
2996 &ds
->textx
[faceindex
], &ds
->texty
[faceindex
]);
2998 *xret
= ds
->textx
[faceindex
];
2999 *yret
= ds
->texty
[faceindex
];
3002 static void face_text_bbox(game_drawstate
*ds
, grid
*g
, grid_face
*f
,
3003 int *x
, int *y
, int *w
, int *h
)
3006 face_text_pos(ds
, g
, f
, &xx
, &yy
);
3008 /* There seems to be a certain amount of trial-and-error involved
3009 * in working out the correct bounding-box for the text. */
3011 *x
= xx
- ds
->tilesize
/4 - 1;
3012 *y
= yy
- ds
->tilesize
/4 - 3;
3013 *w
= ds
->tilesize
/2 + 2;
3014 *h
= ds
->tilesize
/2 + 5;
3017 static void game_redraw_clue(drawing
*dr
, game_drawstate
*ds
,
3018 game_state
*state
, int i
)
3020 grid
*g
= state
->game_grid
;
3021 grid_face
*f
= g
->faces
+ i
;
3025 if (state
->clues
[i
] < 10) {
3026 c
[0] = CLUE2CHAR(state
->clues
[i
]);
3029 sprintf(c
, "%d", state
->clues
[i
]);
3032 face_text_pos(ds
, g
, f
, &x
, &y
);
3034 FONT_VARIABLE
, ds
->tilesize
/2,
3035 ALIGN_VCENTRE
| ALIGN_HCENTRE
,
3036 ds
->clue_error
[i
] ? COL_MISTAKE
:
3037 ds
->clue_satisfied
[i
] ? COL_SATISFIED
: COL_FOREGROUND
, c
);
3040 static void edge_bbox(game_drawstate
*ds
, grid
*g
, grid_edge
*e
,
3041 int *x
, int *y
, int *w
, int *h
)
3043 int x1
= e
->dot1
->x
;
3044 int y1
= e
->dot1
->y
;
3045 int x2
= e
->dot2
->x
;
3046 int y2
= e
->dot2
->y
;
3047 int xmin
, xmax
, ymin
, ymax
;
3049 grid_to_screen(ds
, g
, x1
, y1
, &x1
, &y1
);
3050 grid_to_screen(ds
, g
, x2
, y2
, &x2
, &y2
);
3051 /* Allow extra margin for dots, and thickness of lines */
3052 xmin
= min(x1
, x2
) - 2;
3053 xmax
= max(x1
, x2
) + 2;
3054 ymin
= min(y1
, y2
) - 2;
3055 ymax
= max(y1
, y2
) + 2;
3059 *w
= xmax
- xmin
+ 1;
3060 *h
= ymax
- ymin
+ 1;
3063 static void dot_bbox(game_drawstate
*ds
, grid
*g
, grid_dot
*d
,
3064 int *x
, int *y
, int *w
, int *h
)
3068 grid_to_screen(ds
, g
, d
->x
, d
->y
, &x1
, &y1
);
3076 static const int loopy_line_redraw_phases
[] = {
3077 COL_FAINT
, COL_LINEUNKNOWN
, COL_FOREGROUND
, COL_HIGHLIGHT
, COL_MISTAKE
3079 #define NPHASES lenof(loopy_line_redraw_phases)
3081 static void game_redraw_line(drawing
*dr
, game_drawstate
*ds
,
3082 game_state
*state
, int i
, int phase
)
3084 grid
*g
= state
->game_grid
;
3085 grid_edge
*e
= g
->edges
+ i
;
3089 if (state
->line_errors
[i
])
3090 line_colour
= COL_MISTAKE
;
3091 else if (state
->lines
[i
] == LINE_UNKNOWN
)
3092 line_colour
= COL_LINEUNKNOWN
;
3093 else if (state
->lines
[i
] == LINE_NO
)
3094 line_colour
= COL_FAINT
;
3095 else if (ds
->flashing
)
3096 line_colour
= COL_HIGHLIGHT
;
3098 line_colour
= COL_FOREGROUND
;
3099 if (line_colour
!= loopy_line_redraw_phases
[phase
])
3102 /* Convert from grid to screen coordinates */
3103 grid_to_screen(ds
, g
, e
->dot1
->x
, e
->dot1
->y
, &x1
, &y1
);
3104 grid_to_screen(ds
, g
, e
->dot2
->x
, e
->dot2
->y
, &x2
, &y2
);
3106 if (line_colour
== COL_FAINT
) {
3107 static int draw_faint_lines
= -1;
3108 if (draw_faint_lines
< 0) {
3109 char *env
= getenv("LOOPY_FAINT_LINES");
3110 draw_faint_lines
= (!env
|| (env
[0] == 'y' ||
3113 if (draw_faint_lines
)
3114 draw_line(dr
, x1
, y1
, x2
, y2
, line_colour
);
3116 draw_thick_line(dr
, 3.0,
3123 static void game_redraw_dot(drawing
*dr
, game_drawstate
*ds
,
3124 game_state
*state
, int i
)
3126 grid
*g
= state
->game_grid
;
3127 grid_dot
*d
= g
->dots
+ i
;
3130 grid_to_screen(ds
, g
, d
->x
, d
->y
, &x
, &y
);
3131 draw_circle(dr
, x
, y
, 2, COL_FOREGROUND
, COL_FOREGROUND
);
3134 static int boxes_intersect(int x0
, int y0
, int w0
, int h0
,
3135 int x1
, int y1
, int w1
, int h1
)
3138 * Two intervals intersect iff neither is wholly on one side of
3139 * the other. Two boxes intersect iff their horizontal and
3140 * vertical intervals both intersect.
3142 return (x0
< x1
+w1
&& x1
< x0
+w0
&& y0
< y1
+h1
&& y1
< y0
+h0
);
3145 static void game_redraw_in_rect(drawing
*dr
, game_drawstate
*ds
,
3146 game_state
*state
, int x
, int y
, int w
, int h
)
3148 grid
*g
= state
->game_grid
;
3152 clip(dr
, x
, y
, w
, h
);
3153 draw_rect(dr
, x
, y
, w
, h
, COL_BACKGROUND
);
3155 for (i
= 0; i
< g
->num_faces
; i
++) {
3156 if (state
->clues
[i
] >= 0) {
3157 face_text_bbox(ds
, g
, &g
->faces
[i
], &bx
, &by
, &bw
, &bh
);
3158 if (boxes_intersect(x
, y
, w
, h
, bx
, by
, bw
, bh
))
3159 game_redraw_clue(dr
, ds
, state
, i
);
3162 for (phase
= 0; phase
< NPHASES
; phase
++) {
3163 for (i
= 0; i
< g
->num_edges
; i
++) {
3164 edge_bbox(ds
, g
, &g
->edges
[i
], &bx
, &by
, &bw
, &bh
);
3165 if (boxes_intersect(x
, y
, w
, h
, bx
, by
, bw
, bh
))
3166 game_redraw_line(dr
, ds
, state
, i
, phase
);
3169 for (i
= 0; i
< g
->num_dots
; i
++) {
3170 dot_bbox(ds
, g
, &g
->dots
[i
], &bx
, &by
, &bw
, &bh
);
3171 if (boxes_intersect(x
, y
, w
, h
, bx
, by
, bw
, bh
))
3172 game_redraw_dot(dr
, ds
, state
, i
);
3176 draw_update(dr
, x
, y
, w
, h
);
3179 static void game_redraw(drawing
*dr
, game_drawstate
*ds
, game_state
*oldstate
,
3180 game_state
*state
, int dir
, game_ui
*ui
,
3181 float animtime
, float flashtime
)
3183 #define REDRAW_OBJECTS_LIMIT 16 /* Somewhat arbitrary tradeoff */
3185 grid
*g
= state
->game_grid
;
3186 int border
= BORDER(ds
->tilesize
);
3189 int redraw_everything
= FALSE
;
3191 int edges
[REDRAW_OBJECTS_LIMIT
], nedges
= 0;
3192 int faces
[REDRAW_OBJECTS_LIMIT
], nfaces
= 0;
3194 /* Redrawing is somewhat involved.
3196 * An update can theoretically affect an arbitrary number of edges
3197 * (consider, for example, completing or breaking a cycle which doesn't
3198 * satisfy all the clues -- we'll switch many edges between error and
3199 * normal states). On the other hand, redrawing the whole grid takes a
3200 * while, making the game feel sluggish, and many updates are actually
3201 * quite well localized.
3203 * This redraw algorithm attempts to cope with both situations gracefully
3204 * and correctly. For localized changes, we set a clip rectangle, fill
3205 * it with background, and then redraw (a plausible but conservative
3206 * guess at) the objects which intersect the rectangle; if several
3207 * objects need redrawing, we'll do them individually. However, if lots
3208 * of objects are affected, we'll just redraw everything.
3210 * The reason for all of this is that it's just not safe to do the redraw
3211 * piecemeal. If you try to draw an antialiased diagonal line over
3212 * itself, you get a slightly thicker antialiased diagonal line, which
3213 * looks rather ugly after a while.
3215 * So, we take two passes over the grid. The first attempts to work out
3216 * what needs doing, and the second actually does it.
3220 redraw_everything
= TRUE
;
3223 /* First, trundle through the faces. */
3224 for (i
= 0; i
< g
->num_faces
; i
++) {
3225 grid_face
*f
= g
->faces
+ i
;
3226 int sides
= f
->order
;
3229 int n
= state
->clues
[i
];
3233 clue_mistake
= (face_order(state
, i
, LINE_YES
) > n
||
3234 face_order(state
, i
, LINE_NO
) > (sides
-n
));
3235 clue_satisfied
= (face_order(state
, i
, LINE_YES
) == n
&&
3236 face_order(state
, i
, LINE_NO
) == (sides
-n
));
3238 if (clue_mistake
!= ds
->clue_error
[i
] ||
3239 clue_satisfied
!= ds
->clue_satisfied
[i
]) {
3240 ds
->clue_error
[i
] = clue_mistake
;
3241 ds
->clue_satisfied
[i
] = clue_satisfied
;
3242 if (nfaces
== REDRAW_OBJECTS_LIMIT
)
3243 redraw_everything
= TRUE
;
3245 faces
[nfaces
++] = i
;
3249 /* Work out what the flash state needs to be. */
3250 if (flashtime
> 0 &&
3251 (flashtime
<= FLASH_TIME
/3 ||
3252 flashtime
>= FLASH_TIME
*2/3)) {
3253 flash_changed
= !ds
->flashing
;
3254 ds
->flashing
= TRUE
;
3256 flash_changed
= ds
->flashing
;
3257 ds
->flashing
= FALSE
;
3260 /* Now, trundle through the edges. */
3261 for (i
= 0; i
< g
->num_edges
; i
++) {
3263 state
->line_errors
[i
] ? DS_LINE_ERROR
: state
->lines
[i
];
3264 if (new_ds
!= ds
->lines
[i
] ||
3265 (flash_changed
&& state
->lines
[i
] == LINE_YES
)) {
3266 ds
->lines
[i
] = new_ds
;
3267 if (nedges
== REDRAW_OBJECTS_LIMIT
)
3268 redraw_everything
= TRUE
;
3270 edges
[nedges
++] = i
;
3275 /* Pass one is now done. Now we do the actual drawing. */
3276 if (redraw_everything
) {
3277 int grid_width
= g
->highest_x
- g
->lowest_x
;
3278 int grid_height
= g
->highest_y
- g
->lowest_y
;
3279 int w
= grid_width
* ds
->tilesize
/ g
->tilesize
;
3280 int h
= grid_height
* ds
->tilesize
/ g
->tilesize
;
3282 game_redraw_in_rect(dr
, ds
, state
,
3283 0, 0, w
+ 2*border
+ 1, h
+ 2*border
+ 1);
3286 /* Right. Now we roll up our sleeves. */
3288 for (i
= 0; i
< nfaces
; i
++) {
3289 grid_face
*f
= g
->faces
+ faces
[i
];
3292 face_text_bbox(ds
, g
, f
, &x
, &y
, &w
, &h
);
3293 game_redraw_in_rect(dr
, ds
, state
, x
, y
, w
, h
);
3296 for (i
= 0; i
< nedges
; i
++) {
3297 grid_edge
*e
= g
->edges
+ edges
[i
];
3300 edge_bbox(ds
, g
, e
, &x
, &y
, &w
, &h
);
3301 game_redraw_in_rect(dr
, ds
, state
, x
, y
, w
, h
);
3308 static float game_flash_length(game_state
*oldstate
, game_state
*newstate
,
3309 int dir
, game_ui
*ui
)
3311 if (!oldstate
->solved
&& newstate
->solved
&&
3312 !oldstate
->cheated
&& !newstate
->cheated
) {
3319 static int game_status(game_state
*state
)
3321 return state
->solved ?
+1 : 0;
3324 static void game_print_size(game_params
*params
, float *x
, float *y
)
3329 * I'll use 7mm "squares" by default.
3331 game_compute_size(params
, 700, &pw
, &ph
);
3336 static void game_print(drawing
*dr
, game_state
*state
, int tilesize
)
3338 int ink
= print_mono_colour(dr
, 0);
3340 game_drawstate ads
, *ds
= &ads
;
3341 grid
*g
= state
->game_grid
;
3343 ds
->tilesize
= tilesize
;
3344 ds
->textx
= snewn(g
->num_faces
, int);
3345 ds
->texty
= snewn(g
->num_faces
, int);
3346 for (i
= 0; i
< g
->num_faces
; i
++)
3347 ds
->textx
[i
] = ds
->texty
[i
] = -1;
3349 for (i
= 0; i
< g
->num_dots
; i
++) {
3351 grid_to_screen(ds
, g
, g
->dots
[i
].x
, g
->dots
[i
].y
, &x
, &y
);
3352 draw_circle(dr
, x
, y
, ds
->tilesize
/ 15, ink
, ink
);
3358 for (i
= 0; i
< g
->num_faces
; i
++) {
3359 grid_face
*f
= g
->faces
+ i
;
3360 int clue
= state
->clues
[i
];
3364 c
[0] = CLUE2CHAR(clue
);
3366 face_text_pos(ds
, g
, f
, &x
, &y
);
3368 FONT_VARIABLE
, ds
->tilesize
/ 2,
3369 ALIGN_VCENTRE
| ALIGN_HCENTRE
, ink
, c
);
3376 for (i
= 0; i
< g
->num_edges
; i
++) {
3377 int thickness
= (state
->lines
[i
] == LINE_YES
) ?
30 : 150;
3378 grid_edge
*e
= g
->edges
+ i
;
3380 grid_to_screen(ds
, g
, e
->dot1
->x
, e
->dot1
->y
, &x1
, &y1
);
3381 grid_to_screen(ds
, g
, e
->dot2
->x
, e
->dot2
->y
, &x2
, &y2
);
3382 if (state
->lines
[i
] == LINE_YES
)
3384 /* (dx, dy) points from (x1, y1) to (x2, y2).
3385 * The line is then "fattened" in a perpendicular
3386 * direction to create a thin rectangle. */
3387 double d
= sqrt(SQ((double)x1
- x2
) + SQ((double)y1
- y2
));
3388 double dx
= (x2
- x1
) / d
;
3389 double dy
= (y2
- y1
) / d
;
3392 dx
= (dx
* ds
->tilesize
) / thickness
;
3393 dy
= (dy
* ds
->tilesize
) / thickness
;
3394 points
[0] = x1
+ (int)dy
;
3395 points
[1] = y1
- (int)dx
;
3396 points
[2] = x1
- (int)dy
;
3397 points
[3] = y1
+ (int)dx
;
3398 points
[4] = x2
- (int)dy
;
3399 points
[5] = y2
+ (int)dx
;
3400 points
[6] = x2
+ (int)dy
;
3401 points
[7] = y2
- (int)dx
;
3402 draw_polygon(dr
, points
, 4, ink
, ink
);
3406 /* Draw a dotted line */
3409 for (j
= 1; j
< divisions
; j
++) {
3410 /* Weighted average */
3411 int x
= (x1
* (divisions
-j
) + x2
* j
) / divisions
;
3412 int y
= (y1
* (divisions
-j
) + y2
* j
) / divisions
;
3413 draw_circle(dr
, x
, y
, ds
->tilesize
/ thickness
, ink
, ink
);
3423 #define thegame loopy
3426 const struct game thegame
= {
3427 "Loopy", "games.loopy", "loopy",
3434 TRUE
, game_configure
, custom_params
,
3442 TRUE
, game_can_format_as_text_now
, game_text_format
,
3450 PREFERRED_TILE_SIZE
, game_compute_size
, game_set_size
,
3453 game_free_drawstate
,
3458 TRUE
, FALSE
, game_print_size
, game_print
,
3459 FALSE
/* wants_statusbar */,
3460 FALSE
, game_timing_state
,
3461 0, /* mouse_priorities */
3464 #ifdef STANDALONE_SOLVER
3467 * Half-hearted standalone solver. It can't output the solution to
3468 * anything but a square puzzle, and it can't log the deductions
3469 * it makes either. But it can solve square puzzles, and more
3470 * importantly it can use its solver to grade the difficulty of
3471 * any puzzle you give it.
3476 int main(int argc
, char **argv
)
3480 char *id
= NULL
, *desc
, *err
;
3483 #if 0 /* verbose solver not supported here (yet) */
3484 int really_verbose
= FALSE
;
3487 while (--argc
> 0) {
3489 #if 0 /* verbose solver not supported here (yet) */
3490 if (!strcmp(p
, "-v")) {
3491 really_verbose
= TRUE
;
3494 if (!strcmp(p
, "-g")) {
3496 } else if (*p
== '-') {
3497 fprintf(stderr
, "%s: unrecognised option `%s'\n", argv
[0], p
);
3505 fprintf(stderr
, "usage: %s [-g | -v] <game_id>\n", argv
[0]);
3509 desc
= strchr(id
, ':');
3511 fprintf(stderr
, "%s: game id expects a colon in it\n", argv
[0]);
3516 p
= default_params();
3517 decode_params(p
, id
);
3518 err
= validate_desc(p
, desc
);
3520 fprintf(stderr
, "%s: %s\n", argv
[0], err
);
3523 s
= new_game(NULL
, p
, desc
);
3526 * When solving an Easy puzzle, we don't want to bother the
3527 * user with Hard-level deductions. For this reason, we grade
3528 * the puzzle internally before doing anything else.
3530 ret
= -1; /* placate optimiser */
3531 for (diff
= 0; diff
< DIFF_MAX
; diff
++) {
3532 solver_state
*sstate_new
;
3533 solver_state
*sstate
= new_solver_state((game_state
*)s
, diff
);
3535 sstate_new
= solve_game_rec(sstate
);
3537 if (sstate_new
->solver_status
== SOLVER_MISTAKE
)
3539 else if (sstate_new
->solver_status
== SOLVER_SOLVED
)
3544 free_solver_state(sstate_new
);
3545 free_solver_state(sstate
);
3551 if (diff
== DIFF_MAX
) {
3553 printf("Difficulty rating: harder than Hard, or ambiguous\n");
3555 printf("Unable to find a unique solution\n");
3559 printf("Difficulty rating: impossible (no solution exists)\n");
3561 printf("Difficulty rating: %s\n", diffnames
[diff
]);
3563 solver_state
*sstate_new
;
3564 solver_state
*sstate
= new_solver_state((game_state
*)s
, diff
);
3566 /* If we supported a verbose solver, we'd set verbosity here */
3568 sstate_new
= solve_game_rec(sstate
);
3570 if (sstate_new
->solver_status
== SOLVER_MISTAKE
)
3571 printf("Puzzle is inconsistent\n");
3573 assert(sstate_new
->solver_status
== SOLVER_SOLVED
);
3574 if (s
->grid_type
== 0) {
3575 fputs(game_text_format(sstate_new
->state
), stdout
);
3577 printf("Unable to output non-square grids\n");
3581 free_solver_state(sstate_new
);
3582 free_solver_state(sstate
);
3591 /* vim: set shiftwidth=4 tabstop=8: */