Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: The Scalable Search Test

Author: Gian-Carlo Pascutto

Date: 12:37:49 06/18/00

Go up one level in this thread


On June 18, 2000 at 14:45:52, Andrew Williams wrote:

>I think this may be another example of a position where extensions go mad:
>
>[D] r1b2rk1/pp1n1p1p/2n1p1p1/3pPP2/3P2N1/q1PB4/3Q3R/5RK1 b - - 0 23
>
>My program reached this position (as black) against a very skilled anti->computer player. It's probably lost anyway, but playing exf5?? doesn't help >much. My program gets badly bogged-down with extensions here. I've not had >much time to investigate it, because I've been busy. Here's the game (not one >I'm very proud of, but whizpopper is *very* tricky):

Mine would play exf5 too. It spots rather quickly after playing it that
it'll get mated, but the exf5 move itself takes more than 3 minutes to
fail low. Then it wants to play Re8, which loses to fxg6.

BTW. Even Crafty would play exf5 here. At ply 8 it fails low with a mate
score and starts liking h5, but I'm pretty sure Rxh5 simply wins too.

There may be no reasonable defense.

>Hope some of this is interesting/helpful

It sure was. Thanks a lot!

--
GCP



This page took 0.01 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.