An Approach to a Constraint Satisfaction Problem Using Genetic Algorithm
一个约束可满足性问题的演化算法求解

Constraint satisfaction problems are a large category of complex problems in real world applications, noted for various constraints. Based on the framework of evolutionary algorithm (EA), we solve the zebra-belong-to-who problem, a classical constraint satisfaction problem in this paper. We devise the matrix encoding and its corresponding crossover and mutation operators. Experiments show that EA can solve the problem effectively.