Exploring A Better Way to Constraint Propagation Using Naked Pair
Sudoku is an NP-complete problem therefore developing various efficient algorithms is crucial. This paper presents an enhanced approach to solving sudoku puzzles by improving on recursive backtracking with constraint propagation and bitmask, focusing on the implementation of the naked pair technique...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2025-01-01
|
| Series: | ITM Web of Conferences |
| Online Access: | https://www.itm-conferences.org/articles/itmconf/pdf/2025/01/itmconf_dai2024_04025.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|