diff options
| author | Simon Tatham <anakin@pobox.com> | 2005-08-29 09:14:35 +0000 |
|---|---|---|
| committer | Simon Tatham <anakin@pobox.com> | 2005-08-29 09:14:35 +0000 |
| commit | 4d6c8c73373bf7eb1f72b1cf4fbb78a5719ade3f (patch) | |
| tree | a54532e93e14d77179fc636a73b15fc74d8e0d2b /map.c | |
| parent | ea9142fbda5beec1e76c1ba8d3ee649be6946d03 (diff) | |
| download | puzzles-4d6c8c73373bf7eb1f72b1cf4fbb78a5719ade3f.zip puzzles-4d6c8c73373bf7eb1f72b1cf4fbb78a5719ade3f.tar.gz puzzles-4d6c8c73373bf7eb1f72b1cf4fbb78a5719ade3f.tar.bz2 puzzles-4d6c8c73373bf7eb1f72b1cf4fbb78a5719ade3f.tar.xz | |
Typo in comment :-)
[originally from svn r6236]
Diffstat (limited to 'map.c')
| -rw-r--r-- | map.c | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -1239,8 +1239,8 @@ static char *new_game_desc(game_params *params, random_state *rs, * Finally, check that the puzzle is _at least_ as hard as * required, and indeed that it isn't already solved. * (Calling map_solver with negative difficulty ensures the - * latter - if a solver which _does nothing_ can't solve - * it, it's too easy!) + * latter - if a solver which _does nothing_ can solve it, + * it's too easy!) */ memcpy(colouring2, colouring, n*sizeof(int)); if (map_solver(sc, graph, n, ngraph, colouring2, |