CIS*4750 Course Project

A Study of Selected Algorithms Against the Sherlock and Zebra Problems

Daniel F. Dickinson


Table of Contents
1. Introduction
2. General Definitions
3. Problem Definitions
4. Algorithms
4.1. Definitions for the Algorithms
4.2. Achieving Arc Consistency: AC-3
4.3. Backmarking with Conflict-Directed Backjumping 2: BM-CBJ2
4.4. Genetic Algorithms
4.5. Generate Random Problems
5. Results
5.1. Hypotheses 1 and 2
5.2. Hypotheses 3 and 4
5.3. Hypothesis 5
6. Conclusions and Future Work
Bibliography
A. Sample Sherlock Problem