Author: Andrew Dados
Date: 11:46:24 05/01/02
Go up one level in this thread
On May 01, 2002 at 14:14:01, David Hanley wrote: >Has this been tried before? My idea is that by saving the PV, i have a line to >try instead of a move if i reach a position again. The idea being that if i >have a 4 move PV tn the hash, and i want to search 6 play from here, i can play >out the PV, and do a 2 move search, giving me hopefully a quick cutoff, and if >not that, a really great try for a reduced alpha/beta window. > >I know it sounds expensive, but because of the way the rest of my program is >structured, it's essentially free--or very cheap at least. > >This also opens up the idea of expanding the definition of what the PV is, so >i'd get even more lines to stick in the hash table. > >dave Well that will not work. For most parts of the tree you won't get any PV - just 'best move'. If white fails high and you get best move, then one ply deeper all black moves failed low anyway. if you start your search by following last found PV - that variant of alpha-beta is called 'PVS'. -Andrew-
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.