5. Formulate an admissible and accurate heuristic for the \"Towers of Hanoi\' pr

Question

5. Formulate an admissible and accurate heuristic for the "Towers of Hanoi' problem with three pegs and three rings as defined below. You must discuss and demonstrate the admissibility and describe the degree of accuracy (in approximate terms of your heuristic function. Define any other aspect of the problem formulation such as how a state should represented etc. for application of a heuristic search algorithm like the A The three-peg version of the Towers-of-Hanoi puzzle is as follows. Three pegs-A, B, and C- can each hold nrings at a time. There are n rings Ri, R2, Rm such that Ri is smaller than Ri for any i

Explanation / Answer

var i := 1
proc hanoi (n, f, t, u : int)
if n > 0 then
hanoi (n - 1, f, u, t)
put "move ", i, ": ", f, " to ", t
i += 1
hanoi (n - 1, u, t, f)
end if
end hanoi
hanoi (6, 1, 3, 2)

Related Questions

Navigate

• Browse (All)
• Browse 5
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.