Tower of Hanoi
What is the "Tower of Hanoi"
The Tower of Hanoi is an iconic puzzle game that you can read more about on Wikipedia here. To win one must move the rings (yes that is what the horizontal rectangles represent) from the first tower to the third in the same order as they are arranged in the beginning. Introducing a degree of challenge is the rule that you can't place a ring on a ring smaller than itself. There is an optimal solution that produces the winning result in (2^n-1) moves that I've implemented using Unity's Coroutine system and can be tested with the "Solve" button on any number of starting rings. The iteration you see above was coded by myself in C# using Unity and published to itch.io before being embedded on my website. To check out the Github page and all of the code that makes this work click here.