Problem 1180. Knights and Knaves (part 2)

Created by Alfonso Nieto-Castanon

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:i/></w:rPr><w:t>This is a Matlab adaptation of the</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://en.wikipedia.org/wiki/Knights_and_Knaves\"><w:r><w:t>Knights and Knaves</w:t></w:r></w:hyperlink><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>logical puzzles</w:t></w:r><w:r><w:t>.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:i/></w:rPr><w:t>You are in an island where all inhabitants are either</w:t></w:r><w:r><w:t> Knights,</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>who always tell the truth, or</w:t></w:r><w:r><w:t> Knaves,</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>who always lie. The island inhabitants can always tell Knights and Knaves apart by their appearance, but to you, as an outsider, they look exactly the same</w:t></w:r><w:r><w:t>.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Previous problem in this series:</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/cody/problems/1179-knights-and-knaves-part-1\"><w:r><w:t>Knights and Knaves (part 1)</w:t></w:r></w:hyperlink></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Next problem in this series:</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/cody/problems/1189-knights-and-knaves-part-3\"><w:r><w:t>Knights and Knaves (part 3)</w:t></w:r></w:hyperlink></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Chapter 2</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>After your initial encounter with two island inhabitants you follow the road to the castle. You were minding your own business when suddenly you find yourself surrounded by a small mob of dubious-looking islanders. Blissfully unaware of the latest mob-behavior theories, you decide it will be safe to stay if most of these islanders turn out to be friendly Knights, while you better start running if most of them turn out to be treacherous Knaves. What question(s) you could ask them to determine your best course of action? (note: you are always confronted by an odd number of islanders)</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Details</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>You function will take a cell array of function handles as input (one element per islander), and must return</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>true</w:t></w:r><w:r><w:t> if you decide to run (if there are more Knaves than Knights) or</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>false</w:t></w:r><w:r><w:t> if you decide to stay (if there are more Knights than Knaves).</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[ function run = solver(f)]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>You may ask each inhabitant a question by evaluating his associated function handle on a char string (the 'question'). Strings must be a valid matlab commands that when evaluated return a scalar logical value (yes/no questions, where</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>true</w:t></w:r><w:r><w:t> is a yes, and</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>false</w:t></w:r><w:r><w:t> is a no). Strings may refer to the following variables:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"ListParagraph\"/><w:numPr><w:numId w:val=\"1\"/></w:numPr></w:pPr><w:r><w:t>A: an array (samel length as f) of logical values identifying each of the islanders as a Knight (true) or Knave (false)</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Asking questions, examples</w:t></w:r><w:r><w:t>:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[ x=f{3}('A(3)==true');]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>asks the third islander whether he is a Knight (note: this returns always</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>true</w:t></w:r><w:r><w:t>, since both Knights and Knaves would tell you they are Knights; remember, Knaves always lie)</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[ x=f{1}('sum(A)>2');]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>asks the first islander whether there are more than two Knights in the group (not particularly useful by itself since we do not know whether he is going to respond truthfully or not)</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

This is a Matlab adaptation of the <a href = "http://en.wikipedia.org/wiki/Knights_and_Knaves">Knights and Knaves</a> logical puzzles.You are in an island where all inhabitants are either Knights, who always tell the truth, or Knaves, who always lie. The island inhabitants can always tell Knights and Knaves apart by their appearance, but to you, as an outsider, they look exactly the same.Previous problem in this series: <a href = "http://www.mathworks.com/matlabcentral/cody/problems/1179-knights-and-knaves-part-1">Knights and Knaves (part 1)</a>Next problem in this series: <a href = "http://www.mathworks.com/matlabcentral/cody/problems/1189-knights-and-knaves-part-3">Knights and Knaves (part 3)</a>Chapter 2After your initial encounter with two island inhabitants you follow the road to the castle. You were minding your own business when suddenly you find yourself surrounded by a small mob of dubious-looking islanders. Blissfully unaware of the latest mob-behavior theories, you decide it will be safe to stay if most of these islanders turn out to be friendly Knights, while you better start running if most of them turn out to be treacherous Knaves. What question(s) you could ask them to determine your best course of action? (note: you are always confronted by an odd number of islanders)DetailsYou function will take a cell array of function handles as input (one element per islander), and must return true if you decide to run (if there are more Knaves than Knights) or false if you decide to stay (if there are more Knights than Knaves).<pre> function run = solver(f)</pre>You may ask each inhabitant a question by evaluating his associated function handle on a char string (the 'question'). Strings must be a valid matlab commands that when evaluated return a scalar logical value (yes/no questions, where true is a yes, and false is a no). Strings may refer to the following variables:<ul><li>A: an array (samel length as f) of logical values identifying each of the islanders as a Knight (true) or Knave (false)</li></ul>Asking questions, examples:<pre> x=f{3}('A(3)==true');</pre>asks the third islander whether he is a Knight (note: this returns always true, since both Knights and Knaves would tell you they are Knights; remember, Knaves always lie)<pre> x=f{1}('sum(A)&gt;2');</pre>asks the first islander whether there are more than two Knights in the group (not particularly useful by itself since we do not know whether he is going to respond truthfully or not)

Solve

Solution Stats

102 Solutions
49 Solvers

Last Solution submitted on Jul 03, 2020

Last 200 Solutions

Problem Comments

Solution Comments

Solution 187402

1 Comment

1 Comment

Alfonso Nieto-Castanon on 8 Jan 2013

+1!

Problem Recent Solvers49

Problem Tags

logic puzzles

Problem 1180. Knights and Knaves (part 2)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers49

Suggested Problems

More from this Author38

Problem Tags

Problem 1180. Knights and Knaves (part 2)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers49

Suggested Problems

More from this Author38

Problem Tags

Players