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 \times m$ cells grouped in $m$ blocks. By using a fixed constant number of rules, our cP~system can solve all Sudoku puzzles in subline...

Full description

Saved in:
Bibliographic Details
Published inComputer science journal of Moldova Vol. 29; no. 1(85); pp. 3 - 28
Main Authors Yezhou Liu, Radu Nicolescu, Jing Sun, Alec Henderson
Format Journal Article
LanguageEnglish
Published Vladimir Andrunachievici Institute of Mathematics and Computer Science 01.04.2021
Subjects
cp~systems
formal verification
np-complete problem
p~systems
sudoku problem
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1561-4042