Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

3
  • $\begingroup$ Thanks for the insight. I actually just posted a general formulation of the problem Q(n,s,k,x) - # of doors, # of successful doors, # of knights, and # of questions - in which I actually handled the case you described by having the knave point to all the doors with lions. (Also the 1-question solution attempt is by Ahmed, not hexomino.) $\endgroup$
    – Josh
    Commented Jun 18 at 17:00
  • $\begingroup$ "So if we ask a knight or knave what the knave would have done, he can't know for sure," - okay, but a knave could know what a knight or knave will not do (with certainty) and so can still lie with only that partial knowledge. $\endgroup$
    – hexomino
    Commented Jun 18 at 17:16
  • 1
    $\begingroup$ @hexomino The knave might lie with certainty, but what about the knight? The thing is, either they somehow have absolute knowledge, and then the knaves have two options for lying, or they do not have absolute knowledge, and the knight has no way of knowing what the knave would have said. But I think I came up with alternative phrasing that might work, I will edit my answer to include it. $\endgroup$
    – oak
    Commented Jun 18 at 17:36