Dragon IQ problem: dragon thinking it may have green eyes stops
| Black Insecure Center | 10/07/14 | | Bespoke azure parlor | 10/07/14 | | Lascivious toaster | 10/07/14 | | tan legal warrant | 10/07/14 | | Black Insecure Center | 10/07/14 | | Twinkling Ticket Booth Stain | 10/07/14 | | diverse abnormal space affirmative action | 10/07/14 | | Floppy tanning salon sweet tailpipe | 10/07/14 | | vivacious stead | 10/08/14 | | swollen roast beef | 10/08/14 | | Adventurous violet cumskin organic girlfriend | 10/07/14 | | swollen roast beef | 10/07/14 | | nubile mint regret | 10/07/14 | | Adventurous violet cumskin organic girlfriend | 10/07/14 | | swollen roast beef | 10/07/14 | | Adventurous violet cumskin organic girlfriend | 10/07/14 | | swollen roast beef | 10/07/14 | | Adventurous violet cumskin organic girlfriend | 10/07/14 | | Twinkling Ticket Booth Stain | 10/07/14 | | Big cream hospital | 10/07/14 | | Lascivious toaster | 10/07/14 | | swollen roast beef | 10/07/14 | | tan legal warrant | 10/07/14 | | swollen roast beef | 10/07/14 | | tan legal warrant | 10/07/14 | | Adventurous violet cumskin organic girlfriend | 10/07/14 | | Lascivious toaster | 10/07/14 | | diverse abnormal space affirmative action | 10/07/14 | | Twinkling Ticket Booth Stain | 10/07/14 | | vivacious stead | 10/08/14 | | swollen roast beef | 10/08/14 | | Lascivious toaster | 10/07/14 | | tan legal warrant | 10/07/14 | | Adventurous violet cumskin organic girlfriend | 10/07/14 | | Lascivious toaster | 10/07/14 | | vivacious stead | 10/08/14 | | diverse abnormal space affirmative action | 10/07/14 | | Adventurous violet cumskin organic girlfriend | 10/07/14 | | diverse abnormal space affirmative action | 10/07/14 | | diverse abnormal space affirmative action | 10/07/14 | | useless dopamine | 10/07/14 | | swollen roast beef | 10/07/14 | | diverse abnormal space affirmative action | 10/07/14 | | swollen roast beef | 10/07/14 | | plum federal national | 10/07/14 | | useless dopamine | 10/07/14 | | Twinkling Ticket Booth Stain | 10/07/14 | | swollen roast beef | 10/07/14 | | plum federal national | 10/07/14 | | swollen roast beef | 10/07/14 | | plum federal national | 10/07/14 | | swollen roast beef | 10/07/14 | | plum federal national | 10/07/14 | | useless dopamine | 10/07/14 | | swollen roast beef | 10/07/14 | | plum federal national | 10/07/14 | | plum federal national | 10/07/14 | | useless dopamine | 10/07/14 | | plum federal national | 10/07/14 | | useless dopamine | 10/07/14 | | swollen roast beef | 10/07/14 | | plum federal national | 10/07/14 | | useless dopamine | 10/07/14 | | swollen roast beef | 10/07/14 | | plum federal national | 10/07/14 | | swollen roast beef | 10/07/14 | | plum federal national | 10/07/14 | | useless dopamine | 10/07/14 | | Black Insecure Center | 10/08/14 | | Exhilarant puppy voyeur | 10/07/14 | | swollen roast beef | 10/07/14 | | Exhilarant puppy voyeur | 10/07/14 | | stimulating mad cow disease | 10/07/14 | | stimulating mad cow disease | 10/07/14 | | trip headpube jew | 10/07/14 | | stimulating mad cow disease | 10/07/14 | | cerebral international law enforcement agency | 10/07/14 | | swollen roast beef | 10/07/14 | | cerebral international law enforcement agency | 10/07/14 | | swollen roast beef | 10/07/14 | | cerebral international law enforcement agency | 10/07/14 | | swollen roast beef | 10/07/14 | | plum federal national | 10/07/14 | | stimulating mad cow disease | 10/07/14 | | trip headpube jew | 10/07/14 | | gaped indecent ape | 10/07/14 | | Adventurous violet cumskin organic girlfriend | 10/07/14 | | diverse abnormal space affirmative action | 10/08/14 | | swollen roast beef | 10/08/14 | | diverse abnormal space affirmative action | 10/08/14 | | swollen roast beef | 10/08/14 | | diverse abnormal space affirmative action | 10/08/14 | | swollen roast beef | 10/08/14 | | diverse abnormal space affirmative action | 10/08/14 | | diverse abnormal space affirmative action | 10/08/14 | | swollen roast beef | 10/08/14 | | diverse abnormal space affirmative action | 10/08/14 | | swollen roast beef | 10/08/14 | | diverse abnormal space affirmative action | 10/08/14 | | swollen roast beef | 10/08/14 | | diverse abnormal space affirmative action | 10/08/14 | | swollen roast beef | 10/08/14 | | swollen roast beef | 10/08/14 | | diverse abnormal space affirmative action | 10/08/14 | | Black Insecure Center | 10/08/14 | | swollen roast beef | 10/08/14 | | Black Insecure Center | 10/08/14 | | swollen roast beef | 10/08/14 | | odious partner messiness | 10/08/14 | | Black Insecure Center | 10/08/14 | | diverse abnormal space affirmative action | 10/08/14 | | Green Titillating Corner | 10/08/14 | | Twinkling Ticket Booth Stain | 10/08/14 | | Green Titillating Corner | 10/08/14 | | Twinkling Ticket Booth Stain | 10/08/14 | | odious partner messiness | 10/08/14 | | swollen roast beef | 10/08/14 | | Black Insecure Center | 10/08/14 | | odious partner messiness | 10/08/14 | | Green Titillating Corner | 10/08/14 | | Frisky razzle skinny woman | 10/08/14 | | Black Insecure Center | 10/08/14 | | Frisky razzle skinny woman | 10/08/14 | | trip headpube jew | 05/15/17 | | trip headpube jew | 08/09/19 |
Poast new message in this thread
Date: October 7th, 2014 5:37 PM Author: Black Insecure Center
stops the recursion, right? A dragon doesn't sparrow when he is no longer certain that he doesn't have green eyes, only when he knows that he has green eyes. As such, and dragon that is uncertain whether he has green eyes wouldn't sparrow.
From the Harvard explanation:
If N = 3, let the dragons be called A, B, and C. After your announcement, C will think to himself, “If I do not have green eyes, then A and B can see that I don’t, so as far as they are concerned, they can use the reasoning for the N = 2 situation, in which case they will both turn into sparrows on the second midnight.” Therefore, if A and B do not turn into sparrows on the second midnight, then on the third day C will conclude that he himself must have green eyes, and so he will turn into a sparrow on the third midnight. The same thought process will occur for A and B, so they will all turn into sparrows on the third midnight. The pattern now seems clear.
http://www.physics.harvard.edu/uploads/files/undergrad/probweek/sol2.pdf
Why would perfectly logical dragon C think “If I do not have green eyes, then A and B can see that I don’t." In this situation, dragon C would think "I may or may not have green eyes, and therefore I cannot remove myself from the pool of dragons that may have green eyes." Based on this, dragon C cannot infer anything about the other dragons' knowledge when they are still around on the third night since from dragon C's perspective, it is possible, but not certain, that dragon A is not sparrowing because he believes that one other dragon has green eyes or that two other dragons have green eyes. Given this indeterminacy that is allowed by the logic in the problem , I don't understand how the N=2 deduction can be applied to N=3, which in turn prevents the recursion.
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26474208)
|
 |
