mirror of
git://git.tartarus.org/simon/puzzles.git
synced 2025-04-22 00:15:46 -07:00
Files
201b32983b
Based on a web game I saw a few years ago, and dashed off this weekend after I thought of a way to write a good (though not quite optimal) heuristic solver, here's a random little thing not quite in the same line as the most usual kind of Puzzles fare: instead of making you scratch your head to find any move to make at all, it's easy to find solutions in principle, and the challenge comes from having to do so within a move limit.
20 lines
296 B
Makefile
20 lines
296 B
Makefile
# -*- makefile -*-
|
|
|
|
flood : [X] GTK COMMON flood flood-icon|no-icon
|
|
|
|
flood : [G] WINDOWS COMMON flood flood.res|noicon.res
|
|
|
|
ALL += flood[COMBINED]
|
|
|
|
!begin am gtk
|
|
GAMES += flood
|
|
!end
|
|
|
|
!begin >list.c
|
|
A(flood) \
|
|
!end
|
|
|
|
!begin >gamedesc.txt
|
|
flood:flood.exe:Flood:Flood-filling puzzle
|
|
!end
|