mirror of
git://git.tartarus.org/simon/puzzles.git
synced 2025-04-20 07:31:30 -07:00
5eea14c6c3
Reproduced via 'groupsolver -v 5i:p1g4' (thanks to Arun Giridhar for the report). The Group-specific solver_hard() function ruled out a bunch of possibilities by deducing various things that couldn't be the group identity, but forgot to set done_something = true, so that it return 0 claiming it hadn't done anything. So latin_solver_top progressed to the next difficulty level and tried recursion. And latin_solver_recurse failed an assertion because it was surprised to find a cell with only one possibility - it expected that the _simple_ deductions would have ruled out any of those, which they would have if solver_hard() had returned >0, because the loop would have reset to the top and tried the easy deductions again after solver_hard() had given them something to work with.
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/>.