Author: Steve Maughan
Date: 12:39:16 01/17/05
I've just had a look through Fruit's excellent source code. I notice that Fruit is now using a slightly unorthodox transposition algorithms. Fruit is storing a minimum and maximum depth, as well as a minimum and maximum score. Has this approach being documented? I think I've heard of it in a MTD(f) architecture but not with a PV approach. I would have thought that with a PVS search the vast majority of positions encountered in a search would either always fail high or always fail low (unlike MTD) - therefore negating the value of storing two bounds. What am I missing? Does anyone have any insights? Has anyone experimented? Steve
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.