mirror of
git://git.tartarus.org/simon/puzzles.git
synced 2025-04-21 16:05:44 -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]
26 lines
570 B
Makefile
26 lines
570 B
Makefile
# -*- makefile -*-
|
|
|
|
GROUP_LATIN_EXTRA = tree234 maxflow
|
|
GROUP_EXTRA = latin GROUP_LATIN_EXTRA
|
|
|
|
group : [X] GTK COMMON group GROUP_EXTRA group-icon|no-icon
|
|
|
|
group : [G] WINDOWS COMMON group GROUP_EXTRA group.res|noicon.res
|
|
|
|
groupsolver : [U] group[STANDALONE_SOLVER] latin[STANDALONE_SOLVER] GROUP_LATIN_EXTRA STANDALONE
|
|
groupsolver : [C] group[STANDALONE_SOLVER] latin[STANDALONE_SOLVER] GROUP_LATIN_EXTRA STANDALONE
|
|
|
|
ALL += group[COMBINED] GROUP_EXTRA
|
|
|
|
!begin gtk
|
|
GAMES += group
|
|
!end
|
|
|
|
!begin >list.c
|
|
A(group) \
|
|
!end
|
|
|
|
!begin >wingames.lst
|
|
group.exe:Group
|
|
!end
|