Add a couple more checks to the 3d collision detection, without

[sgt/puzzles] / puzzles.but

diff --git a/puzzles.but b/puzzles.but
index 4485b81..820bac8 100644 (file)
--- a/puzzles.but
+++ b/puzzles.but
@@ -30,7 +30,7 @@
 
 This is a collection of small one-player puzzle games.
 
-\copyright This manual is copyright 2004-2009 Simon Tatham. All rights
+\copyright This manual is copyright 2004-2010 Simon Tatham. All rights
 reserved. You may distribute this documentation under the MIT licence.
 See \k{licence} for the licence text in full.
 
@@ -2500,7 +2500,7 @@ precisely the opposite of the rule in Solo's \q{Killer} mode (see
 
 }
 
-This puzzle appears in the Times under the name \q{KenKen}.
+This puzzle appears in the Times under the name \q{\i{KenKen}}.
 
 
 \H{keen-controls} \i{Keen controls}
@@ -2579,7 +2579,7 @@ Your task is to build a tower on every square, in such a way that:
 \b Each numeric clue describes the number of towers that can be seen
 if you look into the square from that direction, assuming that
 shorter towers are hidden behind taller ones. For example, in a
-5\by.5 grid, a clue marked \q{5} indicates that the five tower
+5\by\.5 grid, a clue marked \q{5} indicates that the five tower
 heights must appear in increasing order (otherwise you would not be
 able to see all five towers), whereas a clue marked \q{1} indicates
 that the tallest tower (the one marked 5) must come first.
@@ -2589,7 +2589,7 @@ as well as the clues round the edge, and some edge clues may be
 missing.
 
 This puzzle appears on the web under various names, particularly
-\q{Skyscrapers}, but I don't know who first invented it.
+\q{\i{Skyscrapers}}, but I don't know who first invented it.
 
 
 \H{towers-controls} \i{Towers controls}
@@ -2651,9 +2651,63 @@ level, some backtracking will be required, but the solution should
 still be unique. The remaining levels require increasingly complex
 reasoning to avoid having to backtrack.
 
+
+\C{singles} \i{Singles}
+
+\cfg{winhelp-topic}{games.singles}
+
+You have a grid of white squares, all of which contain numbers. Your task
+is to colour some of the squares black (removing the number) so as to satisfy
+all of the following conditions:
+
+\b No number occurs more than once in any row or column.
+
+\b No black square is horizontally or vertically adjacent to any other black
+square.
+
+\b The remaining white squares must all form one contiguous region
+(connected by edges, not just touching at corners).
+
+Credit for this puzzle goes to \i{Nikoli} \k{nikoli-hitori} who call it
+\i{Hitori}. 
+
+Singles was contributed to this collection by James Harvey.
+
+\B{nikoli-hitori}
+\W{http://www.nikoli.com/en/puzzles/hitori/index.html}\cw{http://www.nikoli.com/en/puzzles/hitori/index.html}
+(beware of Flash)
+
+\H{singles-controls} \i{Singles controls}
+
+\IM{Singles controls} controls, for Singles
+
+Left-clicking on an empty square will colour it black; left-clicking again 
+will replace the number. Right-clicking will add a circle (useful for 
+indicating that a cell is definitely not black). 
+
+You can also use the cursor keys to move around the grid. Pressing the
+return or space keys will turn a square black or add a circle respectively,
+and pressing the key again will replace the number or remove the circle.
+
+(All the actions described in \k{common-actions} are also available.)
+
+\H{singles-parameters} \I{parameters, for Singles}Singles parameters
+
+These parameters are available from the \q{Custom...} option on the
+\q{Type} menu.
+
+\dt \e{Width}, \e{Height}
+
+\dd Size of grid in squares.
+
+\dt \e{Difficulty}
+
+\dd Controls the difficulty of the generated puzzle.
+
+
 \A{licence} \I{MIT licence}\ii{Licence}
 
-This software is \i{copyright} 2004-2009 Simon Tatham.
+This software is \i{copyright} 2004-2010 Simon Tatham.
 
 Portions copyright Richard Boulton, James Harvey, Mike Pinna, Jonas
 K\u00F6{oe}lker, Dariusz Olszewski, Michael Schierl, Lambros