Overlapping Alldifferent Constraints and the Sudoku puzzle - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Overlapping Alldifferent Constraints and the Sudoku puzzle

(1) , , (1) , ,
Eric Monfroy
Broderick Crawford
  • Fonction : Auteur
Carlos Castro
  • Fonction : Auteur
  • PersonId : 755554
  • IdRef : 142760811


Combinatorial problems can be modeled as constraint satisfaction problems (CSP). Modeling and resolution of CSP is often strengthened by global constraints (e.g., Alldiff constraint). We propose a formal system and some propagation rules for reducing domains of variables appearing in several Alldiff global constraints. We illustrate our approach on the well-known Sudoku puzzle which presents 27 overlapping Alldiffconstraints in its 9 x 9 standard size. We also present some preliminary results we obtained in CHR and GeCode.

Fichier non déposé

Dates et versions

hal-03350621 , version 1 (21-09-2021)


  • HAL Id : hal-03350621 , version 1
  • OKINA : ua4477


Frédéric Lardeux, Eric Monfroy, Frédéric Saubion, Broderick Crawford, Carlos Castro. Overlapping Alldifferent Constraints and the Sudoku puzzle. XXXIV Conferencia Latinoamericana de Informatica, CLEI 2008, 2008, Santa Fe, Argentina. 10 - p. ⟨hal-03350621⟩


4 Consultations
0 Téléchargements


Gmail Facebook Twitter LinkedIn More