Author: Vincent Diepeveen
Date: 17:45:43 09/10/02
Go up one level in this thread
On September 10, 2002 at 18:06:01, Gian-Carlo Pascutto wrote: >On September 10, 2002 at 17:51:11, Vincent Diepeveen wrote: > >>On September 10, 2002 at 17:43:15, martin fierz wrote: >> >>>On September 10, 2002 at 17:18:24, Vincent Diepeveen wrote: >>> >>>>On September 10, 2002 at 17:10:38, martin fierz wrote: >>>> >>>>>On September 10, 2002 at 09:26:14, Eli Liang wrote: >>>>> >>>>>>(3) Reading Aske Plaat's search & re-search paper, it really seems like mtd(f) >>>>>>is something of a magic bullet. But I note it seems that more programs don't >>>>>>use it than do (for example Crafty). What is wrong with mtd(f) which Plaat >>>>>>doesn't say? >>>> >>>>losing 1 bit is a problem for you? >>> >>>nope. losing 2 bytes is more like it... >> >>who stores a bound in 2 bytes? >> >>Why not in 1 bit? > >You want to store two actual values, not flags that indicate what >kind of bound it is. did i implement it smarter then or what? i used 2 bits in total. 'upperbound, lowerbound, truebound'. the search result is based upon a single bound. So it IS the same, it IS higher or it IS lower. What am i missing here? >-- >GCP
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.