Completely re-engineered version of Loopy, courtesy of Lambros
authorsimon <simon@cda61777-01e9-0310-a592-d414129be87e>
Sat, 6 Sep 2008 15:19:47 +0000 (15:19 +0000)
committersimon <simon@cda61777-01e9-0310-a592-d414129be87e>
Sat, 6 Sep 2008 15:19:47 +0000 (15:19 +0000)
commit7c95608a9a2aa26532f12f8ca41bf2aa1402b4e1
tree9290783571144d5e3d4380f586147e931ba8b211
parentfa3abef5abe95dd9668a87b1cc57a724dcbf6354
Completely re-engineered version of Loopy, courtesy of Lambros
Lambrou. Now capable of handling triangular and hexagonal grids as
well as square ones, and then a number of semiregular plane tilings
and duals of semiregular ones. In fact, most of the solver code
supports an _arbitrary_ planar graph (well, provided both the graph
and its dual have no self-edges), so it could easily be extended
further with only a little more effort.

git-svn-id: svn://svn.tartarus.org/sgt/puzzles@8162 cda61777-01e9-0310-a592-d414129be87e
grid.c [new file with mode: 0644]
grid.h [new file with mode: 0644]
loopy.R
loopy.c
puzzles.but