Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10 5/3/83; site rocksvax.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!allegra!princeton!rocksvax!z
From: z@rocksvax.UUCP (Jim Ziobro)
Newsgroups: net.chess,net.math.symbolic
Subject: interesting (practical?) chess problem
Message-ID: <441@rocksvax.UUCP>
Date: Tue, 11-Sep-84 13:12:16 EDT
Article-I.D.: rocksvax.441
Posted: Tue Sep 11 13:12:16 1984
Date-Received: Wed, 12-Sep-84 01:15:56 EDT
Organization: Xerox
Lines: 32


	This came across an internal mail list:
------
Date:  5 Sep 84 15:01:17 PDT (Wednesday)
From: Don Woods <Woods.pa>
Subject: chess problem
To: Chess^, AllGames^, Puzzles^.es
Reply-To: Woods.PA@Xerox

A friend of mine is working on a program to analyse chess endgames, and
tested it out on the endgame consisting of a white King and two Bishops
versus a lone black King.  This is commonly known to be a win for White.
To his surprise, he found that this is not quite true, and he presented
me with the following interesting problem:

Modulo symmetries of the chessboard (i.e., ignoring rotations and
reflections), there are 65 positions with king and 2 bishops vs. lone
king in which the two bishops, on move, cannot force mate.

Find them.

	-- Don.

p.s.: The two bishops are, of course, traveling on different colors.
------

	Replies should go to Woods.Pa@Xerox.ARPA if you feel so inclined.

-- 
//Z\\
James M. Ziobro
Ziobro.Henr@Xerox.ARPA
{rochester,amd,sunybcs,allegra}!rocksvax!z