rsaavedra
Headphoneus Supremus
- Joined
- Jan 20, 2002
- Posts
- 5,819
- Likes
- 21
100% can be legitimately saved because of lack of comprehensive constraints in the problem statement
Just for fun, but notice that nothing in the problem statement renders the following strategies invalid:
Strategy 1) All the guys wear a small mirror attached with velcro to the back of their shirts. Hence everyone will be able to guess their color correctly, except for the first guy in the line (last one to guess). Teammate #101 (in the audience) will call just that one guy telling him his hat color the following way: 1 ring == red, 2 rings == green, 3 rings == blue. That guy #1 in the line will have his cell phone in his pocket with mute ringing, just very discrete vibration mode. And just in case, he will have a cell phone that allows you to block any phone call other than those he wants to allow, and during the show he will allow only the number of the guy in the audience, teammate #101.
Strategy 2) Stretching the audience helper strategy a bit, let the 100 guys have their cell phones as in 1, and make teammate #101 call each and everyone of them.
Requirements for success of these lame strategies:
a) Cell phones will work at the show premises.
b) All of them should have charged batteries, and should have their accounts in good standing.
c) For strategy 2, the guy at the audience should be able to identify all of the 100 guys easily during the show and should find the number of any of them in his phonebook and place the call fast enough. Otherwise get sufficient helpers, e.g. 5 of them: teammates 101 to 105, or let's call them A, B, C, D, and E, and assign to each one of them groups of 20 guys to call, spreading the calls required from each as much as possible, as in:
#100 called by A
#99 called by B
#98 called by C
#97 called by D
#96 called by E
#95 called by A
#94 called by B
:
and so and so forth
Strategy 1) All the guys wear a small mirror attached with velcro to the back of their shirts. Hence everyone will be able to guess their color correctly, except for the first guy in the line (last one to guess). Teammate #101 (in the audience) will call just that one guy telling him his hat color the following way: 1 ring == red, 2 rings == green, 3 rings == blue. That guy #1 in the line will have his cell phone in his pocket with mute ringing, just very discrete vibration mode. And just in case, he will have a cell phone that allows you to block any phone call other than those he wants to allow, and during the show he will allow only the number of the guy in the audience, teammate #101.
Strategy 2) Stretching the audience helper strategy a bit, let the 100 guys have their cell phones as in 1, and make teammate #101 call each and everyone of them.
Requirements for success of these lame strategies:
a) Cell phones will work at the show premises.
b) All of them should have charged batteries, and should have their accounts in good standing.
c) For strategy 2, the guy at the audience should be able to identify all of the 100 guys easily during the show and should find the number of any of them in his phonebook and place the call fast enough. Otherwise get sufficient helpers, e.g. 5 of them: teammates 101 to 105, or let's call them A, B, C, D, and E, and assign to each one of them groups of 20 guys to call, spreading the calls required from each as much as possible, as in:
#100 called by A
#99 called by B
#98 called by C
#97 called by D
#96 called by E
#95 called by A
#94 called by B
:
and so and so forth