A filtering technique for helping to solve sudoku problems

RICARDO JAVIER SOTO DE GIORGIS, BRODERICK CRAWFORD LABRIN, Cristian Galleguillos, Kathleen Crawford, Fernando Paredes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper highlights the current usability issues when solving Sudoku problems. This problem is a well-known puzzle game which consists in assigning numbers in a game board, commonly of 9 × 9 size. The board of the game is composed of 9 columns, 9 rows and 9 3 × 3 sub-grids; each one containing 9 cells with distinct integers from 1 to 9. A game is completed when all cells have a value assigned, and the previous constraints are satisfied. Some instances are very difficult to solve, to tackle this issue, we have used a filtering technique named Arc Consistency 3 (AC3) from the Constraint Programming domain. This algorithm has revealed which is much related to the strategies employed by users in order to solve the Sudoku instances, but in contrast, this technique is executed in a short time, offering a good resolution guide to the users. In general, filtering techniques make easier solving Sudoku puzzles, providing good information to users for this.

Original languageEnglish
Title of host publicationHCI International 2015 – Posters Extended Abstracts - International Conference, HCI International 2015, Proceedings
EditorsConstantine Stephanidis
PublisherSpringer Verlag
Pages598-603
Number of pages6
ISBN (Print)9783319213798
DOIs
StatePublished - 1 Jan 2015
Event17th International Conference on Human Computer Interaction, HCI 2015 - Los Angeles, United States
Duration: 2 Aug 20157 Aug 2015

Publication series

NameCommunications in Computer and Information Science
Volume528
ISSN (Print)1865-0929

Conference

Conference17th International Conference on Human Computer Interaction, HCI 2015
Country/TerritoryUnited States
CityLos Angeles
Period2/08/157/08/15

Keywords

  • Arc consistency
  • Constraint programming
  • Sudoku

Cite this