Implementation of Strategies for Solving Constraint Satisfaction Problems
Is this your thesis?
This record came from a bulk archive import. If it’s yours, link it to your profile.
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
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
- Predicting performance level of reinforced concrete structures subject to corrosion as a function of time(2012)
- An Investigation on Time and Cost Overrun in Construction Projects(2012)
- Radial Power-Law Position-dependent Mass, Cylindrical Coordinates, Spectral Signatures(2015)
- Approaching a Successful Interior Design Atmosphere for Retail Clothing Stores Case of Dereboyu Street, Lefkoşa(2017)
- Disappointment and Dystopic Fear in Franz Kafka’s The Trial(2017)
- The Effects of Video Games on Reaction Times(2019)