Puzzle 449
Pre-Championship Rehearsalall logic puzzles
At last month's rehearsal, four top athletes competed in two 400-metre qualifiers.
As the results were expected to be mislaid, various notes were taken to ensure the accuracy of the overall placings:
No one finished both races in the same position.
In both races, Sam beat the runner whose surname was Watson.
Billie Taylor came third in the second race, and Pat came last in the first race.
In the second race, the athlete whose surname was Arnold won, and the athlete whose surname was Bowler came last.
In the first race, Billie beat Jamie, but Jamie beat Sam.
Can you determine who finished where in each of the races?
Puzzle 450
During the recent BrainBashers cipher convention, a Morse code contest took place.
The contest consisted of a Morse code transmission where the spaces between the letters and words were missing.
Can you find the ten girl's names?
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
Luckily, BrainBashers has provided you with a list of the Morse code characters:
A ![]()
B ![]()
![]()
![]()
C ![]()
![]()
![]()
D ![]()
![]()
E
F ![]()
![]()
![]()
G ![]()
![]()
H ![]()
![]()
![]()
I ![]()
J ![]()
![]()
![]()
K ![]()
![]()
L ![]()
![]()
![]()
M ![]()
N ![]()
O ![]()
![]()
P ![]()
![]()
![]()
Q ![]()
![]()
![]()
R ![]()
![]()
S ![]()
![]()
T
U ![]()
![]()
V ![]()
![]()
![]()
W ![]()
![]()
X ![]()
![]()
![]()
Y ![]()
![]()
![]()
Z ![]()
![]()
![]()
Puzzle 451
By changing the second letter of each word below, you can make another valid word.
Can you change each word such that the second letters will reveal an eleven-letter word when read downwards?
Therefore, what now reads 'vokahliuppw' will become a real word.
oval
post
skin
malt
when
slab
miss
fund
aped
sped
sway
Puzzle 452
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 boy's names?
11010 01011 11010 11
10101 11011 01100 11
10101 10011 11111 110
10011 10100 10110 11010 1
10011 01101 00110 0
10000 10110 10010 11001 0
11100 01001 01001 10011
10101 11111 110
10111 01101 10100 11110
10100 10100 11111 0