aboutsummaryrefslogtreecommitdiff
path: root/html
diff options
context:
space:
mode:
authorSimon Tatham <anakin@pobox.com>2015-01-12 19:51:19 +0000
committerSimon Tatham <anakin@pobox.com>2015-01-12 19:51:19 +0000
commit201b32983b5cd1f904da3614ee9136cfeec59818 (patch)
tree37fb1fe77b6486b5ab6bac64b48090649d0ff378 /html
parentb2f8f5fb5731a14b68372d09153cd6f04d0b7f67 (diff)
downloadpuzzles-201b32983b5cd1f904da3614ee9136cfeec59818.zip
puzzles-201b32983b5cd1f904da3614ee9136cfeec59818.tar.gz
puzzles-201b32983b5cd1f904da3614ee9136cfeec59818.tar.bz2
puzzles-201b32983b5cd1f904da3614ee9136cfeec59818.tar.xz
New puzzle: 'Flood'.
Based on a web game I saw a few years ago, and dashed off this weekend after I thought of a way to write a good (though not quite optimal) heuristic solver, here's a random little thing not quite in the same line as the most usual kind of Puzzles fare: instead of making you scratch your head to find any move to make at all, it's easy to find solutions in principle, and the challenge comes from having to do so within a move limit.
Diffstat (limited to 'html')
-rw-r--r--html/flood.html8
1 files changed, 8 insertions, 0 deletions
diff --git a/html/flood.html b/html/flood.html
new file mode 100644
index 0000000..cf09eac
--- /dev/null
+++ b/html/flood.html
@@ -0,0 +1,8 @@
+Flood
+<p>
+Try to get the whole grid to be the same colour within the given
+number of moves, by repeatedly flood-filling the top left corner in
+different colours.
+<p>
+Click in a square to flood-fill the top left corner with that square's
+colour.