Helpful Articles Wolf, Goat and Cabbage and the Tower of Hanoi: Logic Puzzles

Wolf, Goat and Cabbage and the Tower of Hanoi: Logic Puzzles

Wolf, Goat and Cabbage and the Tower of Hanoi: Logic Puzzles

Old puzzles are a good way to build logical thinking: there is no hard arithmetic in them, but you have to plan the order of your moves. Here are two of the most famous, the wolf, goat and cabbage problem and the Tower of Hanoi: where they come from and how to solve them. The benefits of online math lessons are covered in The Benefits of Online Math Lessons for Schoolchildren.

Wolf, Goat and Cabbage

A farmer has to get a cabbage, a goat and a wolf to the far bank of a river. His boat holds only himself and one of them. Left alone, the wolf will eat the goat, and the goat will eat the cabbage. How can he get everything across intact? The earliest known version of the puzzle is in a medieval Latin collection, Problems to Sharpen the Young, one of the first sets of recreational math problems. Tradition credits it to Alcuin of York, who died in 804, and its oldest surviving copy dates from the late ninth century.

How to Solve It

The goat has to go first, because any other move means something gets eaten. The farmer comes back alone and takes the wolf over, but brings the goat back with him. He then leaves the goat, ferries the cabbage across, returns alone again and finally fetches the goat. That makes seven trips, four out and three back, and the wolf and the cabbage can swap places. The trick is to realize that the boat can carry things back as well as forward: the puzzle never says so, but it does not forbid it either.

The Tower of Hanoi

There are three pegs and several discs of different sizes, piled on one peg like a pyramid with the largest at the bottom. The aim is to rebuild the pile on another peg. You may move one disc at a time, take only the top disc, and never put a larger disc on a smaller one. The French mathematician Édouard Lucas invented the puzzle and released it in 1883 under the name N. Claus de Siam, a rearrangement of the letters in Lucas d’Amiens, that is, Lucas from Amiens. It came with a legend about a temple where priests are shifting 64 golden discs, and when they finish, the world will end.

How Many Moves It Takes

Three discs can be moved in seven moves. Each extra disc doubles the smallest possible number of moves and adds one more: four discs need 15 moves, five need 31. For the 64 discs of the legend, even at one move per second, the job would take about 585 billion years. Shop versions usually have 7 to 9 discs. How to keep a child interested in math is covered in How to Motivate a Child to Learn Math Online.

How to Get Started

In our math course, students work through school topics and fill gaps, develop logical thinking by spotting patterns and explaining their reasoning, learn to solve problems on their own and prepare for tests and exams. Lessons are open to students from age 5. A trial lesson costs $8.00: it is individual and lasts 45 minutes. More about the course is on the Math page.

WhatsApp WhatsApp Facebook Messenger Messenger Telegram Telegram Viber Viber Instagram Instagram