ref: 48f9d92f6fefe45e74ca69d4b11fdcfa27e47a4b
parent: 9dcba6a8cfe48da21df47f32e43aad10b8f52dae
author: Jacob Nevins <jacobn@chiark.greenend.org.uk>
date: Sun Mar 10 09:56:12 EDT 2013
Clarify instructions for 'Range' -- I initially read the last point as meaning the maximum white squares in any direction, rather than the total of all directions. [originally from svn r9771]
--- a/puzzles.but
+++ b/puzzles.but
@@ -2866,9 +2866,11 @@
\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