mirror of
git://git.tartarus.org/simon/puzzles.git
synced 2025-04-20 23:51:29 -07:00
c108271b44
A user recently mentioned having found even 'Easy' to be harder than they'd like. That difficulty level generates puzzles that can be solved by filling in any square for which the other colour would immediately generate a run of 3, and spotting rows that have the correct total number of one colour and filling in all remaining squares in the other colour. Initially I thought there wasn't much I could do to make the solution techniques easier than that. But after a bit of thought, I decided the second criterion can be weakened a bit. The new 'Trivial' level replaces it with a special case: when a row or column only has _one_ remaining unfilled square, the remaining square is filled in by counting. That version of the rule doesn't require the player to do any counting in order to _spot_ possible applications of it: you can see at a glance that a row or column has only one remaining grey square, even if having seen it you then have to count to work out which colour to fill it in. So it makes a gentler introduction to the game.
This is the README accompanying the source code to Simon Tatham's puzzle collection. The collection's web site is at <https://www.chiark.greenend.org.uk/~sgtatham/puzzles/>. The puzzle collection is built using CMake <https://cmake.org/>. To compile in the simplest way (on any of Linux, Windows or Mac), run these commands in the source directory: cmake . cmake --build . The manual is provided in Windows Help format for the Windows build; in text format for anyone who needs it; and in HTML for the Mac OS X application and for the web site. It is generated from a Halibut source file (puzzles.but), which is the preferred form for modification. To generate the manual in other formats, rebuild it, or learn about Halibut, visit the Halibut website at <https://www.chiark.greenend.org.uk/~sgtatham/halibut/>.