aboutsummaryrefslogtreecommitdiff
path: root/map.c
diff options
context:
space:
mode:
authorSimon Tatham <anakin@pobox.com>2018-04-21 16:51:03 +0100
committerSimon Tatham <anakin@pobox.com>2018-04-22 17:04:50 +0100
commitdcc4d82b23095b07673d7c13cb2439c738a67fa1 (patch)
tree52ef427c20bedecabea80a93cd6b3d70b8927897 /map.c
parent000ebc50785c5c066465fc17668ae64975188d04 (diff)
downloadpuzzles-dcc4d82b23095b07673d7c13cb2439c738a67fa1.zip
puzzles-dcc4d82b23095b07673d7c13cb2439c738a67fa1.tar.gz
puzzles-dcc4d82b23095b07673d7c13cb2439c738a67fa1.tar.bz2
puzzles-dcc4d82b23095b07673d7c13cb2439c738a67fa1.tar.xz
Convert Tents to use matching instead of maxflow.
Tents needs to construct maximal matchings in two different situations. One is the completion check during play, in which the existence of a perfect matching between tents and trees is part of the win condition; the other is the initial grid generation, in which we find a _maximal_ matching between the tents we've already placed and all the possible neighbouring squares that are candidates for the tree positions. Both of those are switched over.
Diffstat (limited to 'map.c')
0 files changed, 0 insertions, 0 deletions