diff options
Diffstat (limited to 'apps/plugins/puzzles/src/map.html')
| -rw-r--r-- | apps/plugins/puzzles/src/map.html | 76 |
1 files changed, 0 insertions, 76 deletions
diff --git a/apps/plugins/puzzles/src/map.html b/apps/plugins/puzzles/src/map.html deleted file mode 100644 index d3aac337d8..0000000000 --- a/apps/plugins/puzzles/src/map.html +++ /dev/null | |||
| @@ -1,76 +0,0 @@ | |||
| 1 | <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" | ||
| 2 | "http://www.w3.org/TR/html4/strict.dtd"> | ||
| 3 | <html> | ||
| 4 | <head> | ||
| 5 | <meta http-equiv="content-type" content="text/html; charset=US-ASCII"> | ||
| 6 | <title>Map</title> | ||
| 7 | <link rel="previous" href="lightup.html"> | ||
| 8 | <link rel="ToC" href="index.html"> | ||
| 9 | <link rel="up" href="index.html"> | ||
| 10 | <link rel="index" href="docindex.html"> | ||
| 11 | <link rel="next" href="loopy.html"> | ||
| 12 | </head> | ||
| 13 | <body> | ||
| 14 | <p><a href="lightup.html">Previous</a> | <a href="index.html">Contents</a> | <a href="docindex.html">Index</a> | <a href="loopy.html">Next</a></p> | ||
| 15 | <h1><a name="C22"></a>Chapter 22: <a name="i0"></a>Map</h1> | ||
| 16 | <p> | ||
| 17 | You are given a map consisting of a number of regions. Your task is to colour each region with one of four colours, in such a way that no two regions sharing a boundary have the same colour. You are provided with some regions already coloured, sufficient to make the remainder of the solution unique. | ||
| 18 | </p> | ||
| 19 | <p> | ||
| 20 | Only regions which share a length of border are required to be different colours. Two regions which meet at only one <em>point</em> (i.e. are diagonally separated) may be the same colour. | ||
| 21 | </p> | ||
| 22 | <p> | ||
| 23 | I believe this puzzle is original; I've never seen an implementation of it anywhere else. The concept of a <a name="i1"></a>four-colouring puzzle was suggested by Owen Dunn; credit must also go to Nikoli and to Verity Allan for inspiring the train of thought that led to me realising Owen's suggestion was a viable puzzle. Thanks also to Gareth Taylor for many detailed suggestions. | ||
| 24 | </p> | ||
| 25 | <h2><a name="S22.1"></a>22.1 <a name="i2"></a>Map controls</h2> | ||
| 26 | <p> | ||
| 27 | To colour a region, click the left mouse button on an existing region of the desired colour and drag that colour into the new region. | ||
| 28 | </p> | ||
| 29 | <p> | ||
| 30 | (The program will always ensure the starting puzzle has at least one region of each colour, so that this is always possible!) | ||
| 31 | </p> | ||
| 32 | <p> | ||
| 33 | If you need to clear a region, you can drag from an empty region, or from the puzzle boundary if there are no empty regions left. | ||
| 34 | </p> | ||
| 35 | <p> | ||
| 36 | Dragging a colour using the <em>right</em> mouse button will stipple the region in that colour, which you can use as a note to yourself that you think the region <em>might</em> be that colour. A region can contain stipples in multiple colours at once. (This is often useful at the harder difficulty levels.) | ||
| 37 | </p> | ||
| 38 | <p> | ||
| 39 | You can also use the cursor keys to move around the map: the colour of the cursor indicates the position of the colour you would drag (which is not obvious if you're on a region's boundary, since it depends on the direction from which you approached the boundary). Pressing the return key starts a drag of that colour, as above, which you control with the cursor keys; pressing the return key again finishes the drag. The space bar can be used similarly to create a stippled region. Double-pressing the return key (without moving the cursor) will clear the region, as a drag from an empty region does: this is useful with the cursor mode if you have filled the entire map in but need to correct the layout. | ||
| 40 | </p> | ||
| 41 | <p> | ||
| 42 | If you press L during play, the game will toggle display of a number in each region of the map. This is useful if you want to discuss a particular puzzle instance with a friend – having an unambiguous name for each region is much easier than trying to refer to them all by names such as ‘the one down and right of the brown one on the top border’. | ||
| 43 | </p> | ||
| 44 | <p> | ||
| 45 | (All the actions described in <a href="common.html#S2.1">section 2.1</a> are also available.) | ||
| 46 | </p> | ||
| 47 | <h2><a name="S22.2"></a>22.2 <a name="i3"></a>Map parameters</h2> | ||
| 48 | <p> | ||
| 49 | These parameters are available from the ‘Custom...’ option on the ‘Type’ menu. | ||
| 50 | </p> | ||
| 51 | <dl><dt> | ||
| 52 | <em>Width</em>, <em>Height</em> | ||
| 53 | </dt> | ||
| 54 | <dd> | ||
| 55 | Size of grid in squares. | ||
| 56 | </dd> | ||
| 57 | <dt> | ||
| 58 | <em>Regions</em> | ||
| 59 | </dt> | ||
| 60 | <dd> | ||
| 61 | Number of regions in the generated map. | ||
| 62 | </dd> | ||
| 63 | <dt> | ||
| 64 | <em>Difficulty</em> | ||
| 65 | </dt> | ||
| 66 | <dd> | ||
| 67 | In ‘Easy’ mode, there should always be at least one region whose colour can be determined trivially. In ‘Normal’ and ‘Hard’ modes, you will have to use increasingly complex logic to deduce the colour of some regions. However, it will always be possible without having to guess or backtrack. | ||
| 68 | <p> | ||
| 69 | In ‘Unreasonable’ mode, the program will feel free to generate puzzles which are as hard as it can possibly make them: the only constraint is that they should still have a unique solution. Solving Unreasonable puzzles may require guessing and backtracking. | ||
| 70 | </p> | ||
| 71 | |||
| 72 | </dd> | ||
| 73 | </dl> | ||
| 74 | |||
| 75 | <hr><address></address></body> | ||
| 76 | </html> | ||