Articles which are no longer updated
The binary constraint satisfaction problem (bcsp) is an important area of research because so many problems can be represented in this form [Kumar92].
Various definitions for selected algorithms against the Zebra and Sherlock problems
This section contains pseudocode of the algorithms used in the paper as well as a brief discussion of each algorithm.
This section outlines the algorithms used to generate the problems the various solving algorithms were tested against.
Conclusions regarding selected algorithms against the Sherlock and Zebra problems.
Bibliography and appendices for selected algorithms against the Zebra and Sherlock problems