https://adnatull.github.io/tags/mathematical-puzzle/Recent content in Mathematical Puzzle on Adnatull's Bloghttps://adnatull.github.io/images/logo.jpghttps://adnatull.github.io/images/logo.jpgHugoen-usMon, 29 Jan 2018 16:08:41 +0000https://adnatull.github.io/dev/2018/01/29/the-tower-of-hanoi-solution/Mon, 29 Jan 2018 16:08:41 +0000https://adnatull.github.io/dev/2018/01/29/the-tower-of-hanoi-solution/<h3 id="definition">Definition:</h3> <p>The Tower of Hanoi problem is a puzzle which can be solved by mathematically and can be implemented in programming code as well. The tower is also called <strong>Tower of Brahma</strong> or <strong>Lucas&rsquo; Tower</strong>. In this, game there are three pegs and one one of them hold <strong>n</strong> disks. <strong>n</strong> disks are ordered from higher radius to lower radius from the bottom to top.</p> <!-- more --> <p><img alt="The Tower of Hanoi" loading="lazy" src="https://adnatull.github.io/dev/2018/01/29/the-tower-of-hanoi-solution/hanoi-10ring.jpg"></p>