Author: Tord Romstad
Date: 13:29:42 04/14/04
Go up one level in this thread
On April 14, 2004 at 14:00:47, Dann Corbit wrote: >Are there any PVS style programs that store both an upper and lower bounds (and >I imagine they will also need two depths as well.)? > >I am curious to find out if there is value so that I can write a very general >program where I can switch algorithms at will. Hi Dann, If you have ambitions to create anything more than a very simple engine, I think this is a very ambitious idea. You will find that an efficient MTD search is very different from an efficient PVS search. You cannot expect to be able to switch algorithms with only a few different lines in your search() function, it is more like writing two quite different programs. My engine started out as a traditional aspiration alpha beta engine (I never used PVS). When I implemented MTD last autumn, I tried for some time to support both algorithms at once (the search algorithm could be chosen from the init file or through the UCI interface). I gave up very quickly, because maintaining both algorithms at once was extremely time-consuming. Tord
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.