Page 1 of 1

Village of Perfect Reasoning

Posted: Sat Oct 20, 2007 1:32 am UTC
by Gyvulys624
I did a search and didn't find this one here Someone already answered it before I could on my other forum, but he didn't explain it well enough to my liking, or understanding. So please give a crack at it.

In the village of Perfect Reasoning, each employer has an apprentice. At least one apprentice is a thief. To remedy this without embarrassment, the mayor proclaims the following true statements: "At least one apprentice in this town is a thief. Every thief is known to be a thief by everyone except his or her employer, and all employers reason perfectly. If n days from now you have concluded that your apprentice is a thief, you will come to the village square at noon that day to denounce your apprentice." The villagers gather at noon everyday thereafter. If in fact k>=1 of the apprentices are thieves, when will they be denounced, and how do their employers reason?

Again, I'm looking for an answer and a well explained proof.

Re: Village of Perfect Reasoning

Posted: Sat Oct 20, 2007 2:02 am UTC
by Buttons
Spoiler:
Well, everyone knows that thieves only steal from employers with blue eyes. If an employer sees that there are k other employers with thieves, and that said employers don't show up after k days, then that employer will show up on the k+1-st day to proclaim that his apprentice is a thief. That is, if there are n thieves total, then all of the blue-eyed people will leave the island after n days after the guru speaks.
Or something like that. I may have been mixing up my problems.

(Less cheekily: there's already a thread on this, but it's worded differently.)

Re: Village of Perfect Reasoning

Posted: Sat Oct 20, 2007 2:57 am UTC
by DrStalker
There's also the version where some husbands are unfaithful and every wife (except the cheaters own wives) know they are. And the monastery where blue-eyed monks have to throw themselves off a cliff, but they can't talk to tell each other what eye colour they have.

When you know a puzzle like Blue Eyes it's very easy to look at something like this and say "it's just Blue Eyes, worded differently" but if you don't know the puzzle good luck ever finding Blue Eyes from this. If only the forum search allowed us to search for the logical concepts in problems instead of text.

Re: Village of Perfect Reasoning

Posted: Sat Oct 20, 2007 10:51 am UTC
by Token
DrStalker wrote:There's also the version where some husbands are unfaithful and every wife (except the cheaters own wives) know they are. And the monastery where blue-eyed monks have to throw themselves off a cliff, but they can't talk to tell each other what eye colour they have.

When you know a puzzle like Blue Eyes it's very easy to look at something like this and say "it's just Blue Eyes, worded differently" but if you don't know the puzzle good luck ever finding Blue Eyes from this. If only the forum search allowed us to search for the logical concepts in problems instead of text.

Hmm... I wonder if Google will ever come up with an algorithm for that?

Re: Village of Perfect Reasoning

Posted: Sun Oct 21, 2007 2:54 am UTC
by DrStalker
Token wrote:Hmm... I wonder if Google will ever come up with an algorithm for that?


If I was going to bet on who would design such a thing eventually I'd wager on Google.

Re: Village of Perfect Reasoning

Posted: Sun Oct 21, 2007 11:14 pm UTC
by Gyvulys624
Maybe someone already started. But they will probably learn to levitate - many times - before it is implemented. (Trusting you guys all know the comics round here - I spent hours on Friday going through them all - around number 250 I realized there were those roll over comments too, so I went back again).

Re: Village of Perfect Reasoning

Posted: Mon Oct 22, 2007 6:53 am UTC
by Basil
Spoiler:
k

There is at least 1 thief.
Every thief is known by everyone except their employer.

If the employer knows of no thieves, their apprentice must be it.

For example, if there are no thieves announced on the first 2 days, three employers will step forward, because they each only know of two thieves, their own apprentice must be a thief. On the third day each announces their discovery.