Inicio > > Ciencias de la computación > Hierarchical Classifications in Constraint Satisfaction
Hierarchical Classifications in Constraint Satisfaction

Hierarchical Classifications in Constraint Satisfaction

Denis Berthier

33,86 €
IVA incluido
Disponible
Editorial:
Lulu Press
Año de edición:
2023
Materia
Ciencias de la computación
ISBN:
9781446733318
33,86 €
IVA incluido
Disponible

Selecciona una librería:

  • Librería Samer Atenea
  • Librería Aciertas (Toledo)
  • Kálamo Books
  • Librería Perelló (Valencia)
  • Librería Elías (Asturias)
  • Donde los libros
  • Librería Kolima (Madrid)
  • Librería Proteo (Málaga)
Sobre IBD

'Hierarchical Classifications in Constraint Satisfaction' starts by recalling the main universal classifications of the instances of a finite binary Constraint Satisfaction Problem, defined in previous books by the same author, as well as their first applications to the Sudoku case. It then introduces a software (SHC) specially developed by François Cordoliani to implement them in the Sudoku case. Finally, it analyses in detail the classification results thus obtained and it shows that the short SHC computation times suggest to use it in the ongoing search for the 'hardest' puzzles.

Artículos relacionados

Otros libros del autor

  • Hierarchical Classifications in Constraint Satisfaction (Third Edition)
    Denis Berthier
    'Hierarchical Classifications in Constraint Satisfaction (Third Edition)' defines a universal classification system for the instances of any finite Constraint Satisfaction Problem (CSP), the first level of which is their Trial-and-Error depth. It introduces two universal topologies on the set of instances of a CSP, for which all the classifications in the system are continuous;...
    Disponible

    96,35 €

  • Hierarchical Classifications in Constraint Satisfaction (Second Edition)
    Denis Berthier
    'Hierarchical Classifications in Constraint Satisfaction (Second Edition)' defines a universal classification system for the instances of a finite Constraint Satisfaction Problem (CSP). It analyses detailed classification and correlation results for the 9x9 Sudoku CSP and it explores the borders between the different levels of the main classification.Following an analysis of t...
    Disponible

    62,94 €

  • User Manual and Research Notebooks for CSP-Rules
    Denis Berthier
    CSP-Rules is a generic pattern-based (or rule-based) solver of finite binary Constraint Satisfaction Problems (CSPs). This software is available on GitHub and it includes fully developed applications to various logic puzzles such as Sudoku, Latin Squares (allowing their Pandiagonal variant), Futoshiki, Kakuro, Numbrix, Hidato, Slitherlink and Map Colouring.CSP-Rules produces no...
    Disponible

    62,70 €

  • Augmented User Manual for CSP-Rules-V2.1
    Denis Berthier
    This book is the User Manual for CSP-Rules-V2.1, a generic pattern-based (or rule-based) solver of finite binary Constraint Satisfaction Problems (CSPs). The associated software, CSP-Rules-V2.1, is available on GitHub. It includes fully developed applications to logic puzzles such as Latin Squares, Sudoku, Futoshiki, Kakuro, Map Colouring, Numbrix, Hidato and Slithering. This t...
    Disponible

    68,71 €

  • Basic User Manual for CSP-Rules-V2.1 (Second Edition)
    Denis Berthier
    This book is the User Manual for CSP-Rules-V2.1, a generic pattern-based (or rule-based) solver of finite binary Constraint Satisfaction Problems (CSPs). The associated software, CSP-Rules-V2.1, is available on GitHub. It includes fully developed applications to logic puzzles such as Latin Squares, Sudoku, Futoshiki, Kakuro, Map Colouring, Numbrix, Hidato and Slithering. This s...
    Disponible

    32,06 €

  • Pattern-Based Constraint Satisfaction and Logic Puzzles
    Denis Berthier
    'Pattern-Based Constraint Satisfaction and Logic Puzzles (Third Edition)' develops a pure logic, pattern-based perspective of solving the finite Constraint Satisfaction Problem (CSP), with emphasis on finding the 'simplest' solution. Different ways of reasoning with the constraints are formalised by various families of 'resolution rules', each of them carrying its own notion of...