Refactoring patch from Ben Hutchings: move all the Gtk resize code into one

[sgt/puzzles] / puzzles.but

diff --git a/puzzles.but b/puzzles.but
index 401419e..2ce1d89 100644 (file)
--- a/puzzles.but
+++ b/puzzles.but
@@ -2087,8 +2087,9 @@ them. Your aim is to fully populate the grid with numbers such that:
 
 \b All the greater-than signs are satisfied. 
 
-In \q{Trivial} mode, there are no greater-than signs; the puzzle is
-to solve the \i{Latin square} only.
+In \q{Trivial} mode (available via the \q{Custom} game type
+selector), there are no greater-than signs; the puzzle is to solve
+the \i{Latin square} only.
 
 At the time of writing, this puzzle is appearing in the Guardian
 weekly under the name \q{\i{Futoshiki}}.
@@ -2137,10 +2138,11 @@ These parameters are available from the \q{Custom...} option on the
 \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 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.
+level, there are no greater-than signs; the puzzle is to solve the
+Latin square only. At Recursive level (only available via the
+\q{Custom} game type selector) backtracking will be required, but
+the solution should still be unique. The levels in between require
+increasingly complex reasoning to avoid having to backtrack.
 
 
 
@@ -2204,12 +2206,52 @@ difficulty level may require backtracking.
 
 
 
+\C{filling} \i{Filling}
+
+\cfg{winhelp-topic}{games.filling}
+
+You have a grid of squares, some of which contain digits, and the
+rest of which are empty. Your job is to fill in digits in the empty
+squares, in such a way that each connected region of squares all
+containing the same digit has an area equal to that digit.
+
+(\q{Connected region}, for the purposes of this game, does not count
+diagonally separated squares as adjacent.)
+
+For example, it follows that no square can contain a zero, and that
+two adjacent squares can not both contain a one.  No region has an
+area greater than 9 (because then its area would not be a single
+digit).
+
+Credit for this puzzle goes to \i{Nikoli} \k{nikoli-fillomino}.
+
+Filling was contributed to this collection by Jonas K\u00F6{oe}lker.
+
+\B{nikoli-fillomino}
+\W{http://www.nikoli.co.jp/en/puzzles/fillomino/}\cw{http://www.nikoli.co.jp/en/puzzles/fillomino/}
+
+\H{filling-controls} \I{controls, for Filling}Filling controls
+
+To play Filling, simply click the mouse in any empty square and then
+type a digit on the keyboard to fill that square.  If you make a
+mistake, click the mouse in the incorrect square and press 0, Space,
+Backspace or Enter to clear it again (or use the Undo feature).
+
+(All the actions described in \k{common-actions} are also available.)
+
+\H{filling-parameters} \I{parameters, for Filling}Filling parameters
+
+Filling allows you to configure the number of rows and columns of the
+grid, through the \q{Type} menu.
+
+
 
 \A{licence} \I{MIT licence}\ii{Licence}
 
 This software is \i{copyright} 2004-2007 Simon Tatham.
 
-Portions copyright Richard Boulton, James Harvey and Mike Pinna.
+Portions copyright Richard Boulton, James Harvey, Mike Pinna and
+Jonas K\u00F6{oe}lker.
 
 Permission is hereby granted, free of charge, to any person
 obtaining a copy of this software and associated documentation files