search tree generated by hill-climbing search, Operating System

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.

Posted Date: 4/1/2013 6:46:19 AM | Location : United States







Related Discussions:- search tree generated by hill-climbing search, Assignment Help, Ask Question on search tree generated by hill-climbing search, Get Answer, Expert's Help, search tree generated by hill-climbing search Discussions

Write discussion on search tree generated by hill-climbing search
Your posts are moderated
Related Questions
Q. Present an algorithm for reconstructing a logical ring after a process in the ring fails? Answer: Typically distributed systems utilize a coordinator process that performs

List out the advantages of windows 2000 file management. Permits detailed security for individual folders and files. Built-in granular compression capabilities

NEXT FIT ALGORITHM Here scanning starts from the first fit position and then it finds the next position which is large sufficient to hold the process. Thus the name next fit.

List the Coffman's conditions that lead to a deadlock. Mutual Exclusion : Only one process might be use a critical resource at a time. Hold & Wait: A process may be alloc

Q. What are the three main activities of an operating system in regard to secondary-storage management? Answer: 1) Free-space management 2) Storage allocation 3) Disk

Explain the general structure of a typical process? There are basically four main sections through which each of the process has to pass through.The universal algorithm is:-

Processes have valid and invalid entries on their page tables. The valid entries all point to some where "real" (e.g. a physical page, or some portion of disk in case of non-reside

Since most of the programs require a lot of memory allocation/deallocation, we expect the memory management to be fast, to have low fragmentation, make good use of locality, and be

Question: a) There are main goals of data security. List them and elaborate on how they provide protection. b) Describe threats associated with data security. c) Describe

What does the last four digits '0010' of the above dump represent? What action will the Destination node takes when it receives this packet? The last four digits '0010' denotes