A Sublinear Sudoku Solution In Cp Systems And Its Formal Verification

Sudoku is known as a NP-complete combinatorial number-placement puzzle. In this study, we propose the first cP system solution to generalised Sudoku puzzles with m x m cells grouped in m blocks. By using a fixed constant number of rules, our cP system can solve all Sudoku puzzles in sublinear steps. We evaluate the cP system and discuss its formal verification.