–>
You are walking on a road through an enchanted forest ruled by gnomes.You come to a fork in the road. One path leads to death, the other to certain saftey (you've read about such forks in the road). At the intersection, you encounter three gnomes. You know one cannot lie, one cannot tell the truth, and one will speak truthfully or lie as they see fit —but you do not know who is who (as these things always go).
You may ask two questions. Each question must be addressed to only one gnome, and only they will respond.
How do you determine the safe path?
Hint: This problem is pushing the limit of how much information you can get from the gnomes with only two questions. A good way to start might be to solve the same problem, except you get four questions. Then try it with three.