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
Which of the best method between linear addressing and matrix addressing modes ? Ans: Best Method: Matrix Addressing is the suitable method, since this configuration on

Describe ARP message format in brief.                             0                                        8                                      16

In the previous assignment, you implemented a stack and a list that both inherited from the abstract class ArrayIntCollection. In this task you are supposed to extend that implemen

Explain with the help of examples FIFO algorithms? FIFO policy: This policy easy removes pages in the order they arrived into the main memory. By using this policy we easily

Q. Define Wide Area Network? Wide Area Network (WAN): It takes a large geographical area and frequently owned by a state. Data transfer rate is low (few KBPS to 10 MBPS) and er

Name the various Display devices Different types of display devices are discussed along with the principles on which these work. The main display devices used with CAD systems

Discuss the advantages of Electronics Data Exchange (EDI). Advantages of EDI: Electronics Data Exchange's saves needless re-capture of data. It leads to faster transfer of d

You have been retained to examine how many check-in agents should be used at a check-in counter for a big hotel. During normal business hours, customers arrive at a rate of about 2

What is swapping?   A process can be swapped out temporarily of memory to a backing store and after that brought back in memory for execution as continued.

What is a zombie? When a program forks and the child finishes before the parent, the kernel still keeps some of its information about the child in case the parent might require