Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Searching PV first

Author: Tony Werten

Date: 23:07:04 07/19/04

Go up one level in this thread


On July 19, 2004 at 18:07:53, Stuart Cracraft wrote:

>So I recently added some code to search the PV first
>but with an add-on whose effect may be a curveball
>in the longrun but appears okay at first.
>
>PV is searched first but with the add-on that any other
>position that is searched (but not on the PV) there is a check
>made for whether a PV-move at the same depth is available
>in this position and if so it is searched first.
>
>Anyway, after doing the above my test results made another (small)
>jump over just using the first move only of the prior iteration's
>principal variation.

It shouldn't hurt. I read in another post you don't use killers. When you start
to do, you'll see that the added value of this "pv killer" goes to 0.

OTOH when it is possible to transpose into the pv, you'll probably have a very
high chance to cutoff (exact entries), even when it's not the "best" move.
(Haven't tested it in a long time.)

Tony

>
>Version 2.01
>     ~Time  Solved Solved Time    Nodes     other information
>    per move  %   / Total  Tot     Tot      other information
>//   5 sec - 75% 227/300 1620.68 281651520 938838/5/173787 0/0/18410820/0/0/0
>//   1 sec - 66% 199/300 323.91   53624628 178749/1/165555 0/0/3556160/0/0/0
>
>Version 2.00
>//   5 sec - 73% 218/296 1687.07 301382976 1004610/6/178643 0 0/19507018/0/0/0
>//   1 sec - 62% 187/300 313.89 52147824 173826/1/166134 0/0/3460861/0/0
>
>Stuart



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.