mirror of
git://git.tartarus.org/simon/puzzles.git
synced 2025-04-21 08:01:30 -07:00
Files
9f0dfba5fa
This is a technique I've had on the todo list (and been using by hand) for years: a domino can't be placed if it would divide the remaining area of the grid into pieces containing an odd number of squares. The findloop subsystem is already well set up for finding domino placements that would divide the grid, and the new is_bridge query function can now tell me the sizes of the area on each side of the bridge, which makes it trivial to implement this deduction by simply running findloop and iterating over the output array.
25 lines
618 B
Makefile
25 lines
618 B
Makefile
# -*- makefile -*-
|
|
|
|
DOMINOSA_EXTRA = laydomino dsf sort findloop
|
|
|
|
dominosa : [X] GTK COMMON dominosa DOMINOSA_EXTRA dominosa-icon|no-icon
|
|
|
|
dominosa : [G] WINDOWS COMMON dominosa DOMINOSA_EXTRA dominosa.res|noicon.res
|
|
|
|
ALL += dominosa[COMBINED] DOMINOSA_EXTRA
|
|
|
|
dominosasolver : [U] dominosa[STANDALONE_SOLVER] DOMINOSA_EXTRA STANDALONE
|
|
dominosasolver : [C] dominosa[STANDALONE_SOLVER] DOMINOSA_EXTRA STANDALONE
|
|
|
|
!begin am gtk
|
|
GAMES += dominosa
|
|
!end
|
|
|
|
!begin >list.c
|
|
A(dominosa) \
|
|
!end
|
|
|
|
!begin >gamedesc.txt
|
|
dominosa:dominosa.exe:Dominosa:Domino tiling puzzle:Tile the rectangle with a full set of dominoes.
|
|
!end
|