Hill climbing - artificial intelligence , Basic Computer Science

Assignment Help:

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


Related Discussions:- Hill climbing - artificial intelligence

Artificial intelligence-search in problem solving, Search in Problem Solvin...

Search in Problem Solving If Artificial Intelligence can notify the extra sciences about something, it is about trouble solving and, in exacting, how to search for solutions to

Application packages, APPLICATION PACKAGES : There are two options. You ca...

APPLICATION PACKAGES : There are two options. You can either write your own program or buy an applications package, i.e. a proprietary program, 'off-the-shelf. The former option i

What is i-node number, Question 1 Bring out the advantages of Linux Ope...

Question 1 Bring out the advantages of Linux Operating systems Question 2 Match the Symbols with their respective file types              Symbol               File N

Flowchart looping, create a flowchart showing average score for the 3 quizz...

create a flowchart showing average score for the 3 quizzes assume that there are 3 sections each having 5 students the only valid number to be entered is 1-100 for the quizzes shou

Define grid computing, Question 1 Define Grid computing Question 2 ...

Question 1 Define Grid computing Question 2 Explain Attribute-Based Programming Model for Grid Services Question 3 What are the characteristics that users/applicat

Introduction to FCB , There are two kinds of FCB, the normal, whose length...

There are two kinds of FCB, the normal, whose length is 37 bytes and the expanded one of 44 bytes. The FCB is created of data given by the programmer and by data which it takes dir

Rooted tree, Ask qu The figure below shows a rooted tree, 756_Find the hei...

Ask qu The figure below shows a rooted tree, 756_Find the height.png 1.1. Find the height/level of the tree as shown above?estion #Minimum 100 words accepted#

What is the difference between kernel mode and user mode fun, The differenc...

The difference between kernel mode and user mode gives a rudimentary form of security in the following manner. Convinced instructions could be executed only when the CPU is in kern

Configuration of a pc, Configuration of a PC: Generally, when you thin...

Configuration of a PC: Generally, when you think of purchasing a Computer, you first try to exactly know what will be the hardware components such as processor, memory etc. of

What is the delay of the filter, QUESTION We wish to use the Kaiser win...

QUESTION We wish to use the Kaiser window method to design a discrete-time filter with generalized linear phase that meets specifications of the following form:

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd