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
Q Convert the following DECIMAL numbers into HEXADECIMAL, double check by converting the result HEXADECIMAL to DECIMAL. a)    24 b)   547.56

Define data path. The registers, the ALU, and the interconnecting bus are collectively referred to as the data path.

What is a Spool request? Spool requests are formed during dialog or background processing and placed in the spool database with information about the printer and print format.

An amplifier has an input resistance of 600 ohms and a resistive load of 75 ohms. When it has an rms input voltage of 100 mV, the rms output current is 20mA. Find the gain in dB.

What is a flip-flop? Ans. Flip-flop is particular bit memory cell. This stores individual bit information in its true and compliment form. It is the basic block of any sequ

What are the differences between SIMULATION and SYNTHESIS Simulation synthesis Simulation is used to verify functionality of the circuit.. a) Functional Simulation:stud

Q. Explain about Dual In line Memory Modules? A DIMM is capable of delivering 64 data bits right away. Usual DIMM capacities are 64MB and up. Every DIMM has 84 gold patted conn

How the at-user command serves mainly in lists? The AT USER-COMMAND event serves mostly to handle own function codes.  In this case, you should make an individual interface wit

what is opcode for addition and subtraction

Main problems with evaluation functions: Superlatively, evaluation functions should be quick calculates. Wherever is chance they take a long time to estimate, so after then le