Professor Layton Wiki
Register
Advertisement
Professor Layton Wiki
083 - Pancake Stacks 2084 - Pancake Stacks 3085 - The Missing Shape

Pancake Stacks 3 (Piles of Pancakes 3 in the UK version) is a puzzle in Professor Layton and the Diabolical Box.

Puzzle

US Version

Now here's a tasty puzzle for you. Your task is to take that big stack of pancakes on the left plate and move them to the plate on the far right. In doing so, however, you need to follow these rules:

  • You can move only one pancake at a time.
  • A pancake can never rest on another pancake smaller than itself.

Feel free to shift things about as much as you like and to use the middle plate in completing the puzzle.

UK Version

Here's a tasty puzzle for you.

Can you move the pile of pancakes from the blue plate on the left to the red plate on the right? Wait, though, it's not as easy as it sounds. You must follow these rules:

  • You can only move one pancake at a time.
  • You cannot place a pancake on top of another one that is smaller than itself.

You can use the middle plate and move the pancakes as many times as you like.

Hints

Click a Tab to reveal the Hint.

US Version

Having trouble? Just follow the hints given to you in Pancake Stacks 2. This is the last hint you're going to get for this kind of puzzle, so it would be a waste to spend another hint coin here.

UK Version

Having trouble? Just follow the hints given to you in "Piles of Pancakes 2". This is the last hint you're going to get for this puzzle, so it would be a waste to spend another hint coin here. All you'll get is trivia, so consider this a warning!

US Version

Looks like you went and spent that hint coin anyway. Must be nice having hint coins to burn. OK then, here's a little fun fact for you.

These pancake puzzles are based on a puzzle called the Tower of Hanoi, which can be solved using a basic concept in computer science known as recursion. Sure, it's not much of a hint, but it is interesting stuff, isn't it?

UK Version

Looks like you went and spent that hint coin anyway. Must be nice having hint coins to burn! OK then, here's a little fun fact for you.

These pancake puzzles are based on a puzzle called the Tower of Hanoi, which can be solved using a basic concept known in computer science as recursion. That might not be much help to you right now, but it is interesting stuff, isn't it?

US Version

Well, look at that, you spent yet another hint coin. All right, moneybags, time for more fun facts.

Edouard Lucas, the man who thought up the Tower of Hanoi puzzle, introduced the puzzle saying that it was based on an Indian myth detailing the creation and destruction of the world. Though the myth is quite fascinating, many people believe Lucas fabricated it.

UK Version

All right then, moneybags, time for for more fun facts.

Edouard Lucas, the man who thought up the Tower of Hanoi puzzle, introduced the puzzle saying that it was based on an Indian myth that said the world would be destroyed if anyone solved a special, very large version of this puzzle. Though that myth is quite fascinating, many think that Lucas fabricated it himself.


Solution

Correct

US Version

Yummy!

Did you know that you can solve this puzzle in as few as 31 moves?

UK Version

Hot and fresh!

Now the only question is what to put on them!

Advertisement