search tree generated by hill-climbing search, Operating System

Assignment Help:

Show the search tree generated by Hill-Climbing search (text figure 4.2, page 122; or Local Search lecture, slide 6) for each of the two heuristics (a) and (b) applied to the following 8- puzzle problem. Search tree should show all states generated along with their heuristic value.

If two neighbor states have the same value, then consider them in order of the actions (movement of blank): up, down, left, right. Also indicate the final state returned by the Hill- Climbing function.

Initial State:

1 0 2

8 4 3

7 6 5

Goal State:

1 2 3

8 0 4

7 6 5

a. Value = 1 / (number of tiles out of place, including the blank tile). For example, the value of the initial state = 1/4.

b. Value = 1 / (number of tiles out of place, not including the blank tile). For example, the value of the initial state = 1/3.


Related Discussions:- search tree generated by hill-climbing search

Problem of unbalanced loads, Present your own fully documented and tested p...

Present your own fully documented and tested programming example illustrating the problem of unbalanced loads. Describe the use of OpenMP's scheduler as a means of mitigating this

What do you understand by active directory domain, Question: a) What ...

Question: a) What do you understand by Active directory domain in Windows Server 2008? Support your answer with a diagram. b) Distinguish between active directory trees

Explain short term scheduling, Short term scheduling The short term sch...

Short term scheduling The short term scheduler as well known as the dispatcher executes most frequently and makes the fine grained decision of which process to execute next. Th

What are the necessary conditions for deadlocks?, What are the necessary co...

What are the necessary conditions for deadlocks? 1. Mutual exclusion :  Only one process at a time is able to use the resource. 2. Hold and wait :  A process should be holdi

Race condition, list the prevention of mechanism for race condition with op...

list the prevention of mechanism for race condition with operating system

Bounded and unbounded buffer, Ask question #Minimum 100 difference between ...

Ask question #Minimum 100 difference between bounded and unbounded buffer words accepted#

Microsoft, Discuss the high barriers to entry in the market for PL operatin...

Discuss the high barriers to entry in the market for PL operating systems

Explain root partition, Explain root partition The root partition,which...

Explain root partition The root partition,which have the operating-system kernel and potentially other system files, is mounted at boot time. In successful mount operation, ope

Define paging , Paging: Only the needed memory pages are moved to main me...

Paging: Only the needed memory pages are moved to main memory from the swap machine for execution. Process size does not matter. Produce the concept of the virtual memory. It

Operating system.., What is the use of FIFOs in client-server applications

What is the use of FIFOs in client-server applications

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