by Rahul Chimanbhai Mehta at October 28, 2014 at 09:25PM

Given : A planet has dragons. Dragon has blue eyes or red eyes. And dragons keep a tradition --- if a dragon deduces that he has green eyes, then at 12:01 am sharp next day, he will become sparrow. Each dragon can see others' eyes color but not color of his own eyes. There are no mirrors on planet. And dragons never talk about each others' eyes' color. . Problem-A ------------- On an isolated island, 4 dragons A, B C and D land. All have green eyes. Will they ever become sparrows after say 3 or 4 or 5 or 100 days? . Problem-B ------------- An outsider comes on that island and says, in an assembly where all A, B, C and D are present in front of each other that "one of you have green eyes". They all knew this anyway. So will they become sparrow? . Please note : . 1. Both are difficult problems. problem-A is very very difficult. problem-B is difficult. . 2. The problems are related to TCP-law-draft !!!! in fact, this problem show how effective TCP-law-draft is !! The website which shows count of YES-NO is outsider !! TCP-law-draft is given in section-1.3 of rahulmehta. com/301.htm . So problem has immense use in political analysis. . 3. HINT : Both problems are unrelated. . 4. The problem shows that "everybody knows" isnt same as "everybody knows that everybody knows that everybody knows ...." !!! .

by Rahul Chimanbhai Mehta



from Right to Recall Group http://ift.tt/ZYrHgg

via Bhavik Barai