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
The different paging techniques are 1. Multilevel paging or hierarchical paging method: In definite cases the page table may consist up to 1 million entries. This would be

Define the properties operating systems: Batch :- Jobs with similar needs are batched together and  run through the computer as a group by an operator or automatic job sequenc

Q. Most WANs utilize only a partially connected topology. Why is this subsequently Answer: Cost. A completely connected network requires a link between every node in the netw

Determine how Action implementing instruction’s meaning are a actually carried out   Action implementing meaning of instruction are a actually carried out Instruction executio

what is the latest OS of ANDROID in US

What is long-term, medium-term, short-term? In a batch system many processes are submitted than are able to be executed immediately. These processes are reel to a mass storage

As mentioned above, page tables, are lookup tables mapping a process' virtual pages to physical pages in RAM. How would one implement these page tables? The most straightforward

Q. In the IBM/370 memory protection is offered through the use of keys. A key is a 4-bit quantity every 2K block of memory has a key (the storage key) associated with it. The CPU

What is a Dispatcher? The dispatcher is the module that gives control of the CPU to the process selected by the short- term scheduler. This function includes: Switching

advantage and dis advantage of threads