aboutsummaryrefslogtreecommitdiff
path: root/dsf.c (follow)
Commit message (Collapse)AuthorAge
* New puzzle! 'Keen', a clone of KenKen.Simon Tatham2009-12-27
| | | | [originally from svn r8796]
* Tweak the semantics of dsf_merge() so that the canonical element ofSimon Tatham2009-12-27
| | | | | | | | | any equivalence class is always the element with the smallest index. This is slower (the previous behaviour, suggested by Jonas Koelker, was to choose the new root element to maximise performance), but still more than acceptably fast and more useful. [originally from svn r8792]
* New puzzle: `Filling', a Fillomino implementation by Jonas Koelker.Simon Tatham2007-02-25
| | | | [originally from svn r7326]
* James H's Palm-compatibility updates to the latest Loopy changes,Simon Tatham2006-11-01
| | | | | | | working around bugs in the Palm compiler and removing Palm- incompatible diagnostics such as fprintf. [originally from svn r6889]
* r6880 accidentally backed out r6780. That's what I get for acceptingSimon Tatham2006-10-29
| | | | | | | | | source files from Mike rather than patches, and not adequately checking the result... [originally from svn r6882] [r6780 == f05c25347d66821d928668a7e87dffbf3ffed027] [r6880 == b9547673c6462bf73e642328300479df6df71d7b]
* Mike Pinna has done some major reworking of the Loopy solver, givingSimon Tatham2006-10-28
| | | | | | rise to a new Hard difficulty level. [originally from svn r6880]
* Extra utility function.Simon Tatham2006-08-05
| | | | [originally from svn r6780]
* Cleanups from James H: a few missing statics, a precautionary castSimon Tatham2005-08-03
| | | | | | | | | or two, a debugging fix, a couple of explicit initialisations of variables that were previously read uninitialised, and a fix for a whopping great big memory leak in Slant owing to me having completely forgotten to write free_game(). [originally from svn r6159]
* New puzzle: `Slant', picked from the Japanese-language section ofSimon Tatham2005-08-02
nikoli.co.jp (which has quite a few puzzles that they don't seem to have bothered to translate into English). Minor structural change: the disjoint set forest code used in the Net solver has come in handy again, so I've moved it out into its own module dsf.c. [originally from svn r6155]