[an error occurred while processing this directive] The Beach Temple Puzzle
[ Walkthru :: Land 2 :: The Beach Temple Puzzle ]

The Beach Temple Puzzle
Land 2 :: The Beach Temple Puzzle You must move the Temple to the column furthest from the sea piece by piece. There are four Temple pieces and you may only place a piece on an empty spike or on a wider piece.

This challenge is a classic Tower of Hanoi puzzle. When you complete the Challenge, the temple will cast a Heal Increase on anyone near it. As far as I know, there is only one way to complete the Challenge, by solving the puzzle. You cannot move the pieces elsewhere, and the temple seems invulnerable to attacks by rocks or fireballs.

Read on for background on the puzzle, the solution is below.
The Tower(s) of Hanoi
The puzzle was originally published in 1883 by French Mathematician Édouard Lucas (1842 – 1891) under the pseudonym of N. Claus de Siam of the College of Li-Sou-Stian. The name and college are anagrams of Lucas d’Amiens and the Lycée Saint Louis, where Lucas was teaching, and shows the French involvement in Indochina at the time ((Hanoi, however, is in Vietnam, while Siam is modern day Thailand)). Lucas is best known for his work in number theory and his study of the Fibonacci sequence and the associated Lucas sequence, named after him.

The “legend” that accompanied the game stated that in Benares, during the reign of Emperor Fo Hi there was a temple, which had a dome that marked the centre of the world. Beneath the dome, priests moved golden discs between diamond needles, a cubit high and as thick as the body of a bee. God placed 64 golden discs on one needle at the Creation. It was claimed that when they had completed their task, needles, tower, temple and Bramins would crumble to dust and, with a thunderclap, the Universe would end.

For a tower of n discs, it will require at least 2n-1 moves to complete the puzzle. Thus, for the four pieces of the Temple Beach Puzzle, we need 2n-1 = 15 moves to complete it. Sources :: Encyclopædia Britannica, Édouard Lucas, the Towers of Hanoi.
Solution
The minimum number of moves to complete the puzzle is 15. Assuming the spikes are numbered 1, 2 and 3, with 1 being the target and 3 being the original, and the discs are labeled A, B, C and D, with A being the smallest, top disc and D being the base, the 15 moves are –
01. A, 3 to 2
02. B, 3 to 1
03. A, 2 to 1
04. C, 3 to 2
05. A, 1 to 3
06. B, 1 to 2
07. A, 3 to 2
08. D, 3 to 1 ((base is in place))
09. A, 2 to 1
10. B, 2 to 3
11. A, 1 to 3
12. C, 2 to 1 ((half done))
13. A, 3 to 2
14. B, 3 to 1 ((¾ done))
15. A, 2 to 1 ((done))
[an error occurred while processing this directive]