The seven story Tower of Hanoi game requires a minimum of 127 steps. The algorithm is actually very simple. When the number of plates is n, the number of movements should be equal to 2 ^ n-1. Later, an American scholar discovered an unexpectedly simple method, which only required taking turns performing the two-step operation.