
Create and solve constraint satisfaction problem.
A constraint satisfaction problem, or CSP, is a problem which can be expressed as a set of variables, each with a particular domain, and a set of constraint relations between variables. A solution to a CSP is an assignment of a unique value to each variable such that all the of the constraint relations are satisfied.
Consistency Based CSP Solver is a handy, easy to use application specially designed to enable you to create such a problem and solve it using a consistency based algorithm with backtracking.
Requirements:
· Java
Consistency Based CSP Solver is a handy, easy to use application specially designed to enable you to create such a problem and solve it using a consistency based algorithm with backtracking.
Requirements:
· Java

Developer:![]() License / Price: ![]() Size / OS: ![]() Last Updated: ![]() | AIspace ![]() Freeware / FREE ![]() 327 KB / Windows All ![]() August 21st, 2010 |
Download: | Consistency Based CSP Solver 4.6.0 |
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.