aboutsummaryrefslogtreecommitdiff
path: root/puzzles.but
diff options
context:
space:
mode:
authorSimon Tatham <anakin@pobox.com>2005-08-28 14:29:19 +0000
committerSimon Tatham <anakin@pobox.com>2005-08-28 14:29:19 +0000
commit2975ae2811d1db0efd89d0cb1f17b56277d2769e (patch)
tree115ac1e9f92d50eb1c9dc4a82a34a350d06a32b6 /puzzles.but
parente483fc513b6fd5169ef6d3812b41c8d190eb49ea (diff)
downloadpuzzles-2975ae2811d1db0efd89d0cb1f17b56277d2769e.zip
puzzles-2975ae2811d1db0efd89d0cb1f17b56277d2769e.tar.gz
puzzles-2975ae2811d1db0efd89d0cb1f17b56277d2769e.tar.bz2
puzzles-2975ae2811d1db0efd89d0cb1f17b56277d2769e.tar.xz
Unreasonable mode for Map.
[originally from svn r6229]
Diffstat (limited to 'puzzles.but')
-rw-r--r--puzzles.but9
1 files changed, 9 insertions, 0 deletions
diff --git a/puzzles.but b/puzzles.but
index e2f5868..b7435d7 100644
--- a/puzzles.but
+++ b/puzzles.but
@@ -1656,6 +1656,15 @@ will have to use more complex logic to deduce the colour of some
regions. However, it will always be possible without having to
guess or backtrack.
+\lcont{
+
+In \q{Unreasonable} mode, the program will feel free to generate
+puzzles which are as hard as it can possibly make them: the only
+constraint is that they should still have a unique solution. Solving
+Unreasonable puzzles may require guessing and backtracking.
+
+}
+
\C{loopy} \i{Loopy}