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...
| Váldodahkkit: | , , , |
|---|---|
| Materiálatiipa: | Artihkal |
| Giella: | English |
| Almmustuhtton: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2021-04-01
|
| Ráidu: | Computer Science Journal of Moldova |
| Fáttát: | |
| Liŋkkat: | http://www.math.md/files/csjm/v29-n1/v29-n1-(pp3-28).pdf |