Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site ucla-cs.ARPA
Path: utzoo!watmath!clyde!cbosgd!ukma!psuvm.bitnet!psuvax1!burdvax!sdcrdcf!ucla-cs!das
From: das@ucla-cs.UUCP
Newsgroups: net.puzzle
Subject: Re: A logic(?) Puzzle (joke SPOILER)
Message-ID: <8228@ucla-cs.ARPA>
Date: Thu, 2-Jan-86 17:51:55 EST
Article-I.D.: ucla-cs.8228
Posted: Thu Jan  2 17:51:55 1986
Date-Received: Fri, 3-Jan-86 08:26:03 EST
References: <114@drutx.UUCP>
Reply-To: das@ucla-cs.UUCP (David Smallberg)
Organization: UCLA Computer Science Department
Lines: 16

In article <114@drutx.UUCP> msg@drutx.UUCP (GrahamM) writes:
>You're walking along a road and you come to a fork where the road splits
>into two paths, one to the right and one to the left. You don't know
>which way to go, but you must find out.
>
>You see two people nearby, and you find out that one of them always lies,
>and the other always tells the truth. They know which way to go.
>
>You can find out which way to go by asking either one of them ONE certain
>question. What is the ONE question?

Here's the classic NO-question solution:
Say:  "I'm going to X [where X is your destination].  They're serving free
      beer, all you can drink."  Then follow them both.

-- David Smallberg, das@locus.ucla.edu, {ihnp4,ucbvax}!ucla-cs!das