can it be like... one person sees any other person's number and guesses it first. then, everybody else guesses the same number. this way, atleast one guesses it right, since there is no boundation on the no. of wrong guesses.
On Jul 3, 11:10 pm, jalaj jaiswal <jalaj.jaiswa...@gmail.com> wrote: > N people team up and decide on a strategy for playing this game. Then they > walk into a room. On entry to the room, each person is given a hat on which > one of the first N natural numbers is written. There may be duplicate hat > numbers. For example, for N=3, the 3 team members may get hats labeled 2, 1, > 2. Each person can see the numbers written on the others' hats, but does not > know the number written on his own hat. Every person then simultaneously > guesses the number of his own hat. What strategy can the team follow to make > sure that at least one person on the team guesses his hat number correctly? > -- > > With Regards, > Jalaj Jaiswal > +919026283397 > B.TECH IT > IIIT ALLAHABAD -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