Date: October 7th, 2014 5:59 PM Author: diverse abnormal space affirmative action
Don't get caught up in the "remove yourself from pool" explanation, it's not helpful and glosses over the conceptual difficulty, it's just technically correct from a formalistic proof perspective.
The baseline belief for each of A, B, and C, pre-announcement, is this:
(1) I may have Brown (non-Green) eyes, but the other two have Green eyes.
(2) Each of the other two sees 1 definite Green eye, 1 maybe Brown eye (mine), and thinks that he himself has 1 maybe Brown eye.
(3) this is where it gets tricky: Each of the other two thinks that the other one sees 2 Brown eyes, and thinks that he himself has 1 maybe Brown eye.
Post announcement, each knows that (3) is no longer true.
(3) is very tricky because clearly, A knows that C sees at least one green eye, but A also thinks that B is an idiot who thinks that C sees 2 brown eyes. This is implausible on an intuitive level, but is logically allowed based on the premise of the story.
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26474324) |
 |
Date: October 7th, 2014 5:59 PM Author: Lascivious toaster
At least 1 dragon has green eyes.
1 dragon = Dragon 1 knows its him immediately on day 1
2 dragons = a dragon (Dragon 2) watching Dragon 1 who would know immediately he has green eyes if Dragon 2 had non-green eyes. When Dragon 1 doesn't change at end of day 1, Dragon 2 knows he too has green eyes.
3 dragons = a dragon (Dragon 3) watching the 2 dragon scenario, and when neither change at the end of Day 2, he knows he also has green eyes
4 dragons = a dragon (Dragon 4) watching the 3-dragon scenario...at end of day 3 knows he's a dragon
and so on
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26474323) |
 |
