English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In this paper, our aim is to prove that our recursive algorithm to solve the"Reve's puzzle" (four- peg Tower of Hanoi) is the optimal solution according tominimum number of moves. Here we used Frame's five step algorithm to solve the"Reve's puzzle", and proved its optimality analyzing all possible strategies tosolve the problem. Minimum number of moves is important because no one everproved that the "presumed optimal" solution, the Frame-Stewart algorithm,always gives the minimum number of moves. The basis of our proof is BifurcationTheorem. In fact, we can solve generalized "Tower of Hanoi" puzzle for any pegs(three or more pegs) using Bifurcation Theorem. But our scope is limited to the"Reve's puzzle" in this literature, but lately, we would discuss how we canreach our final destination, the Generalized Tower of Hanoi Strategy. Anotherimportant point is that we have used only induction method to prove all theresults throughout this literature. Moreover, some simple theorems and lemmasare derived through logical perspective or consequence of induction method.Lastly, we will try to answer about uniqueness of solution of this famouspuzzle.

On the Footsteps to Generalized Tower of Hanoi Strategy