Three men stand at a fork in the road. One fork leads to Someplaceorother; the other fork leads to Nowheresville. One of these people always answers the truth to any yes/no question which is asked of him. The other always lies when asked any yes/no question. The third person randomly lies and tells the truth. Each man is known to the others, but not to you. What is the least number of yes/no questions you can ask of these men and pick the road to Someplaceorother? Does the answer change if the third man randomly answers? What if you just want to identify them?

Fork Three Men Solution

lib/DbaDatabase.php:134: Warning: dba_replace() [<a href='function.dba-replace'>function.dba-replace</a>]: You cannot perform a modification to a database without proper access