# Talk:246: Labyrinth Puzzle

I remember a book where the main character kicked one guard in the face and asked if it hurt.
Just ask which color is the sky.. -- 175.110.37.200 (talk) *(please sign your comments with ~~~~)*

- Oh, although the strip doesn't explicitly say so; in those riddles you can normally only ask one question. --St.nerol (talk) 23:00, 27 January 2013 (UTC)
- There's another (more traditional) three-guard variation where one guard always tells the truth, one guard always tells a lie and the third alternates between pure truth and pure lie (and you don't know which flip they're currently flopped upon). But you
*still*only get to ask one question of one guard. Have fun with that one. My personal solution certainly has a degree of convolution, but I've heard other workable answers. 178.98.31.27 02:24, 21 June 2013 (UTC)- @175.110.37.200, you would know which one lies but you would not know which door leads out. Tharkon (talk) 23:13, 10 October 2013 (UTC)
- Eh, well, even if you had a perfect question to ask in this case, a lot of good would that do you: it'd only reveal the truth behind the setup, that
*none*of the doors lead out. :p -- 173.245.51.210 08:20, 8 November 2013 (UTC)- Well yes it says that in the title-text. But good pick-up. 108.162.219.58 02:31, 6 February 2014 (UTC)

- Eh, well, even if you had a perfect question to ask in this case, a lot of good would that do you: it'd only reveal the truth behind the setup, that

- @175.110.37.200, you would know which one lies but you would not know which door leads out. Tharkon (talk) 23:13, 10 October 2013 (UTC)

- There's another (more traditional) three-guard variation where one guard always tells the truth, one guard always tells a lie and the third alternates between pure truth and pure lie (and you don't know which flip they're currently flopped upon). But you

One question, of one guard. I really like the original form of this riddle. It's a bit of a trick, though. It is crucial that the guards "know" each other's rules, but this is not even implied. And if it was stated in the question, that would probably be a good enough clue to get you to the answer. Of course, once you know the answer it seems trivial, but I wonder what percentage of people actually worked it out for themselves? Another good one is Monty Hall, even though that is pure, straightforward probability. 108.162.219.223 18:11, 17 January 2014 (UTC)

- I think somebody needs a hug! 108.162.219.223 18:11, 17 January 2014 (UTC)

The whole problem with this entire riddle is that if they are both liars you are screwed! Nothing in the riddle establishes a fact that they aren't liars. Now if there was a known truth teller in the riddle that explains the nature of the guards or the narrator does it, then the above solution works. 108.162.216.28 (talk) *(please sign your comments with ~~~~)*

As you aren't given a limit to the number of questions, you can just ask each guard if they're the stabby guard. If two say yes, the third one is the truthful guard and you can ask him which way the exit is. If two say no, the third one is the lying guard and you can ask him where the exit isn't. No tricky questions so the stabby guard shouldn't stab you.162.158.255.195 18:14, 14 August 2015 (UTC)

I have a solution, but you need to ask multiple questions:

*If the Stab Guard tells the truth:*

Ask each guard, firstly, "Are you the Stab Guard?"

Truth Guard will answer "No."

Stab Guard will answer "Yes."

Liar Guard knows the answer is no, but, because he lies, will answer "Yes."

The one who said no is the Truth Guard, so you can ask him which door leads to freedom.

*If the Stab Guard lies:*

Point to the guard on the left, and ask each guard, "Does that guard lie?"

If that guard is Truth Guard, then Truth Guard will answer "No," while Stab Guard and Liar Guard answer "Yes."

If that guard is a liar, then Truth Guard will answer "Yes," while Stab Guard and Liar Guard answer "No."

Whichever guard gives a unique answer is Truth Guard, so you can ask him which door leads to freedom. NickOfFørvania (talk) 23:37, 3 November 2015 (UTC)