Article View: net.chess
Article #872Re: a fun chess problem
From: Paul M. Nauman
Date: Tue, 03 Sep 1985 16:28
Date: Tue, 03 Sep 1985 16:28
14 lines
1226 bytes
1226 bytes
From the responses that I have received, I have discovered that there are at least 4 solutions to the problem. I will not enumerate them here in the event that someone wishes to try to find them all. The original problem had only one solution, but I thought I would alter it somewhat to make it harder. Oh well, I tried. Since there was such enthusiasm for this sort of thing, I will continue to post these problems occasionally. Please alert me to any mistakes I may make, but don't bother to respond to me unless you need the solution. Hope you enjoy them. Paul Nauman magic!pmn Bell Communications Research Morristown, NJ
Technical Details
Message-ID:
<587@magic.UUCP>Path:
arc1-ca.pugleaf.net!utzoo!watmath!clyde!burl!ulysses!gamma!epsilon!zeta!sabre!petrus!magic!pmnReferences:
<574@magic.UUCP>Show Full Headers
Complete Article Headers
Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.2 9/18/84; site magic.UUCP Path: arc1-ca.pugleaf.net!utzoo!watmath!clyde!burl!ulysses!gamma!epsilon!zeta!sabre!petrus!magic!pmn From: pmn@magic.UUCP (Paul M. Nauman) Newsgroups: net.chess,net.puzzle Subject: Re: a fun chess problem Message-ID: <587@magic.UUCP> Date: Tue, 3-Sep-85 12:28:28 EDT Article-I.D.: magic.587 Posted: Tue Sep 3 12:28:28 1985 Date-Received: Wed, 4-Sep-85 06:31:20 EDT References: <574@magic.UUCP> Distribution: net Organization: Bell Communications Research Lines: 14