Heuristic search: It denotes a technique to reach goal state by choosing best promising state. It leads to goal state and this search is identified as heuristic search. The heuristic values are chosen for each node. It denotes that node that has low heuristic value is been chosen over another nodes. Goal: The objective is to find state sequence that would lead to final state. The numbers are been ordered from initial state that is unordered and it follows the productions. The count of tiles that are out of place denotes heuristic in problem. Algorithm for creating search tree: The algorithm is shown below: Step 1: Construct parent node by taking initial node Step 2: Check whether the node signifies a final state. Step 3: If step 2 fails, make child nodes that are possible states and could be attain by moving empty tile in parent nodes. Find heuristic value of states. Select node that has low heuristic value and move to step 2. Step 4: If step 2 is true, then algorithm constructed search tree. Stop construction of tree further.

Question

Want to see the full answer?

Answer 1

Question

Chapter 11, Problem 30CRP

Program Plan Intro

Heuristic search:

It denotes a technique to reach goal state by choosing best promising state.

It leads to goal state and this search is identified as heuristic search.

The heuristic values are chosen for each node.

It denotes that node that has low heuristic value is been chosen over another nodes.

Goal:

The objective is to find state sequence that would lead to final state.

The numbers are been ordered from initial state that is unordered and it follows the productions.

The count of tiles that are out of place denotes heuristic in problem.

Algorithm for creating search tree:

The algorithm is shown below:

Step 1:

Construct parent node by taking initial node

Step 2:

Check whether the node signifies a final state.

Step 3:

If step 2 fails, make child nodes that are possible states and could be attain by moving empty tile in parent nodes.

Find heuristic value of states.

Select node that has low heuristic value and move to step 2.

Step 4:

If step 2 is true, then algorithm constructed search tree.

Stop construction of tree further.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

7. Long-Distance CallsA long-distance provider charges the following rates for telephone calls: Rate Category Rate per MinuteDaytime (6:00 a.m. through 5:59 p.m.) $0.07Evening (6:00 p.m. through 11:59 p.m.) $0.12Off-Peak (midnight through 5:59 a.m.) $0.05Write a GUI application that allows the user to select a rate category (from a set of radio buttons), and enter the number of minutes of the call into an Entry widget. An info dialog box should display the charge for the call.

Name and Address The Name and Address Problem Write a GUI program that displays your name and address when a button is clicked. The program’s window should appear as the sketch on the left side of Figure 13-61 when it runs. When the user clicks the Show Info button, the program should display your name and address, as shown in the sketch on the right of the figure.

Exercise 1 Function and Structure [30 pts] Please debug the following program and answer the following questions. There is a cycle in a linked list if some node in the list can be reached again by continuously following the next pointer. #include typedef struct node { int value; struct node *next; } node; int 11_has_cycle (node *first) if (first == node *head = { NULL) return 0; first; while (head->next != NULL) { } if (head first) { return 1; } head = head->next; return 0; void test ll_has_cycle () { int i; node nodes [6]; for (i = 0; i < 6; i++) { nodes [i] .next = NULL; nodes [i].value = i; } nodes [0] .next = &nodes [1]; nodes [1] .next = &nodes [2]; nodes [2] .next = &nodes [3]; nodes [3] .next nodes [4] .next &nodes [4]; NULL; nodes [5] .next = &nodes [0]; printf("1. Checking first list for cycles. \n Function 11_has_cycle says it has s cycle\n\n", 11_has_cycle (&nodes [0])?"a":"no"); printf("2. Checking length-zero list for cycles. \n Function 11_has_cycle says it has %s…