The Dink Network

Reply to Re: Two interesting puzzles

If you don't have an account, just leave the password field blank.
Username:
Password:
Subject:
Antispam: Enter Dink Smallwood's last name (surname) below.
Formatting: :) :( ;( :P ;) :D >( : :s :O evil cat blood
Bold font Italic font hyperlink Code tags
Message:
 
 
December 30th 2006, 11:01 AM
knightg.gif
cypry
Peasant He/Him Romania
Chop your own wood, and it will warm you twice. 
Try this one:
100 mathematicians are standing in a line, wearing a black or
white hat. Each mathematician can ONLY see the color of the hats
of the people in front of them. So the first person sees no hats,
the last sees 99.

The mathematicians are allowed to talk to each other and decide
upon a strategy, for a government rep is coming to cut off funding.
Each person can only say 'black' or 'white'. If you correctly say
what color hat you're wearing, your funding is continued and you
live. If you're wrong, you lose your funding, and you may as well
be dead.

How many mathematicians can you guarentee will keep their funding?
You are not allowed you use 'tricks', say a person delays 1 second
before answering means A, 2 seconds means B, .... You have to answer
IMMEDIATELY what color hat you're wearing.