Question: Solve the pancake sorting problem with the initial state of 2,1,3,2 and the final state of 1,2,2,3. Note that there are two pancakes of size

Solve the pancake sorting problem with the initial state of 2,1,3,2 and the final state of 1,2,2,3. Note that there are two pancakes of size 2 to reduce the number of states needed. The arc-cost is the number of pancakes flipped.

a. Apply A* search using the heuristic h1 = the index of the largest pancake that is out of place.
b. Apply A* search using the heuristic h2 = the number of pancakes out of position.
c. Apply UCS

Use graph search (keeping track of closed nodes) wheneverapplicable; that is, in your work, do not show children that are found in the set of already closed nodes.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!