Search methods and heuristics - artificial intelligence, Computer Engineering

Search Methods and Heuristics - Artificial intelligence:

Here now we come to the question of how constraint solvers search for solutions -constraint preserving coursework of values to variables - for the CSPs they are given. In fact the most obvious approach is to utilize a depth first search as: assign a value there to the first variable and in which check whether this assignment doesn't break any constraints. After then, move at to the next variable and then assign it a value and check that this doesn't break any constraints so then move at to the next variable and so on. Where an assignment does break a constraint after then choose a different value for the assignment until one is found that satisfies the constraints. Whether one cannot be found then this is where the search must backtrack. However in such a situation there the previous variable is looked at again and so the next value for it is tried. Furthermore in this way, all possible sets of assignments that, will be tried for a solution be found. So therefore the following search diagram - taken from Smith's tutorial paper - shows that how the search for a solution to the 4-queens problem progresses until it finds a solution as: 

211_Search Methods and Heuristics.png

Conversely we see that the first time it backtracks is after the failure to put a queen in row three given queens in positions as (1,1) and (2,3). Moreover in this case there it backtracked and move the queen in as (2,3) to (2,4). Ultimately, this didn't work out either then it had to backtrack further and then moved the queen in as (1,1) to (1,2). Alternatively this led fairly quickly to a solution.

Posted Date: 1/12/2013 5:58:46 AM | Location : United States







Related Discussions:- Search methods and heuristics - artificial intelligence, Assignment Help, Ask Question on Search methods and heuristics - artificial intelligence, Get Answer, Expert's Help, Search methods and heuristics - artificial intelligence Discussions

Write discussion on Search methods and heuristics - artificial intelligence
Your posts are moderated
Related Questions
Minimize the logic function F(A, B, C, D) = ∑ m(1,3,5,8,9,11,15) + d(2,13) using NAND gate with help of K-map. Ans. Realization of given expression by using NAND gates:  In

Answering Systems / Database Query There are a large number of opportunities for get faster through parallelizing a Database Management System (DBMS). However, the actual purpo

What are the steps in multiplication algorithm?   Check for zeros.   Multiply mantissas   Add the exponents.   Normalize the product.

The combination of an IP address and a port number is known as a socket.

What is Verilog Verilog  language  is  still  rooted  in  it's  native  interpretative  mode.  Compilation  is  a means of speeding up simulation however has not changed the or

Q. Explain Structure of Control Unit? A control unit has a set of input values on the foundation of which it produces an output control signal which in turn performs micro-ope

Q. Evaluation Stack Architecture? A stack is a data structure which implements Last-In-First-Out (LIFO) access policy. You can add an entry to the with a PUSH(value) as well as

Application Using Shift Operations Rotate and Shift instructions are helpful even for division andmultiplication. These operations are not normally available in high-level lang


Determine the Object Design of Object oriented modelling Object Design:   At this phase, a design model is created based on the analysis model which is already created in the