Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss

a fun chess problem

2 views
Skip to first unread message

Paul M. Nauman

unread,
Aug 26, 1985, 2:13:14 PM8/26/85
to
I came across this the other day and thought it was kind of cute:

White to play and win.

BLACK (lower case)
+---+---+---+---+---+---+---+---+
| | | | | | | | |
+---+---+---+---+---+---+---+---+
| | | | | | | R | |
+---+---+---+---+---+---+---+---+
| | | b | | | R | | p |
+---+---+---+---+---+---+---+---+
| | | | | | | p | |
+---+---+---+---+---+---+---+---+
| | | | | | | k | |
+---+---+---+---+---+---+---+---+
| | | r | | | | P | N |
+---+---+---+---+---+---+---+---+
| | | | | | | | K |
+---+---+---+---+---+---+---+---+
| | | | | | | | |
+---+---+---+---+---+---+---+---+
WHITE (upper case)

Enjoy.

Paul Nauman magic!pmn
Bell Communications Research
Morristown, NJ

Bill Vaughn

unread,
Aug 30, 1985, 1:33:16 PM8/30/85
to

Yes, it is kind'a cute.


1. Es4+ Xu5 2. Eu4+ tu 3. As4 zngr

Bill Vaughn
Center for Visual Science
Univ. of Rochester
{allegra,seismo,decvax}!rochester!ur-cvsvax!bill

l...@lanl.arpa

unread,
Aug 31, 1985, 10:18:39 PM8/31/85
to
> >
> > BLACK (lower case)
> > +---+---+---+---+---+---+---+---+
> > | | | | | | | | |
> > +---+---+---+---+---+---+---+---+
> > | | | | | | | R | |
> > +---+---+---+---+---+---+---+---+
> > | | | b | | | R | | p |
> > +---+---+---+---+---+---+---+---+
> > | | | | | | | p | |
> > +---+---+---+---+---+---+---+---+
> > | | | | | | | k | |
> > +---+---+---+---+---+---+---+---+
> > | | | r | | | | P | N |
> > +---+---+---+---+---+---+---+---+
> > | | | | | | | | K |
> > +---+---+---+---+---+---+---+---+
> > | | | | | | | | |
> > +---+---+---+---+---+---+---+---+
> > WHITE (upper case)
> >
> 1. Es4+ Xu5 2. Eu4+ tu 3. As4 zngr
>
*** TODAY'S SPECIAL ... SERIAL LINE --- $4.50, INCLUDING GRATUITY ***

The following ingenuous answer has the same result

Nf2ch forces kh5
Pg4ch forces kh4
Rh6(xp) mate

Paul M. Nauman

unread,
Sep 3, 1985, 12:28:28 PM9/3/85
to
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.

0 new messages