Implementation of Strategies for Solving Constraint Satisfaction Problems
2015
0 views
0 downloads
Advisor: Rashad Aliyev
Abstract (EN)
This thesis investigates the different strategies for solving constraint satisfaction problems. The basic properties of constraint satisfaction problems are discussed. The different types of constraints are given. The constraint graph and cryptarithmetic constraint satisfaction problems are discussed. Such search techniques as backtracking search, local search, and constraint propagation for solving constraint satisfaction problems are presented. The forward checking in constraint satisfaction problems is used. Some constraint satisfaction problems such as map-coloring problem, cryptarithmetic problem, n-queens problems and Sudoku problem are solved. Keywords: Constraint satisfaction problem, Constraint graph, Backtracking search, n-queens problem, Local search, Constraint propagation, Forward checking
Author
Dr. Zewar Fadhlulddin Hasan
How to Cite
Zewar Fadhlulddin Hasan (Master Thesis). Implementation of Strategies for Solving Constraint Satisfaction Problems, 2015, Eastern Mediterranean University, Department of Mathematics.
Keywords
License
Tüm Hakları Saklıdır
This work is shared under the specified license terms.
More theses from Eastern Mediterranean University
- An Investigation on Time and Cost Overrun in Construction Projects(2012)
- Radial Power-Law Position-dependent Mass, Cylindrical Coordinates, Spectral Signatures(2015)
- Predicting performance level of reinforced concrete structures subject to corrosion as a function of time(2012)
- Discussion of Conservation Approaches for the Selected Heritage Buildings in the Walled City of Famagusta(2019)
- High School Students' Learning Styles in North Cyprus(2011)
- Afyonkarahisar İl Merkezinde Yaşayan 18 Yaş ve Üzeri Kadınların Diyet Posasıyla İlgili Bilgi Düzeylerinin ve Posa Alım Miktarlarının Belirlenmesi(2018)