|←||019 - Spinning Maize||020 - Nine Red Bricks||021 - A Lick of Paint||→|
Lionel is contemplating a row of nine bricks for his mother's garden wall. Two adjacent bricks in the row are much heavier than the rest, but he can't remember which.
He's decided the only way to identify them is to lift the bricks one by one, but to save time, he wants to do it in the most efficient way possible.
Can you work out the maximum number of bricks he might need to lift in order to find the two heavy ones?
Remember that Lionel wants to lift the bricks in the most efficient way possible.
Correct! It's four!
For example, he might start by lifting bricks 2, 4, and 6. If one of them is heavier, he can then lift a neighboring brick. If that brick isn't also heavy, then he knows the one on the other side is.
If none of the bricks out of 2, 4, and 6 are heavier than the rest, he can simply lift 9. If 9 is heavier, then 8 must be the other heavy brick. If 9 isn't heavier, then it has to be 7 and 8.
|Professor Layton and the Miracle MaskPuzzles in|
To be added
|Puzzle Index: CV · DB · UF · LS · MM · AL · VS|
A big thanks to http://www.youtube.com/user/LaytonKyouju