Raul Miller wrote:
Unless we introduce some new element into the problem (for example:
I see nothing in the rules which prohibits people from inspecting
all the hats beforehand, whereupon they could all agree to pick the
number on the smallest valued hat
If the hats were inspected beforehand then person with the best hadwriting
just writes the number not found in the list (taking multiple entries of
same number into account) and the rest writes some doodles. Come on, Raul,
you really think it would make such a good puzzle to make me excited enough
to post it here?
nsg
_________________________________________________________________
Dont miss your chance to WIN $10,000 and other great prizes from Microsoft
Office Live http://clk.atdmt.com/MRT/go/aub0540003042mrt/direct/01/
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
