All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Logic > Liars and Knights
Mission: Impossible? (Posted on 2008-04-20) Difficulty: 5 of 5

"Good afternoon, Mr. Phelps. The Society of Logicians have recently discovered a plot to overthrow the friendly government of Uwalahooloo. Your mission, should you decide to accept it, is to return to Uwalahooloo and appropriate the alabaster crown, a totem in the keeping of the hostile chieftain. Bereft of this artefact, the chieftain will lose his standing with local warriors, and his plot will fail.

You will find the crown, unguarded, somewhere along one of the island's two paths, one coloured red, the other green. The false path is to avoided at all costs, as it leads through deadly quicksand.

Intelligence reports the island to be inhabited by three natives, each one a liar or a knight. The natives are identical in appearance, but may be distinguished by their differing garb. The native in green is a monolingual speaker of language g, while the native in red a monolingual speaker of language r. The native in yellow is also monolingual, but we have not been able to determine which of the two languages, either g or r, he speaks.

You may assemble the natives and pose one question per day. (The same question to each native). As is usual on Uwalahooloo, the questions have different meanings in the two languages. After responding, the natives will retire out of sight until the next day.

Be warned: the natives delight in tricking logicians: when out of sight the yellow native may change clothes with the native with whom he can communicate.

Finally, you need to be alerted to the fact that the natives are only conditionally friendly. They will patiently respond to two queries, but if you try to ask them a third question, they will their lose patience and have you over for dinner (typically covered in barbecue sauce). We therefore urge to you consider carefully which questions to pose.


Here, now, are the candidate questions with their alternative interpretations in languages g and r:

Hvilket?

g: Is the road with the crown the same colour as one of the other two natives' costumes?

r: Are the other two natives able to communicate?

Spoergsmaaler?

g: Is the yellow native the same truth type as the native with whom he can't communicate?

r: Are the other two natives of the same truth type?

Bliver?

g: Are the other two natives able to communicate?

r: Has there been a costume change?

Ud?

g: Has there been a costume change?

r: Is the road with the crown the same colour as one of the other two natives' costumes?

Should you be discovered in Uwalahooloo, the SL will deny any knowledge of your mission. Good luck, Jim. This tape will self destruct in 10 seconds."

Derive a syllogism, based on native responses, for the road containing the crown.

  Submitted by FrankM    
Rating: 3.0000 (2 votes)
Solution: (Hide)

The desired syllogism is:

R ⇔ {G H? = [ R S? = (R H? = Y H?)]} where:


G H? is true iff the green native responds positively to Hvilket?, etc.

R is true iff the trophy is located along the red path

Alternatively expressed, we take the green path iff there are an odd number of positive responses to G H?, R H?, Y H? and R S?.

Explanation:


One can easily confirm the following syllogism relating to the native responses to Hvilket?:

(1) R H? = (Y r = -R KH)

(2) Y H? = (Y r = -Y KH)

(3) G H? = (G KH = R)

Where

Y r is true iff the yellow native speaks r and, e.g., G KH is true iff the green native is a knight at the time of responding to Hvilket?


Eliminating Y r gives:

(4) (R H? = Y H?) ⇔ (R KH = Y KH)


Now define N K to be true iff there are an odd number of knights. We can see that

N K ⇔ [G KH = (R KH = Y KH)], i.e., (5) G KH ⇔ [N K = (R KH = Y KH)]

We can also check, case by case, to show that (6) N K = R S?


Combining (3-6) gives the desired syllogism.

Author's remarks:

I am proud with this problem to have met a self-imposed design criterion: The problem is difficult, even intimidating, yet the solution is quite simple. One reason this works because the native questions are formulated to nullify the significance of certain parameters. In the end only four responses matter, and the usual procedure for KL problems requiring of identification of knight(s) and liar(s) turns out to be superfluous. (In fact, I don't believe there is enough information to determine each participant's truth type).

The problem is crafted to obscure the identity of relevant elements. Thus knight parity emerges as a significant hidden variable, whereas costume (=truth type) exchange is exposed as a small child shouting for attention, but who has nothing much to say. My hope was that problem solvers would take satisfaction in uncovering these elements.

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Some ThoughtsPuzzle AnswerK Sengupta2023-09-06 04:30:31
re: Well done!snark2008-06-11 02:12:59
Well done!FrankM2008-04-27 05:48:49
Solutionre: Comments on the Bliver/Ud connectionDej Mar2008-04-26 18:44:53
Hints/TipsComments on the Bliver/Ud connectionFrankM2008-04-25 10:31:27
re: Watch ListFrankM2008-04-24 20:09:38
Watch ListGamer2008-04-24 19:57:52
Hints/TipsHint 3 (SPOILER)FrankM2008-04-24 07:04:29
Hints/TipsBBQ reprieve - Still Not There. (Walking together, you recount discoveries. I ask questions)7FrankM2008-04-24 06:51:51
Some ThoughtsSolution -- after the BBQ reprieveDej Mar2008-04-24 00:24:02
Hints/TipsHint 2 (SPOILER)FrankM2008-04-22 06:20:06
Hints/TipsHint 1 (SPOILIER)FrankM2008-04-21 20:59:56
Some ThoughtsSome promising ideas, but not a valid solutionFrankM2008-04-21 20:54:55
SolutionDej Mar2008-04-21 11:28:07
A word of encouragement from the creatorFrankM2008-04-21 07:24:59
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information