Date: October 8th, 2014 1:47 PM Author: vivacious stead
assuming they are in constant contact which isn't in the original question,
a dragon knows that every other dragon can see exactly what he sees with one exception, you can see his eyes and he can see yours
the other dragons just become a number that every dragon already knows.
you can still hold out hope that you are the lone exception, until every other dragon sticks around past the point that you could have been the exception.
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26479948) |
Date: October 7th, 2014 6:14 PM Author: diverse abnormal space affirmative action
This problem illustrates the difference between (1) everyone in the group being rational and (2) everyone in the group being rational, and knowing that everyone else is rational as well.
The human's announcement puts the dragon population from (1) to (2). Before, they were just in (1).
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26474428) |
 |
Date: October 7th, 2014 6:24 PM Author: useless dopamine
There is nothing in the terms of the problem as stated that requires each dragon to assume as a fact that every other dragon sees 99 green eyed dragons.
Indeed wouldn't it be the case that if this was a fact then every dragon should have sparrowed long ago because if every dragon knew as a fact that every other dragon was also seeing 99 green eyed dragons then one of those dragons must be himself?
Because the problem allows the dragons to assume other dragons hold mistaken beliefs then the dragons can construct the chain of mistaken beliefs and rely on that not to sparrow. The new fact destroys the chain.
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26474487) |
 |
Date: October 7th, 2014 7:17 PM Author: plum federal national
Isn't there some old thread where she tries to discuss some fairly complicated proofs or something?
I realize this goes nowhere in terms of proving she's a real person or not the shrewmo/SB/mydoghasmoredates troll. If I recall, the 'medea' poster claimed to be some sort of engineer and could capably discuss math too.
Also would like for her to hold forth on some geeky international tax law bullshit.
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26474772) |
 |
Date: October 7th, 2014 7:41 PM Author: useless dopamine
Why be so rude?
I agree "belief" is imprecise because the dragons being totally logical creatures must simply adopt the necessary state of mind that logic requires, they don't get to choose what to believe, but "belief" is convenient shorthand for "state of mind that logic requires the dragon to hold".
I posted my attempt at a solution yesterday here:
http://www.autoadmit.com/thread.php?thread_id=2693243&mc=357&forum_id=2#26468930
The difference from the other attempts is that I tried to reason down from the 100 dragon case instead of up from the 1 dragon case.
If you don't agree with my attempt then you're welcome to respond to it.
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26474937) |
 |
Date: October 7th, 2014 7:56 PM Author: useless dopamine
Well if you think its reasonably straightforward then you're obviously far more intelligent than me. I thought it was pretty difficult but I gave it my best shot yesterday.
Maybe my solution is wrong, though at least one poster who's deep into the issue thinks its right, or maybe its just the same reasoning as the published proof but approaching the problem the reverse way by reasoning down from 100 instead of up from 1. I've glanced at the published proof but I haven't directly compared them.
If you think its all straightforward then you can tell me where I went wrong yesterday.
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26475068) |
 |
Date: October 7th, 2014 8:09 PM Author: plum federal national
You took the time to reason through and write that explanation, but only 'glanced' at the page and a half answer?
Good lord. Twist has explained why you're deviating from the rules of the problem a dozen times in a dozen ways. You can make the problem much more difficult and ambiguous by injecting assumptions are purposefully playing rhetorical games with the rules, but you're not supposed to do that. This isn't an original or debated problem. It's asking you to do specific things and the result is you arrive at the inductive chain outlined in the answer.
What kind of maths did you major in, just out of curiosity?
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26475226) |
 |
