TOWERS OF HANOI
VVITU ACM Student Chapter organized a logic-based puzzle event titled Towers of Hanoi as part of SPARDHA 2K25. The event focused on testing participants’ problem-solving skills and strategic reasoning through one of computer science’s most iconic recursive puzzles.Participants displayed great enthusiasm as they raced against time to solve the challenge with minimal moves.
Date & Time: 17.09.2025, 09:00 AM
Venue: VVITU
Team Size: 1
Event Poster
In Towers of Hanoi, participants were provided with a setup of three rods and three to five disks. The goal was to transfer all disks from the source rod to the destination rod using the minimum number of moves, while following the traditional rules:
only one disk could be moved at a time, and a larger disk could never be placed on a smaller one.
The entire task had to be completed within three minutes.
Each participant’s performance was evaluated based on accuracy, minimum moves, and completion time.
Those completing the puzzle with the theoretical minimum moves were awarded maximum points.
Any violation of rules led to instant disqualification, ensuring fairness and discipline.
The event highlighted the beauty of recursive logic and step-by-step problem decomposition.
Students applied analytical reasoning, sequencing, and mathematical thinking to reach optimal solutions.The tension of balancing speed
with precision made the event both educational and thrilling.
Conclusion:
Towers of Hanoi emerged as a standout event of SPARDHA 2K25, blending fun
with deep conceptual learning.It helped students strengthen their understanding
of logical sequencing and algorithmic efficiency.The event concluded on a
successful note, with participants appreciating the balance of challenge and clarity
that made Towers of Hanoi both a puzzle and a learning experience.