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

Home > Logic > Liars and Knights
Only One Question (Posted on 2005-02-16) Difficulty: 3 of 5
The following two facts are known about Adam, Bert, and Carl:

1) Of Adam, Bert, and Carl, there is one knight, one knave, and one liar.
2) Adam said once, "Bert said that Carl isn't a knight."

Can you ask one yes/no question to one person and figure out who is who? If not, how many questions must you ask?

See The Solution Submitted by Dustin    
Rating: 4.0000 (8 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
SolAndre2010-06-01 18:31:57
AnswerK Sengupta2008-11-15 06:49:22
re(3): Two Questionslance2006-03-23 08:02:09
0 questions (but you wont know for sure)Sage2006-02-02 18:33:52
Yep, it's wrongAmber2005-05-20 03:11:58
SolutionTwo Questions! Must be wrong somewhere.Amber2005-05-19 06:13:28
A Knavish definitionPenny2005-02-27 09:05:19
(-) * (+) = -turki2005-02-26 18:49:05
probly not rightangrypie1112005-02-23 00:19:17
SolutionSolutionPenny2005-02-18 22:43:42
re: it can be done in one question.Penny2005-02-18 20:45:52
other waysjoshua imperato2005-02-18 19:03:01
it can be done in one question.joshua imperato2005-02-18 18:49:49
re(4): Two QuestionsLiam2005-02-18 16:29:52
re(3): Two QuestionsBen Gornall2005-02-18 09:08:07
re(2): Two QuestionsLiam2005-02-17 13:54:45
I'm feeling lazy, butBen Gornall2005-02-17 05:29:19
QuestionThree possibilitiesLeming2005-02-17 02:00:18
Solution2 question solutionRobert Woods2005-02-17 00:37:57
re: Two QuestionsJohn2005-02-17 00:03:28
Two QuestionsLiam2005-02-16 20:52:02
Solutionre: part oneCharlie2005-02-16 20:20:46
Hints/Tipspart oneCharlie2005-02-16 19:27:11
Please log in:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information