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
Question : a) E-mail is a common feature nowadays in IT. What does it stands for and what is it used for? b) Briefly describe four advantages of using the electronic mail s

Please explain the construction and working of calomel electrode..

(i)  A multiplexer combines four 100-Kbps channels using a time slot of 4 bits. Each Frame has the size of 16 bits. a)  Show the output with the four inputs as shown in the figu

A graph 'G' with 'n' nodes is bipartite if it have  no cycle of odd length.


In which input data does the algorithm quick sort exhibit its worst-case Behaviour? The Quick Sort method exhibits its worst-case behavior when the input data is " Already Comp

Explain Clone process. A clone process is generated using primitive type clone by duplicating its parent process. However unlike traditional processes it might be share its con

What is a Multiplexer Tree? Ans Multiplexer Tree: The largest available MUX IC is 16 to 1. Meeting the larger input requires there must be a provision to expand this. It

In sense of Database Management System (DBMS) LOGICAL DATABASE is a database Structure. False LOGICAL DATABASE is not a database Structure.

The difference among the next and continue verb is that in the continue verb it is used for a situation where there is no EOF condition that is the records are to be accessed again