Author: Alessandro Scotti
Date: 01:44:34 09/14/04
Go up one level in this thread
On September 13, 2004 at 14:06:16, Gerd Isenberg wrote: >Believing in a rather perfectly ordered tree it might be usefull for several >reasons and heuristics. Pruning decisions and nullmove observation, extensions. >Tree-Splitting in a multi-threading environment is an issue too i guess. > >And all the nice ideas of Yngvi Björnsson, Tony Marsland and others: > >http://www.cs.ualberta.ca/~yngvi/ >http://www.cs.ualberta.ca/~yngvi/html/publications.html > >http://www.cs.ualberta.ca/~yngvi/Papers/tcs2001.pdf > >btw. while googling Yngvi, i found following german paper: > >http://www.ke.informatik.tu-darmstadt.de/lehre/ss04/se-spiele/LearningSearchControl.pdf Thanks for the info and the links... it will take quite a while to browse thru all of that! :-)
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.