XKCD - Labyrinth puzzle

Question

There is a modified labyrinth puzzle on xkcd: http://xkcd.com/246/

After reading it we asked on an interview, "how many questions required to survive and solve this puzzle?"

Our best solution requires 5 questions, 1-1-1 question to everyone, and 2 to a chosen one based on the first 3.

Can anybody construct a better, or different logic?

Answer 1

Better logic would be to not ask any questions at the risk of being stabbed. The doors don't actually lead to out. (See hover text.)

BTW: This isn't programming related.

Answer 2

I would argue that, by definition any attempt to find the correct path via asking a set of questions would invoke the "stabbing" rule. But maybe I'm just using a too-strict sense of the term "tricky".

Answer 3

3 Questions. Get two people out.