Constraint programming is helpful, but it seems
reserved to some elite able to understand complex constraint programming
languages. We believe in an approach with no impedance mismatch between
buisness objects and constraints definition.

We intend to provide a generic Java implementation of the Adaptative
Search Algorithm, which offers interesting performance promises.
The API will rely on pattern language (avoiding programmers to
learn one more constraint language), with respect of type safety (no typecasts
whenever possible).
The samples will be an important part of the releases, since we
address to non-specialists of constraint programming.
A graphical monitoring tool will help understanding the behavior
of the engine, for pedagogical and optimization purposes.

Our vision

We hope WASA to become a pedagogical support for showing what the stochastic
approach for constraint programming can do. We hope it to be a useful
tool for real-world problems as well.