Tower Of Hanoi with algorithm and explanation || data structure || Bangla tutorial

The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower[1] and sometimes pluralized as Towers) is a mathematical game or puzzle. It consists of three rods and a number of disks of different sizes, which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules: Only one disk can be moved at a time. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod. No larger disk may be placed on top of a smaller disk. With 3 disks, the puzzle can be solved in 7 moves. The minimal number of moves required to solve a Tower of Hanoi puzzle is 2n − 1, where n is the number of disks. The puzzle was invented by the French mathematician Édouard Lucas in 1883. Numerous myths regarding the ancient and mystical nature of the puzzle popped up almost immediately.[2] There is a story about an Indian temple in Kashi Vishwanath which contains a large room with three time-worn posts in it, surrounded by 64 golden disks. Brahmin priests, acting out the command of an ancient prophecy, have been moving these disks in accordance with the immutable rules of Brahma since that time. The puzzle is therefore also known as the Tower of Brahma puzzle. According to the legend, when the last move of the puzzle is completed, the world will end.[3] If the legend were true, and if the priests were able to move disks at a rate of one per second, using the smallest number of moves it would take them 264 − 1 seconds or roughly 585 billion years to finish,[4] which is about 42 times the current age of the universe. There are many variations on this legend. For instance, in some tellings the temple is a monastery, and the priests are monks. The temple or monastery may be said to be in different parts of the world—including Hanoi, Vietnam—and may be associated with any religion. In some versions other elements are introduced, such as the fact that the tower was created at the beginning of the world, or that the priests or monks may make only one move per day. [ wikipedia ] ------------------------------------------------------------------------------------------------------------- Thanks For Watching This Video. LIKE || COMMENT || SHARE || SUBSCRIBE Now... …………………………………………………………………….. Facebook Page: https://www.facebook.com/FOAT2023 …………………………………………………………………….. 1. Join with me in Masters admission preparation group: https://www.facebook.com/groups/858042971559671 2. Join with me in Twitter : https://twitter.com/MustakimBillah1 3. Join with me in Linked in : https://www.linkedin.com/in/mustakimbillah …………………………………………………………………….. 1. Linear and Non Linear Data Structure https://youtu.be/-8v7aM34aeY?si=WG6HqqHB4ciyDaLK 2. Complexity and Time space trade off https://youtu.be/g_BL_pZmMPc?si=AC3Lqy5SLPd71Q41 3. Linear Search Algorithm https://youtu.be/j4sdJe3q39Y?si=YwIBBMzrvB8nftmF 4. Linear Search Complexity Analysis https://youtu.be/mYfGwOqQFQI?si=bhBOdIF-sGKeHlj5 5. Binary Search Algorithm https://youtu.be/vtdd2zcxMQE?si=6nyOZ7ht2kVWjhqv 6. Quadratic Equation Algorithm https://youtu.be/rE-ncFHLtuE?si=etF7dna0IeGDVt9d 7. Array Largest Element Algorithm https://youtu.be/e1ruWZobimM?si=bFjkx7SfBiTLxoum 8. Largest and second largest value in array algorithm https://youtu.be/nfz03uhhYO0?si=naPRdjAlkF7ul06J 9. Matrix Multiplication Algorithm https://youtu.be/IQnZ2hL2URY?si=DNyO5stmN5Y9f2la 10. String Operation: https://youtu.be/uoDQUODLnvM?si=rfGu1jPu9LiXnXl5 11. Pattern Matching Algorithm https://youtu.be/FMER3nDF1r8?si=ZF2pRiTt8c77ia8m 12. Bubble Sort https://youtu.be/NWwDQ2Xq7hU?si=3fCSWkoCriKqkzBk 13. Linked List: https://youtu.be/4bp9xAqddao?si=BWPcGkvwzHuxrWoS 14. Quick Sort https://youtu.be/EGyC09MDyLM?si=IaW7iw1hxnjOHRe4 15. Searching in linked list https://youtu.be/h_kyew3O4yc?si=ulvFc1j7YzqqRwo_ 16. Tower of Hanoi https://youtu.be/tP7iW0Op0h0?si=-hKii-UUhUSBKaS8 17. Prims Algorithm: https://youtu.be/hquRzYzLhgQ?si=OXgAreaUbYQuVpCT 18. Kruskals Algorithm: https://youtu.be/UIZemIG0MRc?si=y0UlxV05_AkrtEsn 19. Knapsack Problem: https://youtu.be/oWMwqb3l4gI?si=2SDKjeeg9pMPSh2e 20. infix prefix and postfix: https://youtu.be/ENWeA_RHy5A 21. pre order, post order, in order: https://youtu.be/bjMOe9lr_8k _____________________________________________________________________ #datastructures #datastructuresandalgorithms #towerofhanoi