ref: 7a4170260687cfbbc0481e725a046afb5cbf4663
parent: ea7104350009ff0ae490d1266ee68a98d5e42922
author: Simon Tatham <[email protected]>
date: Mon Jan 15 15:04:11 EST 2007
Phil Bordelon points out that the Unequal difficulty settings documentation is a bit odd, and also offers a signedness fix in latin.c. [originally from svn r7112]
--- a/latin.c
+++ b/latin.c
@@ -947,7 +947,7 @@
#ifdef STANDALONE_SOLVER
if (solver_show_working) {
struct latin_solver ls, *solver = &ls;
- char *dbg;
+ unsigned char *dbg;
int x, y, i, c = 0;
ls.cube = cube; ls.o = o; /* for cube() to work */
--- a/puzzles.but
+++ b/puzzles.but
@@ -2136,10 +2136,11 @@
\dt \e{Difficulty}
-\dd Controls the difficulty of the generated puzzle. At Trivial level,
-there are no greater-than signs (the puzzle is to solve the Latin
-square only); at Tricky level, some recursion may be required (but the
-solutions should always be unique).
+\dd Controls the difficulty of the generated puzzle. At Trivial
+level, there are no greater-than signs (the puzzle is to solve the
+Latin square only); at Recursive level backtracking will be required
+(but the solution should still be unique); the levels in between
+require increasingly complex reasoning to avoid having to backtrack.
\A{licence} \I{MIT licence}\ii{Licence}