Solving towers of Hanoi problem using 2-Consecutive moves Algorithm

Abstract

The problem of Hanoi is a classical one and getting the optimal solution has posed serious challenges to puzzle researchers over the years. This research paper proposed a novel 2-consecutive move algorithm solution to 3-peg towers of the Hanoi problem, which allows a 2-consecutive moves algorithm that moves 2 disks at once in each move instance of the Hanoi algorithm. There are no 2-consecutive moves for the first and last moves; only one disk is moved for these instances. The main purpose of this research work is to derive a 2-consecutive moves algorithm that can be easily implemented in a suitable programming language, and would substantially reduce the computational time to fully compute the Hanoi solution.