L _ S _
_ S
M _ R R _ _ D
T _
G _ _ R G _ ,
_ N D
T H _ _ R
1 0
Y _ _ R
_ L D
P L _ Y S
W _ T H
N _ N T _ N D _ .
T H _ Y
L _ K _
T _
_ _ T
_ T
B _ R G _ R
K _ N G .
T H _
_ S S _ C _ _ T _ _ N S
_ R _ :
C H _ L D
_ G _
4 ,
M _ T H _ R
R _ G _ N _ ,
F _ T H _ R
L _ R R Y ,
T R _ _ N S ,
K F C
C H _ L D
_ G _
6 ,
M _ T H _ R
J _ L _ _ ,
F _ T H _ R
S T _ V _ ,
P _ K _ M _ N ,
M C D _ N _ L D S
C H _ L D
_ G _
8 ,
M _ T H _ R
M _ R _ _ ,
F _ T H _ R
M _ K _ ,
B _ R B _ _ ,
T _ C _
B _ L L
C H _ L D
_ G _
1 0 ,
M _ T H _ R
L _ S _ ,
F _ T H _ R
G _ _ R G _ ,
N _ N T _ N D _ ,
B _ R G _ R
K _ N G
C H _ L D
_ G _
1 2 ,
M _ T H _ R
C _ R _ L ,
F _ T H _ R
B _ L L ,
G I
J _ _ ,
D _ _ R Y
Q _ _ _ N
T _
S _ L V _ ,
D R _ W
_
G R _ D
W _ T H
F _ V _
R _ W S
_ N D
F _ V _
C _ L _ M N S .
A C R _ S S
T H _
T _ P ,
_ B _ V _
T H _
C _ L _ M N S ,
W R _ T _
A G _ ,
M _ T H _ R ,
F _ T H _ R ,
T _ Y
_ N D
F _ _ D .
F _ G _ R _
_ _ T
T H _
K N _ W N
_ G _ S
_ N D
W R _ T _
T H _ M
_ N
_ R D _ R
_ N
T H _
F _ R S T
C _ L _ M N .
O N _
C H _ L D ' S
_ G _
_ S
_ N K N _ W N
_ T
F _ R S T .
H _ W _ V _ R ,
_ N C _
T H _
Y _ _ N G _ S T
C H _ L D
_ S
D _ S C _ V _ R _ D
( T H _
_ N _
W H _
P L _ Y S
W _ T H
T R _ _ N S )
_ T
_ S
T H _ N
K N _ W N
T H _ T
T H _
_ L D _ S T
C H _ L D
_ S
T H _
C H _ L D
W _ T H
T H _
_ N K N _ W N
_ G _ .
T H R _ _ G H
_ D D _ T _ _ N _ L
C L _ _ S ,
_ T
_ S
P _ S S _ B L _
T _
D _ T _ R M _ N _
T H _ T
T H _
_ L D _ S T
C H _ L D
_ S
_ G _
1 2 .
T _ K _
T H _
C L _ _ ,
L _ S _ ? S
C H _ L D
_ S
1 0 .
I N
T H _
M _ T H _ R
C _ L _ M N
C _ R R _ S P _ N D _ N G
T _
T H _
_ G _
1 0 ,
Y _ _
W _ _ L D
W R _ T _
L I S A
( M _ Y B _
C _ R C L _
_ T ,
B _ C _ _ S _
_ T
_ S
T H _
C _ R R _ C T
_ N S W _ R . )
I N
T H _
M _ T H _ R
C _ L _ M N
F _ R
_ V _ R Y
_ T H _ R
_ G _ ,
W R _ T _
" N _ T
L _ S _ " .
D _
T H _ S
F _ R
_ _ C H
C L _ _ .
I F
Y _ _
K N _ W
T H _
_ N S W _ R
B _ C _ _ S _
_ F
_
C L _ _ ,
W R _ T _
_ T
_ N
T H _
_ P P R _ P R _ _ T _
C _ L _ M N ,
_ N D
T H _ N
B _
S _ R _
T _
W R _ T _
" N _ T
S _ C H
_ N D
S _ C H "
_ N
_ L L
T H _
_ T H _ R
R _ W S
F _ R
T H _ T
C L _ _ .
F _ R
_ X _ M P L _ ,
" T H _
Y _ _ N G _ S T
C H _ L D
P L _ Y S
W _ T H
T R _ _ N S " ,
W _ _ L D
R _ S _ L T
_ N
" N _ T
T R _ _ N S "
F _ R
_ N Y
C H _ L D
Y _ _
C _ N
T _ L L
_ S N ? T
T H _
Y _ _ N G _ S T ,
B _ T
Y _ _
C _ N ? T
W R _ T _
" T R _ _ N S "
F _ R
_ N Y
C H _ L D ,
B _ C _ _ S _
Y _ _
D _ N ? T
K N _ W
W H _ C H
C H _ L D
_ S
T H _
Y _ _ N G _ S T
_ T
F _ R S T .
E V _ N T _ _ L L Y ,
Y _ _
M _ Y
F _ N D
T H _ T
" M _ T H _ R
N _ T
M _ R _ _ "
_ S
_ N
_ V _ R Y
L _ N _
_ X C _ P T
_ N _ ,
_ N D
T H _ N
Y _ _
W _ _ L D
K N _ W
T H _ T
M _ R _ _
_ S
T H _
M _ T H _ R
_ N
T H _
_ M P T Y
L _ N _ Clue
LET'S ASSUME THAT THERE IS ONLY 1 CHEATING HUSBAND. THEN HIS WIFE DOESN'T SEE ANYBODY CHEATING, SO SHE KNOWS HE CHEATS, AND SHE WILL KILL HIM THAT VERY DAY. NOW, LET'S SAY THAT THERE ARE 2 CHEATING HUSBANDS. THERE WILL BE 98 WOMEN IN THE TOWN WHO KNOW WHO THE 2 CHEATERS ARE. THE 2 WIVES, WHO ARE BEING CHEATED ON, WOULD THINK THAT THERE IS ONLY 1 CHEATER IN THE TOWN. SINCE NEITHER OF THESE 2 WOMEN KNOW THAT THEIR HUSBANDS ARE CHEATERS, THEY BOTH DO NOT REPORT THEIR HUSBANDS IN ON THE DAY OF THE ANNOUNCEMENT. THE NEXT DAY, WHEN THE 2 WOMEN SEE THAT NO HUSBAND WAS EXECUTED, THEY REALIZE THAT THERE COULD ONLY BE ONE EXPLANATION - BOTH THEIR HUSBANDS ARE CHEATERS. THUS, ON THE SECOND DAY, 2 HUSBANDS ARE EXECUTED. THROUGH MATHEMATICAL INDUCTION, IT CAN BE PROVED THAT WHEN THIS LOGIC IS APPLIED TO N CHEATING HUSBANDS, THEY ALL DIE ON THE N TH DAY AFTER THE QUEEN'S ANNOUNCEMENT. SO WITH 100 CHEATING HUSBANDS, ALL OF THEM WILL BE EXECUTED ON THE 100TH DAY THE CHILDREN ARE 1, 6 AND 6 YEARS OLD. THE PRODUCT OF THEIR AGES IS 36, SO NONE OF THEM CAN BE OLDER THAN 36. THE NUMBER 36 HAS TO BE EXPRESSED AS THE PRODUCT OF 3 NUMBERS. THEIR POSSIBLE AGES ARE (THE SUM OF THEIR AGES IS IN BRACKETS): 1, 1, 36 (3938) 1, 2, 18 (21) 1, 3, 12 (16) 1, 4, 9 (14) 1, 6, 6 (13) 2, 2, 9 (13) 2, 3, 6 (11) 3, 3, 4 (10) SINCE CHERYL IS TOM'S NEXT DOOR NEIGHBOUR, TOM KNOWS CHERYL'S HOUSE NUMBER. TOM WOULD KNOW THE CHILDREN'S AGES IN EVERY CASE THAT SUMS UP TO A UNIQUE NUMBER EXCEPT FOR THE SUM OF 13, WHICH HAVE 2 COMBINATIONS OF POSSIBLE AGES. AS A RESULT, TOM WOULD BE CONFUSED AS HE HAS TO PICK BETWEEN THE 2 COMBINATIONS: (1,6,6) AND (2,2,9). CHERYL THEN TELLS TOM ABOUT HER YOUNGEST CHILD WHO LIKES STRAWBERRY MILK WHICH TELLS TOM THAT THERE IS ONLY 1 YOUNGEST CHILD THE MOTHER WAS THE MURDERER. WE KNOW FROM (3) THAT THE YOUNGEST PERSON WAS NOT THE VICTIM, FROM (4) THAT THE YOUNGEST PERSON WAS NOT THE HELPER AND FROM (6) THAT THE YOUNGEST PERSON WAS NOT THE KILLER. THE YOUNGEST PERSON CAN ONLY HAVE BEEN THE WITNESS THEREFORE. WE CAN WORK OUT FROM (5) THAT THE FATHER WAS THE OLDEST, FROM (2) THAT THE YOUNGEST PERSON MUST HAVE BEEN THE DAUGHTER. THEREFORE THE NEXT TO THE YOUNGEST MUST HAVE BEEN THE SON AND THE NEXT TO THE OLDEST, THE MOTHER. FROM THE STATEMENTS, WE CAN SORT OUT THE MEMBERS BASED ON AGE, FROM OLDEST TO YOUNGEST AS: FATHER, MOTHER, SON, DAUGHTER. WE CAN COME TO THE FOLLOWING CONCLUSION: MOTHER - MURDERER FATHER - HELPER SON - VICTIM DAUGHTER - WITNESS LISA IS MARRIED TO GEORGE, AND THEIR 10 YEAR OLD PLAYS WITH NINTENDO. THEY LIKE TO EAT AT BURGER KING. THE ASSOCIATIONS ARE: CHILD AGE 4, MOTHER REGINA, FATHER LARRY, TRAINS, KFC CHILD AGE 6, MOTHER JULIE, FATHER STEVE, POKEMAN, MCDONALDS CHILD AGE 8, MOTHER MARIE, FATHER MIKE, BARBIE, TACO BELL CHILD AGE 10, MOTHER LISA, FATHER GEORGE, NINTENDO, BURGER KING CHILD AGE 12, MOTHER CAROL, FATHER BILL, GI JOE, DAIRY QUEEN TO SOLVE, DRAW A GRID WITH FIVE ROWS AND FIVE COLUMNS. ACROSS THE TOP, ABOVE THE COLUMNS, WRITE AGE, MOTHER, FATHER, TOY AND FOOD. FIGURE OUT THE KNOWN AGES AND WRITE THEM IN ORDER IN THE FIRST COLUMN. ONE CHILD'S AGE IS UNKNOWN AT FIRST. HOWEVER, ONCE THE YOUNGEST CHILD IS DISCOVERED (THE ONE WHO PLAYS WITH TRAINS) IT IS THEN KNOWN THAT THE OLDEST CHILD IS THE CHILD WITH THE UNKNOWN AGE. THROUGH ADDITIONAL CLUES, IT IS POSSIBLE TO DETERMINE THAT THE OLDEST CHILD IS AGE 12. TAKE THE CLUE, LISA?S CHILD IS 10. IN THE MOTHER COLUMN CORRESPONDING TO THE AGE 10, YOU WOULD WRITE LISA (MAYBE CIRCLE IT, BECAUSE IT IS THE CORRECT ANSWER.) IN THE MOTHER COLUMN FOR EVERY OTHER AGE, WRITE "NOT LISA". DO THIS FOR EACH CLUE. IF YOU KNOW THE ANSWER BECAUSE OF A CLUE, WRITE IT IN THE APPROPRIATE COLUMN, AND THEN BE SURE TO WRITE "NOT SUCH AND SUCH" IN ALL THE OTHER ROWS FOR THAT CLUE. FOR EXAMPLE, "THE YOUNGEST CHILD PLAYS WITH TRAINS", WOULD RESULT IN "NOT TRAINS" FOR ANY CHILD YOU CAN TELL ISN?T THE YOUNGEST, BUT YOU CAN?T WRITE "TRAINS" FOR ANY CHILD, BECAUSE YOU DON?T KNOW WHICH CHILD IS THE YOUNGEST AT FIRST. EVENTUALLY, YOU MAY FIND THAT "MOTHER NOT MARIE" IS ON EVERY LINE EXCEPT ONE, AND THEN YOU WOULD KNOW THAT MARIE IS THE MOTHER ON THE EMPTY LINE