Game Theory: Tough Puzzle

[JKilez]

The solution that PVirtanen and Chronos provide makes sense as far as I can see.

On day X, if a monk sees X-1 other monks infected, he would know that he too is infected and should kill himself. On day X+1, there is no plague.

The “you are a writer” bit appears to be there to justify the one piece of knowledge that is given to the monks–that at least one of them has the plague. We are also making the assumuption that these monks are a logical order.

[Trunk]

@SoulSearching

There is absolutely no form of communication between the monks, directly or indirecty. For instance, a monk who see another monk having the plague cannot and does not make a facial gesture, any form of ostacizing infected monks is also impossible. In short, a monk who is infected cannot determine if he is infected based on the behaviour of other monks. No communication.

The “communication” is the combination of

1. the knowledge that at least one monk has the disease
2. observing the other monks

If you want to be picky, interprety “no communication” as “the only communication is observing other monks”

@SoulSearching

To the poster who says that D = n^0, I am curious as to your conclusion as you are basically stating that D is 1. I am quite eager to solve this and rid the headaches it has caused. Maybe you could post the explanation under a spoiler warning so those who wish to still work on the problem may do so.

He was wrong.