Using Graphs to Derive CSP Heuristics and its Application to Sudoku

This paper presents a general purpose methodology to derive new heuristics for constraint satisfaction problems using the information contained in an auxiliary graph. The method is then applied to implement a powerful heuristic for Sudoku which is `almost perfect' in the sense that a depth firs...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	San Segundo, P., Jimenez, A.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Artificial intelligence constraint satisfaction Filling Filters graphs heuristics Intelligent control Logic testing Shape Sudoku Turning value ordering variable ordering
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!