Tower of Hanoi

Problem Statement

[{"selector":"#anim-ba9d9220-92c0-4dfc-8095-e80d0e787e4f","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-bc4cc01c-9d9e-4114-b0cd-c251fa5e715e","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-1605d409-7582-4f0e-809e-20a5f6f27a2d","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-094988e3-a421-4899-915e-da10f4d89601","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-1bff93f1-4be4-473b-a667-d28f94a62186 [data-leaf-element=\"true\"]","keyframes":{"transform":["translate(0%, 0%) scale(1.5)","translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] Read More

Guidelines to be followed

[{"selector":"#anim-c3f33c5c-e6b9-4f07-a176-9b5682e83e2d","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-406559d1-f112-445f-9b9c-9398582bdd34","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-2b206944-6876-4db3-be4c-0b4c652385cb","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-9b3b572b-c264-465a-9500-a2f90a56a755","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-3d00b5df-5c88-4bbb-b9b5-c2f3742fe829 [data-leaf-element=\"true\"]","keyframes":{"transform":["translate(0%, 0%) scale(1.5)","translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] Read More

Recursive Approach

[{"selector":"#anim-51d4192a-eb85-46c1-85e1-ddc71e6edf31","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-6ffa2a0a-7437-4750-9431-0be21b4065f2","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-ddf19b61-e051-4395-9b07-da14eb041afb","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-5437b1d0-bdf5-417f-bf82-4a0d5e42e703","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-ee41b579-9c31-43ed-8033-1230f5ebb0b2 [data-leaf-element=\"true\"]","keyframes":{"transform":["translate(0%, 0%) scale(1.5)","translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] Read More

Example 1: For N = 2

[{"selector":"#anim-6ba58ed9-8ce9-41cd-89ee-b1cf9f21116c","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-61b88729-9638-4a06-82a4-535a09470bd9","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-6d29440d-c727-4e0a-a5c4-229cea1dffa8","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-b49fd0d8-2941-4086-ad63-2a71c2ade2fc","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-ea26cac7-5b06-4f86-a0de-99ffa009a907 [data-leaf-element=\"true\"]","keyframes":{"transform":["translate(25%, 0%) scale(1.5)","translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] Read More

Minimum number of moves to solve the Tower of Hanoi problem is 2^N – 1. Here, N = number of disks.

[{"selector":"#anim-da744546-915a-45a9-83e0-03ff81c02f13 [data-leaf-element=\"true\"]","keyframes":{"transform":["translate(25%, 0%) scale(1.5)","translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-86fa825c-e35f-4646-bf64-b67188ae3d23","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-aafc4ec1-ba43-4123-9c43-f793a07b826f","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-ef28a9f3-ec9a-4cc1-b193-b035c591d28d","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-ffef313c-22e1-416d-b1c6-868ac66341da","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] Read More

Example 2: For N=3

[{"selector":"#anim-129cf30f-5d85-4ebd-a821-e4aa92bb9533","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-855ce334-77d6-4ea1-9b18-b8d1157cb503","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-cc682f39-f278-4192-9c30-c877967dffed","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-4fc1d177-689b-499e-9808-f7c2c3fbe7e2","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-dfbf4eee-9a5d-4854-bec3-f76f2a63a8cd [data-leaf-element=\"true\"]","keyframes":{"transform":["translate(0%, 0%) scale(1.5)","translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] Read More

Features of Docker

[{"selector":"#anim-8986dd23-30e9-44bb-8403-f1c7dbcc15eb","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-fcf60a20-ba36-4745-b90e-2cc49369be55","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-0f5fa7e4-4a56-4b4d-a231-33262ba65b77","keyframes":{"opacity":[0,1]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"both"}] [{"selector":"#anim-58b57977-e57d-41fa-8051-a937ef5ccbda","keyframes":{"transform":["scale(0.3333333333333333)","scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] [{"selector":"#anim-1677f8c8-cbbe-464d-88e5-1193042de65a [data-leaf-element=\"true\"]","keyframes":{"transform":["translate(0%, 0%) scale(1.5)","translate(0%, 0%) scale(1)"]},"delay":0,"duration":2000,"easing":"cubic-bezier(.3,0,.55,1)","fill":"forwards"}] Read More

How to Implement Recursive Solution to Solve Tower of Hanoi?

[{"selector":"#anim-397c3608-2605-40f7-bfc4-4dbd79ffd702","keyframes":{"opacity":[0,1]},"delay":0,"duration":1000,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] [{"selector":"#anim-fd5913be-dcd8-4414-b277-dab3c137d7ce","keyframes":{"transform":["translate3d(0px, 143.24517%, 0)","translate3d(0px, 0px, 0)"]},"delay":0,"duration":1000,"easing":"cubic-bezier(0.2, 0.6, 0.0, 1)","fill":"both"}] SWIPE UP

Tower of Hanoi

How to solve the problem?

Problem Statement

A mathematical puzzle with 3 rods and N disks. The task is to move all disks to another rod.

Guidelines to be followed

1. Move only one disk at a time. 2. Move the uppermost disk from one stack to the top of another stack or to an empty rod. 3. Larger disks cannot be placed on top of smaller disks.

Recursive Approach

Tower of Hanoi problem can be solved using a recursive approach.

Example 1: For N = 2

Move disk 1 from tower 1 to tower 3 Move disk 2 from tower 1 to tower 2 Move disk 1 from tower 3 to tower 2

Minimum number of moves to solve the Tower of Hanoi problem is 2^N – 1. Here, N = number of disks.

Note:

Example 2: For N=3

Move disc 1 from tower A to tower B Move disc 2 from tower A to tower C Move disc 1 from tower B to tower C Move disc 3 from tower A to tower B Move disc 1 from tower C to tower A Move disc 2 from tower C to tower B Move disc 1 from tower A to tower B

Features of Docker

1. Faster and Easier configuration 2. Increase in productivity 3. Allow developers to create applications in an isolated environment. 4. Rapid scaling of Systems 5. Better Software Delivery

How to Implement Recursive Solution to Solve Tower of Hanoi?