An Optimized Method for Solving Zebra Puzzle
Soroor Salavati, Sahar Hajjarzadeh, Masoud Mazloom · 2009
The zebra puzzle is an important and attractive problem in constraint satisfaction problem (CSP) family. In the last few years several ways have been presented for solving this problem such as backtracking, minimum remaining values (MRV), forward chaining (FC), minimum conflicts, and so on. In this paper the zebra puzzle is considered and a new intelligent method is presented that has more speed in comparison with other methods.