Author: Martin Giepmans
Date: 09:10:32 01/11/02
Go up one level in this thread
On January 11, 2002 at 11:44:39, David Rasmussen wrote: >[D]2Q2n2/2R4p/1p1qpp1k/8/3P3P/3B2P1/5PK1/r7 w - - 0 1 > >In the above position, my search tree explodes because of extensions. It takes > >3 minutes and 42 million nodes to finish an 8 ply search. How does your program >do? > >Any good ideas on how to limit extensions in such a position. > >P.S. Solving the position is no problem. It is a simple mate in 5 plies, and is >found very early on at depth 1 or 2 or so. Still, there must be something >unsound about my extensions, or at least room for improvement, when this >position makes the tree explode. > >/David I don't know if I understand your question. How can you reach depth 8 when a mate is found at depth 1 or 2? Doesn't your engine stop in such a case? Even if you want to look for a shorter mate, searching *deeper* is of course useless ... Anyway, if the search explodes after a mate is found, I guess there must also be something wrong with the hashtable. Martin
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.