Hill climbing - artificial intelligence , Basic Computer Science

Hill Climbing - artificial intelligence:

As we've seen, in some particular problems, searching the search path from primly to goal state is the point of the exercise. In another problem, the path and the artefact at the end of the path are both important, and we often try to find optimal solutions. For a sure set of problems, the path is immaterial, and finding a suitable artefact is the sole purpose of the search. In these types of cases, it doesn't matter whether our agent searches a path for ten or thousand steps, so long as it finds a solution in the end.

Take an example of the 8-queens problem, where the job is to find an arrangement of 8 queens on a chess board likewise that no one can "take" another (one queen can take another if it's on the same horizontal, vertical or diagonal line). A solution to this problem is:

 

287_Hill Climbing.png

One way to describe this problem is with states where there are many queens (1 to 8) on the board, and an action is to add a queen in that kind of way that it can't take another. Depending on your method, you can find that this search requires much back-tracking, for example , towards the end, you find that you  just simply can't put the last queens on anywhere, so you have to move one of the queens you put down earlier (you go back-up the search tree).

Another way of specifying the problem is that the states are boards with eight queens already on them, and a stroke is a movement of one of the queens. In this particular case, our agent might be use an evaluation function and do hill climbing. i.e., it measures the number of pairs of queens where one can take the other and only moves a queen if that movement reduces the number of pairs. When there is an option of movements both resulting in same amount of decrease, the agent may select one arbitrarily from the option. In the 8-queens problem, there are just 8 * 56 = 448 probable ways to move one queen, so our agent only has to calculate the evaluation function 448 times at each stage. If it just selected moves where the situation with respect to the evaluation function improves, it is doing hill climbing (or gradient descent if it's better to think of the agent going downhill rather than uphill).

A general problem with this search method is local maxima: the search has not yet reached a solution, but it can just go downhill in terms of the evaluation function. I.e., we might get to the stage where only 2 queens may take each other, but moving any queen increases this number to at least three. In such a cases, the agent may do a random re-start whereby they randomly choose a state to start the complete process from again. This search scheme has the appeal of never requiring storing more than one state at any one time (the part of the hill the agent is on). Russell and Norvig make the analogy that this kind of search is like trying to climb Everest in the fog with amnesia, but they do concede that it is frequently the search strategy of option for some industrial problems.Local/Global Maxima/Minima are represented in the diagram below:

899_Hill Climbing1.png

Posted Date: 10/2/2012 2:51: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
Chat: The word chat in English language means - casual conversation. On Internet it means the same, except that you need to use text and your keyboard skills are tested. Earli

Depth First Search-Artificial intelligence: Depth first search is  similar to breadth first, except that things are added to the top of the plan rather than the bottom. In our

what is multiplaxer and truth table, digram

Because it is enormously low level, assembly language can be optimized enormously well. Therefore assembly language is used where the extreme performance is needed for applications

A* Search-Artificial intelligence:   A* search combines the best parts of uniform cost search that  called the fact that it's optimal and complete, and the best parts of gre

Question 1 What is role playing game? Explain the special design issues for sports games Question 2 What do you mean by collusion? Explain its types Question 3 Wri

You have been approached by Company XYZ to design and deploy a new network that will span three cities in Queensland: Brisbane (12 users), Gold Coast (8 users), and Cairns (6 users

Ask quwhat is binary estion #Minimum 100 words accepted#

Question 1 What are the various skills needed for broadcasting and film? Question 2 What is a 2 dimensional animations and 3 dimensional animations? Question 3 Different

Question 1 What are the differences between closed and open systems? Question 2 What are the characteristics of a good documentation? Question 3 What are the steps invol