In the island of Hanoi is trapped a princess

In the island of Hanoi is trapped a princess. To rescue her, the prince has to transfer a set of rings numbered 1 to 7 from tower A to tower C. The rings are stacked one over the other in an order, with 1 at the top and 6 at the bottom, and have to be stacked in the same fashion on tower C. The prince can move only one ring at a time, and can store the rings in a stack, temporarily, in another tower B.Minimum how many moves of rings, between the towers, will it take the prince to arrange the rings in tower C ?

AQuA-RAT — Algebra Question Answering with Rationales (Ling et al., DeepMind, 2017) · train #14610