## FANDOM

2,501 Pages

A Boatload of Hassle is a puzzle in Professor Layton and the Azran Legacy.

## Puzzle

A boatbuilder has six orders for rowing boats, and each of them requires ten logs to build. He goes to see the timer merchant and finds they have just the right amount of wood. However, he must buy it four adjacent pallets at a time and the pallets don't have a set number of logs. To make life even harder, the salesman has no idea how many logs one of the pallets has, only that it doesn't have more than five.

Help the builder by dividing the timber into six four-pallet loads, each having ten logs.

## Hints

Click a Tab to reveal the Hint.

Each pallet contains between and and five logs. You need to work out how to combine the pallets so the total number adds up to ten each time.

There are many ways of combining four numbers between one and five so that they add up to ten, for example 1 + 2 + 3 + 4 or 3 + 3 + 3 + 1.

Can you find any more such combinations?

Even when you work out all the possible combinations, the fact that one pallet has an unknown number of logs is bound to make things confusing.

Start by creating combinations using the pallets that contain the maximum five logs and things may become a little easier for you.

There's actually an easy way of working out just how many logs the pallet marked ? has.

You know you need to make six boats, that each boat needs ten logs, and that the timer merchant has the exact amount of wood you need. This means that there are 60 logs in total. Count how many logs are on the other pallets, subtract this number from 60, and you'll know how many logs the mystery pallet has.

Your first set stretches across from the top-left corner to the ?. The set that contains the mystery pallet itself should be square.

Now you only need to create four more sets.

## Solution

### Correct

Wood-erful!

It turns out that the boats are going to be used in a floating market - the stall owners will be able to open shop now thanks to you!

Community content is available under CC-BY-SA unless otherwise noted.