A fill-in puzzle solver written in prolog using constraint logic programming.
Call the main predicate with the puzzle, wordlist and desired output file. Samples are provided in the samples directory.
Puzzles must be supplied as a text document, using _ to represent empty blocks, and # filled blocks, with each line of the file representing one row of the puzzle.
Word lists are newline-separated text documents, containing a case-sensitive word on each line.
$ swipl
?- [proj2]
?- main(samples/puzzle1, samples/words1, out)