Author: Peter Fendrich
Date: 14:01:12 04/06/04
Go up one level in this thread
On April 06, 2004 at 16:34:27, Bo Persson wrote: >On April 06, 2004 at 11:12:50, Peter Fendrich wrote: > >> >>Agree, but most interesting is how often. It must be much more often in MTD. >>I just have presentiment of that the increased entry size wont pay off in PVS >>with that much more cut offs. >> > >But there is an additional value, besides the potential cutoffs. In the PV >search, the bounds might also help you reduce your window by moving alpha, or >beta, or both. Even if you don't get an immediate cutoff, you might get a pruned >tree. > >I once tried this by mistake, while moving from PVS to MTD(f). I started by >implementing the two bounds in my hash table, but forgot to add the modified >root search. It still reduced the search tree significantly, maybe 20%. > > >Bo Persson Fooling around with alpha/beta values is nasty business and would require thorough testing, at least in my program! Reduced tree size mustn't necessary be a good sign here... /Peter
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.