Puzzle 109
Using a tap, a nine gallon container and a four gallon container …
… can you measure exactly 6 gallons?
Puzzle 110
Snail Raceall logic puzzles
At last year's BrainBashers snail race, 10 fine snails completed the tabletop course.
Predictably, as per every year, the results mysteriously went missing.
However, various spectators remembered the following snippets of information:
Orange Berry lost to Zebra Wings.
Zebra Wings beat Orange Berry, Frog Flippers and Apple Pie.
Fizzy Pop lost to Minty Mouth, Orange Berry and CD Player.
Frog Flippers beat Windy Hill, CD Player and Orange Berry.
Top Hat lost to CD Player, Kipper Slippers and Apple Pie.
CD Player beat Top Hat and Fizzy Pop.
Apple Pie lost to Zebra Wings and Orange Berry.
Kipper Slippers lost to Apple Pie and Frog Flippers.
Frog Flippers beat Fizzy Pop, Minty Mouth and CD Player.
CD Player lost to Frog Flippers, Kipper Slippers and Apple Pie.
Top Hat beat Fizzy Pop and Windy Hill.
Minty Mouth lost to Windy Hill and Orange Berry.
Windy Hill lost to Apple Pie and CD Player.
Can you work out who finished where?
Puzzle 111
I recently travelled from my home town to a distant music concert, on a pedal tricycle, of all things! My wonderful, three-wheeled tricycle.
I knew that the epic 2,345 mile trip would wreak havoc on the tyres, but luckily I took along 4 spares!
Instead of waiting for any single tyre to fail, I decided that I would rotate the tyres evenly, making sure that by the end of the trip, all seven tyres had travelled exactly the same distance.
What was the distance that each tyre travelled?
Puzzle 112
During the recent BrainBashers cipher convention, a binary code contest took place.
The contest consisted of a binary code transmission where the spaces between the letters were missing and there was no punctuation.
Each letter of the alphabet was translated into its binary equivalent based on its position in the alphabet. The resulting code was then blocked in groups of five digits.
a=1, b=10, c=11, d=100, e=101, f=110, g=111, h=1000, i=1001, j=1010, k=1011, l=1100, m=1101, n=1110, o=1111, p=10000, q=10001, r=10010, s=10011, t=10100, u=10101, v=10110, w=10111, x=11000, y=11001, z=11010
Can you find 10 countries?
10101 10000 11110
10111 11100 10110 011
10000 11111 10011 11010 0
11010 01011 11011 101
11100 01001 11001 01
11011 11110 01011 11111 11111
11010 11101 10100 11
10100 11111 11011 11
10000 11110 11101 1
11011 11111 10111 11111 10010 011