مروري بر برج هانوي و ارايه ي يك فرمول جديد

Review of Tower of Hanoi and Present New Formula

Suppose that we have 2n disks of distinct sizes such that initially even disks are stacked on the first peg ordered by size with the smallest at the top and the largest at the bottom and similarly odd disks are stacked on another peg. In this Paper we want find optimal solution for transition disks to the third peg by using the well-known movements of Tower of Hanoi.