A new algorithm for solving the quasi group completion problem

摘要

Different search strategies, like Boolean satisfiability (SAT), constraint programming (CP), and integer programming (IP) have been developed to solve classes of combinatorial search problems like the quasi-group completion problem (QCP). This paper proposes a new effective algorithm developed for solving the classic QCP — the Latin-square completion problem. The method is demonstrated by solving some typical Latin-square completion problems and ways to improve upon the algorithm are discussed.