ref: f43c5c92801c7a10e95d2b4953ded61a96ce891b
parent: 41d9b1aab596ef42447fa704c632e74d7ca287ab
author: Jacob Nevins <jacobn@chiark.greenend.org.uk>
date: Sat Jan 13 14:19:21 EST 2007
Formatting tweaks / index terms in Unequal docs. [originally from svn r7105]
--- a/puzzles.but
+++ b/puzzles.but
@@ -2078,7 +2078,7 @@
\cfg{winhelp-topic}{games.unequal}You have a square grid; each square may contain a digit from 1 to
-the size of the grid, and some squares have greater-signs between
+the size of the grid, and some squares have greater-than signs between
them. Your aim is to fully populate the grid with numbers such that:
\b Each row contains only one occurrence of each digit
@@ -2087,11 +2087,11 @@
\b All the greater-than signs are satisfied.
-In 'Trivial' mode, there are no greater-than signs; the puzzle is
-to solve the latin square only.
+In \q{Trivial} mode, 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 'Futoshiki'.
+weekly under the name \q{\i{Futoshiki}}.Unequal was contributed to this collection by James Harvey.
@@ -2137,7 +2137,7 @@
\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
+there are no greater-than signs (the puzzle is to solve the Latin
square only); at Tricky level, some recursion may be required (but the
solutions should always be unique).