Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: how much time does your program need to see mate in 200?

Author: Uri Blass

Date: 03:56:05 09/23/03

Go up one level in this thread


On September 23, 2003 at 06:52:12, Uri Blass wrote:

>This problem was posted in the israeli ches forum.
>
>I have no idea what is the solution
>
>[D]6n1/p1BN3b/p1p3np/p1p3pq/6kr/K1P2r1K/2PPQ3/8 w - - 0 1
>
>The author is W.Jorgensen
>1976
>
>
>Another problem that is easier but considered as the longest study is the
>following problem
>
>[D]8/Bk3p1p/1P3p2/KP2n2p/1P1p4/1Pp2p2/B1P5/7B w - - 0 1
>
>It is by petrovicch.
>
>I believe that it was discussed here in the past and I will look for it.
>
>Uri

I found the following link but after looking at some posts I get errors that
it is not running including errors on posts that I already looked at

http://www.chess-archive.com/ccc.php?expr=Bk3p1p&subject=&author=&email=&nr=50

Uri




This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.