Here's a spin on a classic, hope you all enjoy it!
Note: If you could all please input your answers using the previously noted html code it will allow others to answer without having a spoiler. Also, in your answer, do not include any ' or " or it will not work properly.
Question
This is the story of three unhappy people: Angelica, Bernardo, and Cameron. Angelica and Cameron have been friends since childhood. Cameron is hopelessly in love with Angelica, but Angelica has always thought of Cameron as "just a friend".
During high school, a new boy, Bernardo, moves into the area. Bernardo immediately catches the attention of Angelica, who falls head-over-heels for him. However, Bernardo is not interested in women and he is strongly attracted to Cameron. Cameron, of course, is jealous of Bernardo, because he has stolen Angelica's love away. Angelica is angry at Cameron, because she feels that Bernardo's lack of attention to her is Cameron's fault. Bernardo is jealous of Angelica, who recieves all of Cameron's attention.
One day, you meet them, all together in a chat room. They are all using nicknames: Uberkewl, Vaxxipaxx, and Derpyderp (in no particular order). Because they are so jealous and screwed-up, each of them will answer a question truthfully if and only if:
1) One of your last two questions was to their sweetheart.
2) Your last question wasn't to the person with whom they are upset.
Otherwise, they will answer spitefully by giving you the answer that will confuse you the most. Your task is to figure out who is who. Is it possible? If so, how many questions might you have to ask?
Good luck!
There are multiple ways of solving this:
No matter what, Policy 1 is moot for this strategy: if you ask all three the same question, one of the last two will always be a sweetheart of the third to last. Policy 2 can be tricky:
Name Game: Ask the last letter of their first name:as they all end in different letters. Each user will truthfully give the letter (without a doubt the first user has to be truthful as no policy goes into effect until after the next two). In realistic terms, the chat room setting will cause all of them to answer you at the same time if no noted by the example.
Moreover, this overcomes Policy 2:
Let's say the first user says his letter is "O" (Making him Bernardo). Now Policy 2 breaks down:
-If Angelica is the second person (you already know the third by now from being the remainder), you can ask the last question to Cameron to keep Bernardo happy (as it will not end on someone he hates).
-If the second person is Cameron, you do not need to ask Angelica anything (you already know she is the last one remaining, there is no need to upset Bernardo)
This cycle works for any one who goes first. To answer you question on the number of questions asked, it is either two or three.
Your HTML code doesn't work.
2 questions.
Your first two questions will be met with dishonest answers, since there's no way it will satisfy the qualifications listed above.
Pick any chat participant at random and ask them: 1. Who are you not? The person they name will be themselves.
Mission accomplished.
You've got to be kidding me with that 'better answer'. @"WallStreetOasis.com" that can't be allowed..
Vitae iusto voluptates qui sed. Tempore sunt aperiam cumque minima quis dicta.
Ipsam dolor in molestias omnis mollitia. Quam in esse consequatur. Cumque vitae aut rem quisquam nihil voluptatum.
Aut voluptas placeat saepe voluptatem est. Suscipit voluptatum consectetur consequatur. Voluptatem voluptas aliquid ipsum vel.
Ipsam nulla mollitia et quidem. Praesentium exercitationem sunt distinctio aut possimus dolorem. Consequatur facere sint quidem deleniti delectus ut similique. Sit dolor dolores unde qui autem. Sit omnis illo quam autem ab a aut.
See All Comments - 100% Free
WSO depends on everyone being able to pitch in when they know something. Unlock with your email and get bonus: 6 financial modeling lessons free ($199 value)
or Unlock with your social account...