The Hardest Logic Puzzle in the World [Allegedly]


Submitted By : Gaurav (LTHE, Faridabad)
Source: TED-Ed (Youtube)
01

02

03

04

05

06

07

08

09

10

11

11_1

12

13

14

15

16

addtext_com_MDExMjI2Mjk4NDc5

Posted Under
  Subscribe  
newest oldest most voted
Notify of
Zaid Bin Nafees

The solution can be seen with a reasonable argument. let k=no. of green eyed people If k = 1, the person will recognize that they alone have green eyes (by seeing only non-green eyes in the others) and leave at the first dawn. If k = 2, no one will leave at the first dawn. The two green-eyed people, seeing only one person with green eyes, and that no one left on the 1st dawn (and thus that k > 1), will leave on the second dawn. Inductively, it can be reasoned that no one will leave at the first… Read more »