Date: October 7th, 2014 8:19 PM Author: useless dopamine
Have a look at the debate in the original thread starting here:
http://www.autoadmit.com/thread.php?thread_id=2693243&mc=357&forum_id=2#26472408
Twist has a view and lolcats4eva has a view, and I happen to agree with lolcats4eva. The competing arguments are all set out in the posts following and I don't feel like summarising them again.
If you think Twist is right go and argue with lolcats4eva and tell him he is wrong because I am not interested in using discussion over this problem as an excuse for you to insult me.
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26475334) |
 |
Date: October 7th, 2014 8:27 PM Author: plum federal national
You seriously take my post as an excuse to insult you? The question about your major was entirely sincere.
I have read the debates and you can see I'm not entering them because I really have nothing to add. I am simply pointing out that as a math major and a fucking tax lawyer, your rejection of the rules clearly set out by the problem is pretty unusual. Read the actual answer and then state in three sentences or less why your reasoning is at all valid or makes more sense.
Like I said before, this isn't some kind of rare or controversial problem, nor is it a trick question. The rules set you up for the induction chain.
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26475393) |
 |
Date: October 7th, 2014 8:36 PM Author: useless dopamine
You want to be a dick to me because I had a serious go at trying to solve a problem 95% of xo got nowhere with then fine, go ahead, but in future please just pretend I don't exist and I'll extend you the same courtesy.
That way you won't need to deal with my stupidity and I won't need to deal with your rudeness, which I may say is completely uncalled for as I have never been anything other than unfailingly polite to you.
I'm not a mathematician and I haven't studied mathS for almost 15 years so I am not ashamed that my attempt isn't up to the standard of Harvard mathematicians.
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26475479) |
 |
Date: October 7th, 2014 8:41 PM Author: plum federal national
WTF is this rage over this? Explain how I am being a dick. I'm not calling you stupid or holding you to ridicule. I said I'm surprised by your response and reasoning, especially since you should have some familiarity with this type of problem.
The problem is from a Harvard class, but you don't need to be a Harvard mathematician to grasp it or solve it. It's just a rephrasing of a common setup that you can probably find in hundreds of syllabi every year.
This outsized reaction isn't at all in keeping with the 'twentynine' posting presence I'm familiar with. I have seen dozens of poster rail at you for being the most autistic and bland poster in the history of the board and your reaction is essentially "eh, ok." Very odd case.
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26475524)
|
Date: October 7th, 2014 8:08 PM Author: Exhilarant puppy voyeur
1) Bitch should have given a "trigger warning" before opening her mouth.
2) Is this what the difference of universal knowledge and common knowledge is? Everyone knows there are 99 green dragons is universal knowledge, everyone knows that everyone knows that everyone knows... that there is at least one green dragon is the common knowledge that is new.
3) You guys are being dicks to 29. She's a terrible poster usually but she seems get it much more than almost any other woman on here would.
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26475208) |
Date: October 7th, 2014 8:51 PM Author: stimulating mad cow disease
this is retarded...
each dragon writes down the eye color of every other dragon: ie: the set of all other dragons.
by intersection, dragons would all know there are none without green eyes.
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26475613)
|
Date: October 7th, 2014 9:09 PM Author: gaped indecent ape
how the fuck are you guys still talking about this?
all of this talk about who knows what, look--there is some THING that causes the induction that we all agree happens. maybe it's that they didn't have a concept of 'green eyes', and now they do. maybe it's the introduction of other-knowledge.
the first domino is the first domino; they point is the exposition of the induction, which just about everyone gets. don't sweat the details. *eats feces*
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26475762) |
Date: October 7th, 2014 9:22 PM Author: Adventurous violet cumskin organic girlfriend
A strange variant I've thought of and don't really know the answer to:
Suppose there's no visitor, and instead each dragon publicly announces how many pairs of green eyes he can see, but only after randomly subtracting between 0 and 95 from his total. By happenstance, no dragon actually has zero subtracted, so we get a range of values from 4 to 98. This also appears to just confirm what the dragons already know, albeit in a more exotic way.
Do the dragons still transform in this situation?
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26475875) |
 |
