A Study of algorithms for Sherlock and Zebra

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 testing selected algorithms against the Zebra and Sherlock problems, viewed as a binary constraint satisfaction problem

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 the testing of selected algorithms against the Sherlock and Zebra problems, when handled as a binary constraint satisfaction problem.