simple constraint problem solver

Some day i needed to build a constraint solver for my dayjob. So i started out by trying some different approaches. The one i present here is not the one, i finally took, but it's one of the shortest. It's inefficient but a nice piece of code to play around with or build larger systems, that get the backtracking more accurate. One could e.g. implement pruning strategie to get arch-consistency or do some form of intelligent backtracking.

All you need for this is a working scheme implementation wich provides the amb-operator and some of the convenience-procedures. This was tested and built with chicken-scheme and the amb.egg

Please login to post comments.

Page 1 of 1

Solving the N-Queens-Problem Part I
Recursive Lambdas with the Y and U Combinator
down the tree
simple constraint problem solver

Splitting a list recursively in Scheme
Genetic Algorithm for solving the N-Queens problem
Converting from infix notation to prefix and postfix notation
Factoring numbers
Path Finding

Genetic Algorithm for solving the N-Queens problem
Splitting a list recursively in Scheme
down the tree
Solving the N-Queens-Problem Part I
Factoring numbers