Click here to start the tool using
Java Web Start. If you are having
problems running the tool, ensure that you have the latest version of Java
installed and that it is enabled in your browser. This can be acquired from
Sun's Java website.
Constraint satisfaction problems (CSPs) are pervasive in AI
problems. A constraint satisfaction problem is the problem of
assigning values to variables that satisfy some constraints.
This CSP solver uses stochastic local search algorithms to
attempt to find assignments to the variables which satisfy the
constraints using heuristics in a local neighbourhood.
Please visit our
feedback page and send us your comments about the tools!
This tool was written by Shinjiro Sueda, Mike Pavlin, Saleema Amershi, Regan Yuen, Kyle Porter, and Byron Knoll, with help from Kevin O'Neill, Leslie Tung, Mike Cline, Holger Hoos, Cristina Conati, Peter Gorniak, Alan Mackworth, and David Poole.