Let’s solve Hanoi tower once again. Unlike day 1, the problem is slightly different today.

In an optimal game (with the least number of moves), find how many moves have been played given towers’ configuration. And conversely, given towers’ configuration find…