This is a collection of small one-player puzzle games.
-\copyright This manual is copyright 2004-2012 Simon Tatham. All rights
+\copyright This manual is copyright 2004-2014 Simon Tatham. All rights
reserved. You may distribute this documentation under the MIT licence.
See \k{licence} for the licence text in full.
\cfg{html-local-head}{<meta name="AppleTitle" content="Puzzles Help">}
-\versionid $Id$
-
\C{intro} Introduction
I wrote this collection because I thought there should be more small
you know that those will never be counted as part of the solution). This
is turned off by default.
+\lcont{
+
Note that this doesn't allow blank pegs in the solution; if you really wanted
that, use one extra colour.
+}
+
\dt \e{Allow duplicates}
\dd Allows the solution (and the guesses) to contain colours more than once;
likely it is to extend as far as it can, rather than choosing
somewhere closer.
+\lcont{
+
High expansion factors usually mean easier puzzles with fewer
possible islands; low expansion factors can create lots of
tightly-packed islands.
+}
+
\C{unequal} \i{Unequal}
\dd Size of grid in squares. There will be half \e{Width} \by \e{Height}
dominoes in the grid: if this number is odd then one square will be blank.
+\lcont{
+
(Grids with at least one odd dimension tend to be easier to solve.)
+}
+
\dt \e{Difficulty}
\dd Controls the difficulty of the generated puzzle. At Tricky level,
\b for any two white squares, there is a path between them using only
white squares.
-\b for each square with a number, that number denotes the number of
-squares reachable from that square going in each direction until
-hitting a wall or a black square.
+\b for each square with a number, that number denotes the total number
+of white squares reachable from that square going in a straight line
+in any horizontal or vertical direction until hitting a wall or a
+black square; the square with the number is included in the total
+(once).
For instance, a square containing the number one must have four black
squares as its neighbours by the last criterion; but then it's
grid} are not constrained.)
Credit for this puzzle goes to \i{Nikoli}, who call it \q{Masyu}.
-\k{nikoli-pearl}.
+\k{nikoli-pearl}
Thanks to James Harvey for assistance with the implementation.
\dd Controls the difficulty of the generated puzzle.
+\dt \e{Unique rows and columns}
+
+\dd If enabled, no two rows are permitted to have exactly the same
+pattern, and likewise columns. (A row and a column can match, though.)
+
\A{licence} \I{MIT licence}\ii{Licence}
-This software is \i{copyright} 2004-2012 Simon Tatham.
+This software is \i{copyright} 2004-2014 Simon Tatham.
Portions copyright Richard Boulton, James Harvey, Mike Pinna, Jonas
-K\u00F6{oe}lker, Dariusz Olszewski, Michael Schierl, Lambros
-Lambrou, Bernd Schmidt, Steffen Bauer and Lennard Sprong.
+K\u00F6{oe}lker, Dariusz Olszewski, Michael Schierl, Lambros Lambrou,
+Bernd Schmidt, Steffen Bauer, Lennard Sprong and Rogier Goossens.
Permission is hereby granted, free of charge, to any person
obtaining a copy of this software and associated documentation files