Author: Uri Blass
Date: 11:46:33 09/01/04
Go up one level in this thread
On September 01, 2004 at 13:42:44, Andrew Platt wrote: >On September 01, 2004 at 00:51:47, Stuart Cracraft wrote: > >>I know this is a long shot throwing this out there without much more >>info, but perhaps I'll get lucky and someone has seen this before. >>It's appeared on this bulletin board about 6 years ago. >> >>[D]4r1k1/p1qr1p2/2pb1Bp1/1p5p/3P1n1R/1B3P2/PP3PK1/2Q4R w - - bm Qxf4; id >>"WAC.141"; >> >>This position is supposed to be a good test for the implementation >>of Moreland's mate threat extension (if null move search value returns a mate, >>extend, or if it returns a mate one move away, extend (the more limited version) > >This is a hard one for my engine, Schola, too but the mate extension hurts it >significantly. I'm not sure I've got my implementation right here either! In >both cases it takes a 13 ply search to find this (11 ply if I disable null >move). Without the extension it takes 546,541,836 nodes and 16.10 minutes to >find the mate; without it it takes 812,152,834 nodes and 26.44 minutes! > >I'm going to try checks at the first level of qsearch too and see if that helps. I think that before you implement checks in the qsearch you need to find the bugs in your engine. >Last time I tried checks in qsearch it broke too many other tests though. > >Andy. It seems very strange for me that mate extension do not help to find it faster 2 questions for both of you: 1)At what depth your engine search first the line Qxf4 Bxf4 2.Rxh5? 2)At what depth it can see first that 2.Rxh5 threats mate and decide to extend it? Maybe your null move simply does not return mate after these moves. 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.