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
What is the sequence in which resources may be utilized? Under normal mode of operation, a process may utilize a resource in the following sequence: Request: If the requ

IMPLEMENTATION OF SEGMENTATION WITH AN EXAMPLE Segmentation is a memory-management scheme that represents the user view of memory. A logical address space is the collection of

Questiion 1 What is RTOS? What are its requirements? Questiion 2 Explain the structural elements of a real time system mode Questiion 3 What is kernel? Explain abo

Define deadlock avoidance. An alternative method for avoiding deadlocks is to need additional information about how resources are to be requested. Every request requires the sy

Define entry section and exit section. The critical section problem is to design a protocol that the processes can use to cooperate. Every process must request permission  to e

Hierarchical paging Single way is to use a two-level paging algorithm, in which the page table itself is also paged. A logical address is separated into a page number and a pag

Many-to-Many Model The many-to-many model- many user-level threads to many kernel-level threads avoids several of the limitations of the one-to-one model, although extending mu

You have been requested by your Senior Engineer to design an Engine Control Unit (ECU) and prepare a report detailing your proposed solution. The client requires a design for a mic

Q. Polling for an I/O completion is able to waste a large number of CPU cycles if the processor iterates a busy-waiting loop several times before the I/O completes. However if the

Explain about file allocation methods? The main problem in direct-access nature is how to assign space to these files so that disk space if utilized effectively and files can b