Tower of Hanoi Problem with Arbitrary Number of Pegs and Present a Solution
Sohrab Kordrostami, R. Ahmadzadeh, Armin Ghane · 2010
Suppose that we havem pegs and n disks of distinct sizes such that initially disks are stacked on the first peg ordred by size with the smallest at the top and the largest at the bottom. In this Paper we want to find a solution for transition disks to one of another pegs usingthe well-known movements of Tower of Hanoi such that there are no solution better than it yet.