Talk:Zebra problem
From Wikipedia, the free encyclopedia
The zebra problem was the foundation of much early work in constraint satisfaction, an important area of current artificial intelligence research. Indeed, one recent highly-regarded, much cited paper tested a variety of approaches on (perturbed versions of) this single problem: 2001, C. Bessière & J.-C. Régin: Refining the basic constraint propagation algorithm, JFPLC, pp.1-13. Moreover, it is an accessible, rather than abstract and mathematical, example of constraint satisfaction that many people find intriguing.
Susan Epstein, Department of Computer Science, Hunter College / CUNY