Date: October 8th, 2014 10:52 AM Author: diverse abnormal space affirmative action
I feel like 29 and I have explained how new information is added to the base scenario to cause the cascade sufficiently well.
After thinking about it some more, I'm pretty confident it's correct.
I don't poast very often and don't know you as a poaster, but I recall that you got that lion-sheep game spectacularly wrong, so maybe give me the benefit of the doubt for this one and go back to what I've said.
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26478928) |
 |
Date: October 8th, 2014 11:05 AM Author: swollen roast beef
The point of the new hypo is that you get the same information from it (at least one dragon has green eyes), and publicly.
I didn't get the lion-sheep riddle wrong, I just missed the list step. You still haven't gotten this one right. Everything 29 has posted has been 10 times as wordy as necessary and 1/10th as correct. She's also a known sociopath.
For example, you said above that before the human said something, the dragons didn't know the other dragons were rational. But they did. "At least one of you has green eyes" couldn't possibly communicate "You're all rational". That's nuts.
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26479001) |
 |
Date: October 8th, 2014 11:23 AM Author: diverse abnormal space affirmative action
I already said I was wrong on that, which is clearly documented. It's not about rationality at all.
You're not getting the same information from it because 100 dragons saying (a - zz) is very different from one person saying (at least 1). It's literally impossible to believe (a - zz) simultaneously. The problem implicitly states that all of the dragons believe that the other dragons believe the utterance being made.
Edit: mathematical induction is of course the correct formal proof of the solution, but it does not address the question of what new information is added that would cause the cascade.
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26479116) |
 |
Date: October 8th, 2014 11:54 AM Author: diverse abnormal space affirmative action
sorry can you clarify what you mean by "it" in "it provides the base case for the induction?" Also I've read the Harvard site, it's a very basic proof by induction but it does not speak as to what new information is being added.
If by "it" you mean the publicly announced known fact that there is at least one green eyed dragon, then yes I agree, but not just the fact itself, but the fact that it is accepted by other dragons, which was previously unknown by the dragons.
Take the two dragon scenario. It is publicly known that there is at least one green-eyed dragon, but it is NOT the case that Dragon A thinks that Dragon B knows this. Why? Suppose the opposite - if Dragon A thinks, before the announcement is made, that Dragon B knows that there is at least one green-eyed dragon, then Dragon A would expect Dragon B to sparrow (because Dragon A believes that he himself is not green-eyed). Since pre-announcement Dragon A had no such expectation, then it must not be the case that Dragon A thinks that Dragon B knows the public information.
Does that help at all?
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26479283) |
 |
Date: October 8th, 2014 12:09 PM Author: diverse abnormal space affirmative action
You're absolutely correct, but you're also missing something, just like the lion-sheep problem.
At N = 3, for example, you're right, Dragon A (holds for each dragon), KNOWS that both Dragon B and Dragon C can see at least 1 green eye.
BUT, Dragon A thinks that Dragon B thinks that Dragon C does not see ANY green eyes.
THAT'S what causes Dragon A to think that, post announcement, Dragon C (and Dragon B) will sparrow, it's because after day 1, Dragon A will expect dragon B to expect Dragon C to sparrow, and when Dragon C doesn't sparrow, Dragon A will expect Dragon B to sparrow.
Do you see how the expectation chain (which the Harvard explanation also describes and which you must agree), must be collapsed through the original build up of the nested beliefs?
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26479360) |
 |
Date: October 8th, 2014 12:35 PM Author: swollen roast beef
You're still describing it slightly wrong, which is what's giving some of us problems.
It's not that A thinks anything about what B thinks or whatever.
A thinks: "If I did not have green eyes, B would think: 'If I did not have green eyes, C would think: "If..."'", etc. down to "Z would think: 'I must turn into a sparrow tonight.'" It is not a set of nested mistaken beliefs, merely nested conditional reasoning. It's the nesting of conditions that allows for so many simultaneous "mistakes" to be made.
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26479504) |
 |
