Hill climbing - artificial intelligence, Computer Engineering

Hill Climbing - Artificial Intelligence:

As we've seen, in some problems, finding the search path from primary to goal state is the point of the exercise. In other problems, the path and the artefact at the end of the path are both important, and we regularly try to find optimal solutions. Just for a certain set of problems, the path is irrelevant and finding appropriate artefact is the sole purpose of the search. In such cases, it doesn't be matter whether our agent searches down a path for 10 or 1000 steps, as long as it may be finds a solution in the end.

For example, consider the 8-queens problem in which we decided where the task is to find an sequence of 8 queens on a chess board such that no one can "take" another (one queen can take another if it's on the same horizontal, vertical or diagonal line. A Solution for this type of problem is:

One possible way to justify this problem is with states where there are a number of queens (1 to 8) on the board, and an action is to add a queen in this like a way that it can't take another. Its tottaly depending on your strategy, you may find that the search needs much more back-tracking, i.e., towards the end, and you find that you simply can't put the last queens on anywhere, so that you have to move one of the queens you put down earlier (you go back-up the search tree).

Posted Date: 1/10/2013 4:32:51 AM | Location : United States







Related Discussions:- Hill climbing - artificial intelligence, Assignment Help, Ask Question on Hill climbing - artificial intelligence, Get Answer, Expert's Help, Hill climbing - artificial intelligence Discussions

Write discussion on Hill climbing - artificial intelligence
Your posts are moderated
Related Questions
Sometime you may have to reset your computer (i.e., Reboot DOS) when it is still running because DOS does not work accurately. To reset your computer you have two choices: 1. P

Write short note on Associated vs. Common channel signaling. Associated vs Common channel signalling: The out band signalling suffers from the very restricted bandwidth.

Unification: As just above this we have said that the rules of inference for propositional logic detailed in the last lecture can also be required in first-order logic. Moreov

Q. Design a 3-bit counter using sequential logic with following counting sequence using JK- flip-flops which counts the sequence 0, 3, 2, 7, 5 and repeat.

Q. Illustrate the working of Encoders? An Encoder performs reverse function of decoder. An encoder has 2n input lines and 'n' output line. Let's see 8 ×3 encoder that encodes 8

Higher Order Predicate Logic: In first order predicate logic, we are allowed to quantify over objects only. If we let  ourselves  to  quantify  over  predicate  or  function  s

What is concurrent control? Control resides concurrently in various independent objects, every a separate task. A task can wait for input but other task continues implementatio

WAR (write after read) - Data hazards in computer architecture: WAR (write after read) - j tries to write at destination before it is read by i , hence i  wrongly gets the n

The Transaction object is responsible for reading the transaction file, finding the relevant account in the array of customers and applying the transaction. To find the relevant ac

a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points can be foun