/usr/share/sgt-puzzles/help/en/range.html is in sgt-puzzles 20161228.7cae89f-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 | <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
"http://www.w3.org/TR/html4/strict.dtd">
<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=US-ASCII">
<title>Range</title>
<link rel="previous" href="signpost.html">
<link rel="ToC" href="index.html">
<link rel="up" href="index.html">
<link rel="index" href="docindex.html">
<link rel="next" href="pearl.html">
</head>
<body>
<p><a href="signpost.html">Previous</a> | <a href="index.html">Contents</a> | <a href="docindex.html">Index</a> | <a href="pearl.html">Next</a></p>
<h1><a name="C35"></a>Chapter 35: <a name="i0"></a>Range</h1>
<p>
You have a grid of squares; some squares contain numbers. Your job is to colour some of the squares black, such that several criteria are satisfied:
</p>
<ul><li>
no square with a number is coloured black.
</li>
<li>
no two black squares are adjacent (horizontally or vertically).
</li>
<li>
for any two white squares, there is a path between them using only white squares.
</li>
<li>
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).
</li>
</ul>
<p>
For instance, a square containing the number one must have four black squares as its neighbours by the last criterion; but then it's impossible for it to be connected to any outside white square, which violates the second to last criterion. So no square will contain the number one.
</p>
<p>
Credit for this puzzle goes to <a name="i1"></a>Nikoli, who have variously called it ‘Kurodoko’, ‘Kuromasu’ or ‘Where is Black Cells’. <a href="#p0">[18]</a>.
</p>
<p>
Range was contributed to this collection by Jonas Kölker.
</p>
<p><a name="p0"></a>
[18] <a href="http://www.nikoli.co.jp/en/puzzles/where_is_black_cells.html"><code>http://www.nikoli.co.jp/en/puzzles/where_is_black_cells.html</code></a>
</p>
<h2><a name="S35.1"></a>35.1 <a name="i2"></a>Range controls</h2>
<p>
Click with the left button to paint a square black, or with the right button to mark a square with a dot to indicate that you are sure it should <em>not</em> be painted black. Repeated clicking with either button will cycle the square through the three possible states (filled, dotted or empty) in opposite directions.
</p>
<p>
You can also use the cursor keys to move around the grid squares. Pressing Return does the same as clicking with the left button, while pressing Space does the same as a right button click. Moving with the cursor keys while holding Shift will place dots in all squares that are moved through.
</p>
<p>
(All the actions described in <a href="common.html#S2.1">section 2.1</a> are also available.)
</p>
<h2><a name="S35.2"></a>35.2 <a name="i3"></a>Range parameters</h2>
<p>
These parameters are available from the ‘Custom...’ option on the ‘Type’ menu.
</p>
<dl><dt>
<em>Width</em>, <em>Height</em>
</dt>
<dd>
Size of grid in squares.
</dd>
</dl>
<hr><address>
[Simon Tatham's Portable Puzzle Collection, version 20161228.7cae89f]</address></body>
</html>
|