Algoritmos híbridos para la resolución de Sudokus

Translated title of the contribution: Hybrid algorithms for solving Sudokus

Ricardo Soto, Cristian Galleguillos, Natalia Nino, Broderick Crawford, Fernando Paredes

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

Abstract

The aim of the Sudoku puzzle is filling with digits from 1 to 9 into each cell of a square matrix with 9 rows and 9 columns, divided into 9 3 × 3 regions, so that each column, row, and region contains have different values. This paper reports recent results for solving Sudokus achieved by combining metaheuristics and AC3 which is a filtering technique coming from the constraint programming domain.

Translated title of the contributionHybrid algorithms for solving Sudokus
Original languageSpanish
Title of host publication2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9789899843455
DOIs
StatePublished - 28 Jul 2015
Event10th Iberian Conference on Information Systems and Technologies, CISTI 2015 - Aveiro, Portugal
Duration: 17 Jun 201520 Jun 2015

Publication series

Name2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015

Conference

Conference10th Iberian Conference on Information Systems and Technologies, CISTI 2015
Country/TerritoryPortugal
CityAveiro
Period17/06/1520/06/15

Fingerprint

Dive into the research topics of 'Hybrid algorithms for solving Sudokus'. Together they form a unique fingerprint.

Cite this