Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10 5/3/83; site hp-pcd.UUCP
Path: utzoo!linus!philabs!cmcl2!floyd!harpo!seismo!hao!hplabs!hp-pcd!ching
From: ching@hp-pcd.UUCP (Chao Liu)
Newsgroups: net.rec.bridge
Subject: Re: Problems-Problems2 - (nf)
Message-ID: <1700@hp-pcd.UUCP>
Date: Thu, 1-Sep-83 03:31:04 EDT
Article-I.D.: hp-pcd.1700
Posted: Thu Sep  1 03:31:04 1983
Date-Received: Sat, 3-Sep-83 13:07:35 EDT
Sender: netnews@hp-pcd.UUCP
Organization: Hewlett-Packard, Corvallis OR
Lines: 20

#R:vax2:-67700:hp-pcd:30500017:000:698
hp-pcd!ching    Aug 31 12:30:00 1983

/***** hp-pcd:net.rec.bridge.ctl / houxz!halle1 /  2:05 pm  Aug 29, 1983*/
After much thought and trial, I suddenly realized that I had seen this before.
It is a very famous problem, the winner of a competition decades ago.
I don't have access to my reference book, so I can't give any more details.
Since I recall the solution, I will not post it, so as to give others
a chance, but I will add a hint:  there are three distinct ways the play
can go, depending on the defenders' early play.
It is indeed a very difficult one.
/* ---------- */

Since I already posted an answer, could you tell us more about this famous
problem?

--Ching-Chao Liu
  HP Portable Computer Division
  Corvallis, Oregon