HDTenEightyP/NetNews huggingface dataset:
From: clong@remus.rutgers.edu (Chris Long)
Newsgroups: rec.puzzles
Subject: Re: Puzzle 2 (SPOILER)
Date: 15 Sep 92 03:28:05 GMT
Organization: Rutgers Univ., New Brunswick, N.J.

The probability is zero, since given any point there are only finitely
many lines which could be drawn that would pass through another
point in your set.  However, there are infinitely many lines which
could be drawn.
-- 
Chris Long, 265 Old York Rd., Bridgewater, NJ  08807-2618
Newsgroups: rec.puzzles
From: cab@col.hp.com (Chris Best)
Subject: Re: Portmanteau words
Date: Mon, 14 Sep 1992 17:04:20 GMT
Organization: your service

FOGGLES.
Newsgroups: rec.puzzles
From: singley@helix.nih.gov (Erick Singley)
Subject: Re: redundancy
Organization: (National Institutes of Health, Bethesda, MD)
Date: Tue, 8 Sep 1992 18:31:55 GMT

Eating at TGIF Friday's (resturant)
From: nyh@gauss.technion.ac.il (Nadav Har'El)
Newsgroups: rec.puzzles
Subject: Re: redundancy
Date: 15 Sep 92 14:58:08 GMT
Organization: Technion, Israel Institute of Technology

In article <1992Sep7.233234.12744@cco.caltech.edu>, keith@cco.caltech.edu (Keith Allan Schneider) writes:
> epp4010@ultb.isc.rit.edu (E.P. Pylko) writes:
> 
> >In article <laftbjINNau3@aludra.usc.edu> rmurphy@usc.edu (Bob Murphy) writes:
> >>One can sometimes overhear people use the following phrases:
> >>
> >>    ATM machine, HIV virus, PIN number, and LCD display.
> >>
> >>These are all redundant.  For example, ATM stands for Automatic
> >>Teller Machine so why say the word "machine" after ATM?  The others
> >>are similar.  Can anyone think of other examples of this type of
> >>redundancy?
> >>
> 
> >Well, another one around the country is "TCBY" Yogurt.  For people not
> >around here, TCBY stands for "The Country's Best Yogurt".
> 
> or the SAT test, or ACT test...
> 
> keith
> 

what about LASER radiation (LASER=light amplification by stimulated emision
                                   of radiation)
or ROM/RAM memory or IBM machine?

-- 
Nadav Har'El                         | ######  ########     # | <-- Sorry if
Email: nyh@gauss.technion.ac.il      |      #       #       # |    you can't
Department of Mathematics, Technion  |      #       #       # |    read Hebrew.
Israel Institute of Technology       | ########     #  ###### |    Nadav. ;)
Newsgroups: rec.puzzles
From: haha@vipunen.hut.fi (Harri Haanp{{)
Subject: Re: 20 question stories
Keywords: bears
Organization: Helsinki University of Technology, Finland
Date: 13 Sep 92 06:29:09 GMT

In <12SEP199217590422@wccf.mit.edu> huh@wccf.mit.edu (GENE SIMON HUH) writes:

>Bud Bergen) writes:
>> Or, a person goes ten miles south, ten miles east and ten miles north to
>> end up where he started.  What color were the bears?
>> 

>Spoiler follows:
>I thought there were no bears there.  Just Santa Claus.

Bzzt! Wrong!

As everybody should know, Santa Claus lives in Finland, in Korvatunturi.

There's another solution: the 'person' (PCness is a disease) might have
been about 11.6 miles north of the South Pole. Though I guess the color
of the bears would be the same.. are there polar bears at both poles?

Harri H.
From: moon@haydn.llnl.gov (Steven Moon)
Newsgroups: rec.puzzles
Subject: Re: Puzzle 1
Date: 15 Sep 92 17:58:45 GMT
Organization: Lawrence Livermore National Laboratory

In article <10291@uqcspe.cs.uq.oz.au>, grue@cs.uq.oz.au (Pauli Dale) writes:
|> cliff@watson.ibm.com (cliff) writes:
|> 
|> >2. A more advanced an interesting problem is to continue to
|> >generate a sequence in a recursive fashion such that each row becomes
|> >the sequence for the previous.  For example, start with the usual
|> >0 through 9 digits in row 1:
|> 
|> My program produces the following output:
|> 	0123456789
|> 	6210001000
|> 	no solutions found
|> 
	I found the solution for the third row

	2061116111

	with no solution in the fourth row.

	I do not think that the solution given by  Xavier Nicollin is a proper
	solution.  He gives the third row as 0004440444.  In the previous row
	we did not specify six-fours. 
Newsgroups: rec.puzzles
From: seth@miro.Berkeley.EDU (Seth Teller)
Subject: Virtual reality puzzle
Reply-To: seth@miro.Berkeley.EDU (Seth Teller)
Organization: University of California at Berkeley
Date: Sun, 6 Sep 1992 05:43:16 GMT

>> From: tolman%asylum.cs.utah.edu@cs.utah.edu (Kenneth Tolman)
>> ....
>> you realize that you MIGHT STILL BE IN THE VIRTUAL SIMULATION....
>> Even when you "unplugged" it merely simulated that....
>> What is a sure way to know if you are in the real world or the virtual
>> one?  That is the puzzle.

this is easy.  just do a physics experiment (whose outcome you know) with 
a highly accurate clock.  the simulation has to report accurate time 
intervals to you; if it doesn't, the discrepancies will add up and start 
to conflict with the real-time data pouring in from the rest of the 
universe.  with no discrepancies, you'll be able to detect the processing 
latency (it can't ever be zero) for the VR simulator to compute the 
experimental results and channel them to your sensory system.

two flaws in your ''paradox'':

	the simulation does not encompass your thought processes, so 
	you can always detect it by a sufficiently complex thought
	experiment (i.e., some computation in your head).
	
	second (perhaps a consequence of the first): the notion of
	a ``perfect'' VR simulation seems ill-defined; for one,
	it can't possibly simulate all instanteously occurring
	thought (yours and/or others), since it won't have the
	programming.  it also seems like you'll run into Godel-like
	difficulties if you postulate one.

seth



Newsgroups: rec.puzzles
From: karr@cs.cornell.edu (David Karr)
Subject: Re: 4 color atlas
Organization: Cornell Univ. CS Dept, Ithaca NY 14853
Date: Fri, 11 Sep 1992 13:38:49 GMT

In article <CHALCRAFT.92Sep11091714@laurel.uk.tele.nokia.fi> chalcraft@uk.tele.nokia.fi (Adam Chalcraft) writes:
>Okay, for the last time.

You're an optomist!

>[...] It was a simplifying step
>which missed a case, not the computer.

Computers never make mistakes, we just program them to do the wrong things.

I gather from what you wrote that the error was essentially in the 
specification of the program, which included these simplifying cases
(which of course were developed by hand).

In this case it seems plausible that the error was discovered by
someone looking at the non-computer part of the proof, without
reference at all to the 460 pages on microfiche.  If this part has
been thoroughly picked over, and similarly people have determined that
the program correctly implements the scheme of simplifications, then
we ought to accept the proof.  I assumed that something like this
would have happened eventually, I just wondered about some of the
details of what and when.

Of course there could still be an error, but the same is true (to
about the same degree of probability) in ANY proof where the human
effort was of comparable magnitude.  Actually, I wouldn't be surprised
if human proofs that had no computer run to provide a "sanity check"
at the end weren't more susceptible to errors.  Anyway, this idea has
been argued as a reason why we should accept computer proofs, given
that we accept "traditional" proofs, and that we should not snub
"probabilistic" proofs either.  (The argument goes that a simple proof
that assigns an extremely high probability to some proposition is
better than a long, complicated proof--by a human hand--that purports
to show the same result with certainty, because the latter actually
has a higher likelihood of being wrong.)

-- David Karr (karr@cs.cornell.edu)
From: weemba@sagi.wistar.upenn.edu (Matthew P Wiener)
Newsgroups: rec.puzzles
Subject: Re: Situation puzzles
Date: 15 Sep 92 17:16:55 GMT
Reply-To: weemba@sagi.wistar.upenn.edu (Matthew P Wiener)
Organization: The Wistar Institute of Anatomy and Biology
In-reply-to: sflinter@cs.tcd.ie (Stephen Flinter)

In article <1992Sep10.104932.22790@cs.tcd.ie>, sflinter@cs (Stephen Flinter) writes:
>1.30.  Tim and Greg were talking.  Tim said "The terror of flight."  Greg
>said "The gloom of the grave."  Greg was arrested.  (KH, from "No Refuge
>Could Save," by Isaac Asimov)

This attribution is wrong.  It's Asimov's story, and I turned it into a
situation puzzle about 10 years ago, and posted it as such about 6 years
ago to the old net.puzzles--the first, and hopefully last, attempt to run
a situation puzzle over USENET.
-- 
-Matthew P Wiener (weemba@sagi.wistar.upenn.edu)
From: karr@cs.cornell.edu (David Karr)
Newsgroups: rec.puzzles
Subject: Re: 4 color atlas
Date: 11 Sep 92 04:25:21 GMT
Organization: Cornell Univ. CS Dept, Ithaca NY 14853

In article <4efukvG00VpNJ4DY1L@andrew.cmu.edu> "Jonathan R. Ferro" <jf41+@andrew.cmu.edu> writes:
>[...]  The 1977 volume of the Illinois
>Journal of Mathematics is accompanied by 2 microfiche containing over
>460 pages of computer-generated results.  Perusal of the fiche by
>interested readers over the next year revealed only a dozen typos, which
>took only a few minutes each to fix, and one missed case, which took a
                                          ^^^^^^^^^^^^^^^
>solid afternoon's work and one more computer run to cover.

The missing case would really bother me if it were my program.  I 
wonder why it was missing, and what makes them so sure now that
there aren't yet OTHER missing cases that human readers could not
pick out from the 460 pages of results?

As weused to say at work, "I've fixed the last bug" is never a true
statement when talking about any substantial program.

(Yes, there are methods of reasoning about whether programs match
specifications, and one might be able to check the spefication by hand
to verify that it really was the 4-color problem, but were these
techniques known in 1977?  I'm curious.)

-- David Karr (karr@cs.cornell.edu)
From: rt@ukc.ac.uk (R.W.Thearle)
Newsgroups: rec.puzzles
Subject: Re: The ULTIMATE problem!!! (spoiler?)
Date: 14 Sep 92 20:07:41 GMT
Reply-To: rt@ukc.ac.uk (R.W.Thearle)
Organization: Computing Lab, University of Kent at Canterbury, UK.

In article <1992Sep14.145505.3801@hsr.no> onar@hsr.no (Onar Aam) writes:
>I challenge you lot out there to solve this problem. If you crack this nut, you
>qualify for Mensa-membership. I posted this problem to rec.org.mensa as well, and
>no-one dared to answer it. Do YOU dare????

SPOILER:


[paraphrased]:

3 people have a total age of twice the verger's age;
the product of their ages is "Fifty and Ten Dozens Twenty";
(verger cannot work out ages);
the priest is older than all the strangers;
(verger can work out ages);
find the age of the priest.

Solution:
    put X, Y, Z as the strangers' ages;
    put P as the priest's age;
    put V as the verger's age.

    Then
	X+Y+Z = 2*V
	X*Y*Z = "Fifty and Ten Dozens Twenty"
	X < P; Y < P; Z < P.

    Now, what is "Fifty and Ten Dozens Twenty"?
    It could be either
	Fifty + (Ten Dozens) + Twenty =  190 = 2*5*19
	(Fifty + Ten) Dozens + Twenty =  740 = 2*2*5*37
	Fifty + (Ten Dozens) * Twenty = 2450 = 2*5*5*7*7
	(Fifty + Ten) Dozens * Twenty = 3400 = 2*2*2*5*5*17

    These give the following possibilities for the strangers' ages,
    after the combinations giving an odd sum have been deleted:
	1+1+190=192	1+2+95=98*	1+5+38=44	1+10+19=30
	2+5+19=26

	1+1+740=742	1+4+185=190*	1+5+148=154	1+20+37=58
	4+5+37=46*

	1+1+2450=2452	1+2+1225=1228	1+5+490=496	1+7+350=358
	1+10+245=256	1+14+175=190*	1+25+98=124	1+35+70=106
	1+49+50=100	2+5+245=252	2+7+175=184	2+25+49=76
	2+35+35=72	5+5+98=108	5+7+70=82	5+10+49=64*
	5+14+35=54*	7+7+50=64*	7+10+35=52	7+14+25=46*

	1+1+3400=3402	1+8+425=434	1+17+200=218	1+25+136=162
	1+40+85=126	2+2+850=854	2+10+170=182	2+34+50=86
	5+5+136=146	5+8+85=98*	5+17+40=62	8+17+25=50
	10+10+34=54*
    where the asterisks mark the repeated totals.

    Now, since the verger could not work out the stranger's ages from
    the sum (half his age) and the possible products, the only possibilities
    are
		1+4+185 = 1+14+175 = 190
		5+8+85 = 1+2+95 = 98
		5+10+49 = 7+7+50 = 64
		10+10+34 = 5+14+35 = 54
		7+14+25 = 4+5+37 = 46

    Now, the priest's age must be higher than the highest age in the first
    sum and lower than the highest age in the second sum for the verger
    to be able to work out the stranger's ages. Furthermore, for the priest's
    age to be unique, the two highest numbers must be one different. Thus:

		5+10+49 = 7+7+50 = 64
    or
		10+10+34 = 5+14+35 = 54

    The only way to distinguish these is to assume that the verger knew what
    was meant by "Fifty and Ten Dozens Twenty", and note that in the first
    possible answer both sides have the  same product, but not in the second
    one.

    Thus the ages are:
	strangers: 5, 10, 49
	verger: 32
	priest: 50


				Roy
Newsgroups: rec.puzzles
From: sflinter@cs.tcd.ie (Stephen Flinter)
Subject: Re: 20 question stories
Organization: Trinity College, Dublin (Computer Science)
Date: Mon, 7 Sep 1992 13:52:35 GMT

In article <1992Sep7.053657.24367@ccu1.aukuni.ac.nz> rossw@ccu1.aukuni.ac.nz (Ross Williamson) writes:
>
>	I'm looking for a collection of logic puzzles.
>What they are is a story which you can tell people and then they ask
>you questions about the problem trying to solve the question you 
>pose them.  Similar to 20 questions but these can last for days ie.
>
[Puzzle details omitted]
>	Is there a list of these around they are alway a good laugh and
>a lot of fun to do.
>	

I enjoy doing this type of puzzle quite a lot.  The best
ones tend to be those with very short, cryptic situations, and
you have to spend a few minutes just figuring what's going on.
Here are a few of my favourites, and any new ones would be
much appreciated.  I will post solutions in a few days if
the demand is there.

1. "The music stopped, and then she died..."

2. "He pushed his car to the hotel, and knew he was bankrupt"

3. There is a small group of stones and a carrot in the
middle of an untouched wheat field.  How did they get there?

4. A man, heading towards a field, knows he will die when he
arrives.  How come?

5. A man is lying dead in the middle of a field clutching a
twig in his hand.  How come?

(Just typing these made me realise that there are a lot of
fields here!!)

6. A person goes into the desert, cuts off one arm and
buries it.

7. Two people order vennison.  One rushes outside and
commits suicide.

Steve.
-- 
//
//      Stephen Flinter                          sflinter@cs.tcd.ie
//      AI Lab, Computer Science
//      Trinity College Dublin
Newsgroups: rec.puzzles
From: goddard@NeXTwork.Rose-Hulman.Edu (Bart Goddard)
Subject: Re: oxymorons
Organization: Rose-Hulman Institute of Technology
Date: Sat, 5 Sep 1992 15:11:00 GMT

Distribution: world

In article <14859@mindlink.bc.ca> Edward_Lunny@mindlink.bc.ca (Edward  
Lunny) writes:
> I'm interested in oxymorons. ie words that seemingly contradict  
each 
>other, Jumbo shrimp, for example. If anyone has any to share i'd  
like 
>to see them.

How about "computer science"    (I _KNOW_ it's really black magic:-))
          "safe sex"            (isn't very safe)
          "defensive driving" 
          "politically correct" (nothings correct about politics)
          "President Perot"
   


-- NewsGrazer, a NeXTstep(tm) news reader, posting --
M>UQR=&8P7&%N<VE[7&9O;G1T8FQ<9C!<9FUO9&5R;B!#;W5R:65R.WT*7&UA
M<F=L,3(P"EQM87)G<C$R,`I<<&%R9%QT>#DV,%QT>#$Y,C!<='@R.#@P7'1X
M,S@T,%QT>#0X,#!<='@U-S8P7'1X-C<R,%QT>#<V.#!<='@X-C0P7'1X.38P
M,%QF,%QB,%QI,%QU;#!<9G,R."!);B!A<G1I8VQE(#PQ-#@U.4!M:6YD;&EN
M:RYB8RYC83X@161W87)D7TQU;FYY0&UI;F1L:6YK+F)C+F-A("A%9'=A<F0@
M3'5N;GDI('=R:71E<SI<"CX@22=M(&EN=&5R97-T960@:6X@;WAY;6]R;VYS
M+B!I92!W;W)D<R!T:&%T('-E96UI;F=L>2!C;VYT<F%D:6-T(&5A8V@@7`H*
M/F]T:&5R+"!*=6UB;R!S:')I;7`L(&9O<B!E>&%M<&QE+B!)9B!A;GEO;F4@
M:&%S(&%N>2!T;R!S:&%R92!I)V0@;&EK92!<"@H^=&\@<V5E('1H96TN7`I<
M"DAO=R!A8F]U="`B8V]M<'5T97(@<V-I96YC92(@("`@*$D@7TM.3U=?(&ET
M)W,@<F5A;&QY(&)L86-K(&UA9VEC.BTI*5P*("`@("`@("`@(")S869E('-E
M>"(@("`@("`@("`@("`H:7-N)W0@=F5R>2!S869E*5P*("`@("`@("`@(")D
M969E;G-I=F4@9')I=FEN9R(@7`H@("`@("`@("`@(G!O;&ET:6-A;&QY(&-O
M<G)E8W0B("AN;W1H:6YG<R!C;W)R96-T(&%B;W5T('!O;&ET:6-S*5P*("`@
B("`@("`@(")0<F5S:61E;G0@4&5R;W0B7`H@("!<"@I]"FET
`
From: warwick@cs.uq.oz.au (Warwick Allison)
Newsgroups: rec.puzzles
Subject: Re: Another words game
Date: 10 Sep 92 02:37:30 GMT
Reply-To: warwick@cs.uq.oz.au

rjh@allegra.att.com (Robert Holt) writes:
>chalcraft@uk.tele.nokia.fi (Adam Chalcraft) writes:
>>peake@vax.oxford.ac.uk writes:
>>
>>>   The LastLestListLostLust game, and the idea is to find new names for it.
>>
>>I have looked for short ones.
>>PatPetPitPotPut is the only 3-letter one I know using sensible words.
>>--
>BagBegBigBogBug

A dictionary search shows 150 solutions.  All but 63 ended in "s", "ing", "ed",
or "er".

ere they are:

bad bed bid bod bud 
bag beg big bog bug 
ball bell bill boll bull 
ban ben bin bon bun 
band bend bind bond bund 
bat bet bit bot but 
batty betty bitty botty butty 
chack check chick chock chuck 
clack cleck click clock cluck 
call cell cill coll cull 
care cere cire core cure 
cate cete cite cote cute 
dab deb dib dob dub 
dally delly dilly dolly dully 
dan den din don dun 
fan fen fin fon fun 
fand fend find fond fund 
far fer fir for fur 
gae gee gie goe gue 
gally gelly gilly golly gully 
gan gen gin gon gun 
gat get git got gut 
hack heck hick hock huck 
hallo hello hillo hollo hullo 
han hen hin hon hun 
hap hep hip hop hup 
hat het hit hot hut 
lag leg lig log lug 
lake leke like loke luke 
lang leng ling long lung 
lare lere lire lore lure 
last lest list lost lust 
ma me mi mo mu 
mall mell mill moll mull 
mam mem mim mom mum 
mare mere mire more mure 
mase mese mise mose muse 
massy messy missy mossy mussy 
mate mete mite mote mute 
nab neb nib nob nub 
nat net nit not nut 
pack peck pick pock puck 
pale pele pile pole pule 
pall pell pill poll pull 
pap pep pip pop pup 
pappy peppy pippy poppy puppy 
pat pet pit pot put 
rack reck rick rock ruck 
rad red rid rod rud 
rade rede ride rode rude 
ram rem rim rom rum 
rat ret rit rot rut 
shat shet shit shot shut 
snab sneb snib snob snub 
stare stere stire store sture 
san sen sin son sun 
track treck trick trock truck 
tag teg tig tog tug 
tale tele tile tole tule 
tan ten tin ton tun 
tane tene tine tone tune 
an en in on un 
are ere ire ore ure 



--
Warwick
--
  _-_|\      warwick@cs.uq.oz.au            /Disclaimer:
 /     * <-- Computer Science Department,  /  
 \_.-._/     University of Queensland,    /      void (if removed)
      v      Brisbane, Australia.        /
From: hamel@uakari.primate.wisc.edu (Ray Hamel)
Newsgroups: rec.puzzles
Subject: Portmanteau words
Date: 14 Sep 1992 08:55:00 -0500
Organization: UW-Madison Primate Center
NNTP-Posting-Host: uakari.primate.wisc.edu


	ISAAC ASMIOV'S SUPER QUIZ for today gives a list of
portmanteau words.  I've added a couple to the list can anyone else
come up with others?

	SMOG	SMOKE AND FOG
	SNIRT	SNOW AND DIRT
	SMASH	SMACK AND MASH
	DIPSY	DIPPY AND TIPSY
	FOZZLE	FOG AND DRIZZLE
	MOTEL	MOTOR AND HOTEL
	FLARE	FLAME AND GLARE
	GLIMMER	  GLEAM AND SHIMMER
	BRUNCH	  BREAKFAST AND BRUNCH
	FANTABULOUS	FANTASTIC AND FABULOUS

	And my own:
	GLITZ	 GLAMMER AND RITZ
	LIGER	 LION AND TIGER

Ray Hamel
University of Wisconsin
Newsgroups: rec.puzzles
From: jmantsin@sirius.UVic.CA (Johanna  Mantsinen)
Subject: Re: redundancy
Organization: University of Victoria, Victoria, BC, Canada
Date: Wed, 9 Sep 92 16:56:49 GMT

In Canada, a common term is SIN number. For those of you not in Canada, it
stands for "Social Insurance Number".

Stay cool
Johanna
  
Newsgroups: rec.puzzles
From: obrien@netcom.com (Robert O'Brien)
Subject: Re: ANYONE INTO LOGIC PROBLEMS?
Date: Tue, 08 Sep 92 02:48:03 GMT
Organization: Netcom Online Communications Services (408-241-9760 login: guest)

Peter Anderson writes:
>It depends on what kind of logic problems you're talking about. One 
>variety deals with problems such as a visit to an island populated by two 
>tribes: one always tells the truth the other always tells lies. The 
>visitor must discover which is which. The other variety deals with a list 
>of facts dealing with a group persons. The solver-usually using a 
>diagram-determines which facts refer to which person. I very much like the 
>first variety and am much less enthusiastic about the second.
>

I couldn't agree more.  I will specify, though, that in my case, 
"much less enthusiastic" means I hit "k" to kill the puzzle and 
followups.

oh, not that I don't think *others* should enjoy them, *I* just don't.
So, no flames, please, if they're YOUR favorite.  There's plenty of bandwidth.

	Bob
Newsgroups: rec.puzzles
From: tolman%asylum.cs.utah.edu@cs.utah.edu (Kenneth Tolman)
Subject: Re: oxymorons
Date: 5 Sep 92 21:27:44 MDT
Organization: University of Utah, CompSci Dept

In article <1992Sep5.151100.6020@cs.rose-hulman.edu> goddard@NeXTwork.Rose-Hulman.Edu (Bart Goddard) writes:

<interesting comments, followed by a block of obscure symbols.  I took these
symbols to be a puzzle, and extracted a message from it.  See the whole block
below to find your own message>

>M>UQR=&8P7&%N<VE[7&9O;G1T8FQ<9C!<9FUO9&5R;B!#;W5R:65R.WT*7&UA
>                       I                          '
>M S T               U                                       P
>            I                                           D
>                    D                                      0
>                                                           Y
>
>                                                         O
>
>            U
>                                                    S       E
>                                        E
>                                           !
>M<G)E8W0B("AN;W1H:6YG<R!C;W)R96-T(&%B;W5T('!O;&ET:6-S*5P*("`@
>B("`@("`@(")0<F5S:61E;G0@4&5R;W0B7`H@("!<"@I]"FET
>`

Is that the correct message?

>M>UQR=&8P7&%N<VE[7&9O;G1T8FQ<9C!<9FUO9&5R;B!#;W5R:65R.WT*7&UA
>M<F=L,3(P"EQM87)G<C$R,`I<<&%R9%QT>#DV,%QT>#$Y,C!<='@R.#@P7'1X
>M,S@T,%QT>#0X,#!<='@U-S8P7'1X-C<R,%QT>#<V.#!<='@X-C0P7'1X.38P
>M,%QF,%QB,%QI,%QU;#!<9G,R."!);B!A<G1I8VQE(#PQ-#@U.4!M:6YD;&EN
>M:RYB8RYC83X@161W87)D7TQU;FYY0&UI;F1L:6YK+F)C+F-A("A%9'=A<F0@
>M3'5N;GDI('=R:71E<SI<"CX@22=M(&EN=&5R97-T960@:6X@;WAY;6]R;VYS
>M+B!I92!W;W)D<R!T:&%T('-E96UI;F=L>2!C;VYT<F%D:6-T(&5A8V@@7`H*
>M/F]T:&5R+"!*=6UB;R!S:')I;7`L(&9O<B!E>&%M<&QE+B!)9B!A;GEO;F4@
>M:&%S(&%N>2!T;R!S:&%R92!I)V0@;&EK92!<"@H^=&\@<V5E('1H96TN7`I<
>M"DAO=R!A8F]U="`B8V]M<'5T97(@<V-I96YC92(@("`@*$D@7TM.3U=?(&ET
>M)W,@<F5A;&QY(&)L86-K(&UA9VEC.BTI*5P*("`@("`@("`@(")S869E('-E
>M>"(@("`@("`@("`@("`H:7-N)W0@=F5R>2!S869E*5P*("`@("`@("`@(")D
>M969E;G-I=F4@9')I=FEN9R(@7`H@("`@("`@("`@(G!O;&ET:6-A;&QY(&-O
>M<G)E8W0B("AN;W1H:6YG<R!C;W)R96-T(&%B;W5T('!O;&ET:6-S*5P*("`@
>B("`@("`@(")0<F5S:61E;G0@4&5R;W0B7`H@("!<"@I]"FET
>`
From: rh@smds.com (Richard Harter)
Newsgroups: rec.puzzles
Subject: Re: 20 question stories
Date: 12 Sep 92 08:02:46 GMT
Reply-To: rh@ishmael.UUCP (Richard Harter)
Organization: Software Maintenance & Development Systems, Inc.

Ted and Alice walked ten miles south to a restaurant where they met Frank.
Alice had the albatross soup and committed suicide.  Ted muttered "Gloom
of the Grave" and the FBI came in and arrested him.  Frank caught a bus
that took him ten miles east from the restaurant.  On the way they passed
a dead man wearing a backpack in the middle of 53 bicycles.  He arrived
at Monty's place.  Monty showed him three doors.  Frank picked one;
Monty opened one of the other ones and showed Frank a bear.  Frank did
the right thing and won a car.  He went ten miles north and pushed his
car up to an expensive hotel.  He promptly declared bankruptcy.

Q1:	What color was the bear?
Q2:	Who drove the bus?
Q3:	How many times are we going to recycle the
	oldies but goodies?
-- 
Richard Harter: SMDS Inc.  Net address: rh@smds.com Phone: 508-369-7398 
US Mail: SMDS Inc., PO Box 555, Concord MA 01742.    Fax: 508-369-8272
In the fields of Hell where the grass grows high
Are the graves of dreams allowed to die.