mirror of
git://git.tartarus.org/simon/puzzles.git
synced 2025-04-21 08:01:30 -07:00
Files
e862d4a79b
I've removed the old algorithm (the one described as 'footpath dsf' in the findloop.c appendix comment, though I hadn't thought of that name at the time), and replaced it with calls to the new API. This should have no functional effect: there weren't any known bugs in the previous loop-finder that affected currently supported play modes. But this generality improvement means that non-orientable playing surfaces could be supported in the future, which would have confused the old algorithm. And Net, being the only puzzle as yet that's played on a torus, is perhaps the one most likely to want to generalise further at some point.
24 lines
516 B
Makefile
24 lines
516 B
Makefile
# -*- makefile -*-
|
|
|
|
NET_EXTRA = tree234 dsf findloop
|
|
|
|
net : [X] GTK COMMON net NET_EXTRA net-icon|no-icon
|
|
|
|
# The Windows Net shouldn't be called `net.exe' since Windows
|
|
# already has a reasonably important utility program by that name!
|
|
netgame : [G] WINDOWS COMMON net NET_EXTRA net.res|noicon.res
|
|
|
|
ALL += net[COMBINED] NET_EXTRA
|
|
|
|
!begin am gtk
|
|
GAMES += net
|
|
!end
|
|
|
|
!begin >list.c
|
|
A(net) \
|
|
!end
|
|
|
|
!begin >gamedesc.txt
|
|
net:netgame.exe:Net:Network jigsaw puzzle:Rotate each tile to reassemble the network.
|
|
!end
|