Computer Chess Club Archives




Subject: Re: A move to search 2nd... Keep in the trans table?

Author: Dann Corbit

Date: 14:04:13 07/21/04

Go up one level in this thread

On July 21, 2004 at 16:55:07, Eric Oldre wrote:

>lets say you are searching a position with iterative deepening.
>at depths 3,4,5 it finds a best move of Qd3. then at depth 6
>the best move changes to c4.
>When you start searching to depth 7, you clearly would want the
>first move you search to be c4, and this shouldn't be a problem
>if your transposition tables are working right. Since the best
>move should be stored in it.
>however, a good move to try 2nd would be Qd3, but your transposition
>tables aren't going to let you know that, at least not in the implementations
>that I have normally heard about.
>I was thinking that one way to overcome this would be to keep 2 "best" moves
>in the trans table. one to try first, and one that was a best move, before
>being replaced by a deeper search.
>Are other people doing this? or have you discovered that the cost is greater
>than the benefit?

Probably, most people rely on killer moves for that.  I never saw any code that
stored more than one pv node for a chess program at a given board position.

This page took 0.11 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

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