Author: Dave Gomboc
Date: 03:12:30 12/29/02
Go up one level in this thread
On December 29, 2002 at 04:15:41, Alessandro Damiani wrote: >On December 29, 2002 at 01:17:14, Dave Gomboc wrote: > >>On December 28, 2002 at 12:31:01, Alessandro Damiani wrote: >> >>>My new variant of ABC uses depth reductions instead of extensions. So I am >>>looking at the difference between Ed's reductions and mine. I don't use >>>conventional null-move yet. >>> >>>There is a doctoral thesis by Thomas Barth which describes how depth reductions >>>work fine with a hashtable. His work is from 1988. >>> >>>Alessandro >> >>Could you please post a URL to the location of the thesis? >> >>Dave > >I guess you have to go to your university library because I have got a paper >copy from the library here in Zurich. If you can't find it in your local library >you may ask there for a distance rent from another library. I don't know if >there is a digital copy of this thesis. > >Here are the details: >Thomas Barth, Dissertation, Neue Varianten von Suchverfahren und >Stellungsbewertungen im Computerschach, Technische Universität Wien, 1988 > >The thesis is written in German. > >Alessandro German, huh? Darn. ;-) Dave
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.