I hope this question falls into the correct category. I'm sure the 2 paths , 1 liar and 1 truthful is common, however, is there a general strategy given:
- There are N-number of doors/paths/or destinations (you get the point). For simplicity sake, let's assume that N is an even integer greater than 2.
- There are N/2 'guards' who lie, and N/2 'guards' who tell the truth.
- There are N/2 'good destinations' and N/2 'bad destinations'.
- You can ask K-number of 'guards', only once. With K<=N
The objective is still the same: The player wants to be in the 'good destination'.
Is there a generalized strategy for this? Is there a way to minimize k while still achieving the objective?