IMCS/Publications/CSJM/Issues/CSJM v.29, n.1 (85), 2021/

A Sublinear Sudoku Solution in cP Systems and its Formal Verification

Authors: Yezhou Liu, Radu Nicolescu, Jing Sun, Alec Henderson
Keywords: cP~systems, P~systems, Sudoku problem, NP-complete problem, 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 \times 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.

Institution: The University of Auckland
Address: SCIENCE CENTRE 303S - Bldg 303S, Level 5, Room 596, 38 PRINCES
ST, AUCKLAND, New Zealand 1010
E-mail: , , ,


Adobe PDF document0.30 Mb