Additions:
The new version features many code improvements, unit tests, less complexity and lots of other stuff. The functionality itself is unchanged though.
Deletions:
The new version features many code improvements, unit tests, les complexity and lots of other stuff. The functionality itself is unchanged though.
Edited on 2006-07-09 18:54:12 by MetalHead [added note about new release]
Additions:
The new version features many code improvements, unit tests, les complexity and lots of other stuff. The functionality itself is unchanged though.
Edited on 2006-04-08 17:57:38 by MetalHead [fixed the bug]
Additions:
The examples included are instances of the n-Queens? problem.
Deletions:
The examples included are instances of the n-Queens? problem. Note that the problem encoding is buggy however -- there may be two queens attacking each other diagonally. Fixing this problem is left as an exercise to the interested reader ;)
Edited on 2006-04-03 14:53:10 by MetalHead [added bug warning]
Additions:
The examples included are instances of the n-Queens? problem. Note that the problem encoding is buggy however -- there may be two queens attacking each other diagonally. Fixing this problem is left as an exercise to the interested reader ;)
Deletions:
The examples included are instances of the n-Queens? problem.
Edited on 2006-04-03 14:42:29 by MetalHead [added n-queens reference]
Additions:
The examples included are instances of the n-Queens? problem.
Oldest known version of this page was edited on 2006-04-03 14:37:20 by MetalHead [initial setup]
Page view:
Constraint Problem Solver
Another university assignment, for a module called Constraint Programming. It implements backtrack, forward checking and two MAC algorithms for constraint problem solving with binary constraints. There's also a parser for the problem definition language and a GUI. And there's even a manual!
| Attachment | Size | Date Added | |
| constraints.tar.gz | 113.57 KB | 3/10/2007 5:15 pm | |
CategoryCode
CategoryJava