This Puzzle is a variation on the famous Towers of Hanoi Puzzle.
A cheesemonger has six cheeses stacked on cheeseboard A. These cheeses are number 1 to 6 and are stacked in numerical order with 1 at the top and 6 at the bottom. Please note that each cheese is on top of a cheese with a higher number.
The cheesemonger wants to display the six cheeses on three cheeseboards, the aforementioned A, and two others, B and C. He wants cheeses 3 and 4 on cheeseboard B and cheeses 5 and 6 on cheeseboard C, with cheeses 1 and 2 on cheeseboard A. Cheeses 1, 3 and 5 must be on top of cheeses 2, 4 and 6 respectively.
With the proviso that no cheese can be placed on another cheese with a lower number than itself, how many moves will it take to rearrange the cheeses?
The moves are: 1-b, 2-c, 1-c, 3-b, 1-a, 2-b, 1-b, 4-c, 1-c, 2-a, 1-a, 3-c, 1-b, 2-c, 1-c, 5-b, 1-a, 2-b, 1-b, 3-a, 1-c, 2-a, 1-a, 4-b, 1-b, 2-c, 1-c, 3-b, 1-a, 2-b, 1-b, 6-c, 1-c, 2-a, 1-a, 3-c, 1-b, 2-c, 1-c, 4-a, 1-a, 2-b, 1-b, 3-a, 1-c, 2-a, 1-a, 5-c, 1-c, 2-b, 1-b, 3-c, 1-a, 2-c, 1-c, 4-b, 1-b, 2-a, 1-a, 3-b