Combinatorial Explorations in Su-Doku

Simple item page
dc.creatorChauvet, Jean-Marie
dc.date2008-03-29
dc.date.accessioned2026-07-07T09:29:19Z
dc.date.available2026-07-07T09:29:19Z
dc.descriptionSu-Doku, a popular combinatorial puzzle, provides an excellent testbench for heuristic explorations. Several interesting questions arise from its deceptively simple set of rules. How many distinct Su-Doku grids are there? How to find a solution to a Su-Doku puzzle? Is there a unique solution to a given Su-Doku puzzle? What is a good estimation of a puzzle's difficulty? What is the minimum puzzle size (the number of "givens")? This paper explores how these questions are related to the well-known alldifferent constraint which emerges in a wide variety of Constraint Satisfaction Problems (CSP) and compares various algorithmic approaches based on different formulations of Su-Doku.
dc.identifierhttps://arxiv.org/abs/0803.4253
dc.identifierhttp://arxiv.org/abs/0803.4253
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/157738
dc.subjectArtificial Intelligence
dc.subjectComputational Complexity
dc.subjectI.2.8; F.2.2
dc.titleCombinatorial Explorations in Su-Doku
dc.typetext

Files

Collections

arXiv