mirror of
git://git.tartarus.org/simon/puzzles.git
synced 2025-04-22 16:32:13 -07:00
Files
c91471e6c1
you are given a partially specified Cayley table of a small finite group, and must fill in all the missing entries using both Sudoku- style deductions (minus the square block constraint) and the group axioms. I've just thrown it together in about five hours by cloning- and-hacking from Keen, as much as anything else to demonstrate that the new latin.c interface really does make it extremely easy to write new Latin square puzzles. It's not really _unfinished_, as such, but it is just too esoteric (not to mention difficult) for me to feel entirely comfortable with adding it to the main puzzle collection. I can't bring myself to throw it away, though, and who knows - perhaps a university maths department might find it a useful teaching tool :-) [originally from svn r8800]
This subdirectory contains puzzle implementations which are half-written, fundamentally flawed, or in other ways unready to be shipped as part of the polished Puzzles collection. Those puzzles which have .R files can be built as part of the Puzzles collection by symlinking their source files into the parent directory and re-running mkfiles.pl. Anything without a .R file isn't even finished enough to do that, and you should read the source file itself to find out the status.