Date: October 8th, 2014 12:38 PM Author: Black Insecure Center
"BUT, Dragon A thinks that Dragon B thinks that Dragon C does not see ANY green eyes."
Why does Dragon A hold this belief about what Dragon B thinks that Dragon C sees?
This is the exact step in the problem that I am struggling with.
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26479524) |
 |
Date: October 8th, 2014 12:59 PM Author: Black Insecure Center
From the beginning, I have thought of the problem as set of steps consisting of conditional statements both with respect to what each dragon believes about the observable world and what each dragon believes other dragons believe about the observable world.
In the case of N=3, I understand that after the first night, no dragon sparrows because they each see at least one dragon with green eyes and therefore cannot deduce from the at least 1 dragon has green eyes rule that they are that dragon. I also understand that this imparts information to each dragon and that all of dragons would realize this about the other dragons.
After the first night:
1.A knows that B & C have green eyes.
2.A knows that B knows that C has green eyes.
3.A knows that C knows that B has green eyes.
4.A does not know what B knows about A's eyes.
5.A does not know what C knows about A's eyes.
6.From 4 and 5, A does not know if B & C see 1 or 2 sets of green eyes.
What I am failing to understand is how the second night adds any certainty from the perspective to any individual dragon.
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26479679) |
 |
Date: October 8th, 2014 1:03 PM Author: swollen roast beef
A says to himself:
"Assume I have non-green eyes. Then B will say to himself,
'Assume I have non-green eyes. Then C will say to himself,
"Assume I have non-green eyes. Then there are no dragons with green eyes. But I know there are. Therefore I must have green eyes and must sparrow tonight."
But C didn't sparrow. Therefore I must have green eyes and must sparrow tonight.'
But B didn't sparrow. Therefore I must have green eyes and must sparrow tonight."
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26479702) |
 |
Date: October 8th, 2014 1:05 PM Author: odious partner messiness
A knows that if B or C sees A's brown eyes, then B or C will only see one pair of green eyes. If B or C also had brown eyes, then the green eyed dragon (which they see) will know it is the one with green eyes and will sparrow.
Because B or C doesn't sparrow, they can tell that both of them saw green eyes in each other, and then on night 2 they will sparrow.
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26479710)
|
 |
Date: October 8th, 2014 1:45 PM Author: Black Insecure Center
OK, let's assume the counterfactual. A has brown eyes, and B and C have green eyes.
Observations during the first day (before the first midnight):
A: two sets of green eyes and 3 dragons present;
B: 1 set of green eyes, 1 set of brown eyes, and 3 dragons present;
C: same as B.
Result of application of conditional statement on first night: 3 dragons.
Observations on the second day:
Same as day 1, but from the presence of 3 dragons after the application of the conditional statements, the dragons have acquired more knowledge:
A:Same as on day 1;
B:would know that C saw a set of green eyes staring back when C looked at B;
C: would know that B saw a set of green eyes staring back when B looked at C.
Result of application of conditional statement on second night: 2 dragons sparrow.
Observations on the third day:
A: observes 1 dragon (himself) and deduces that B & C saw only 1 set of green eyes staring back and therefore that he does not have green eyes.
Now, applying this to our situation where all 3 dragons have green eyes, none would have sparrowed after the second night. After observing no sparrowing after the second application of the conditional statement, the dragons would know throughout the third day that they all had green eyes and all would sparrow the following midnight.
I was getting thrown off by people saying in the case of N=3, dragons would sparrow on the second night.
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26479933)
|
 |
Date: October 8th, 2014 1:13 PM Author: Green Titillating Corner
i don't get how you can exhaust dragons. given that you start off with 100 dragons, you being dragon #100, how can you sequentially exhaust dragons given that there's no way to isolate the n=2 case (only dragons 1 and 2), the n=3 case (dragons 1, 2, and 3), and so on? it's not like you're geographically separated from these dragons and get introduced to one new one every day. you see 99 other dragons from day 1, so when you isolate n=x on day x, the dragons in the set don't simply see (x-1) other dragons (which is necessary for the logic to be run.. right?), they instead see 99 dragons
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26479746) |
Date: October 8th, 2014 1:52 PM Author: Frisky razzle skinny woman
JFC
IT'S INDUCTION. USE INDUCTION.
(http://www.autoadmit.com/thread.php?thread_id=2694212&forum_id=2#26479982) |
|
|