Author: Vincent Diepeveen
Date: 17:27:29 07/20/99
Go up one level in this thread
On July 20, 1999 at 19:57:14, Dann Corbit wrote: >On July 20, 1999 at 19:51:57, Vincent Diepeveen wrote: >[snip] >>I nominate the nullmove, >>althoug of course alfabeta logically should qualify first, >>alfabetapruning isn't very hard to invent. Nullmove is though. >> >>First prize for that nomination would be: >> "best algorithmic improvement of the century" >> >>Nullmove has been nominated as #1 by me. >>Alfabeta as second. >>YBW as third. >What is YBW? Young Brother Wait I thought you were doing a big parallel search at ECO positions? Should know what YBW is then! the basical concepts are good explained by Rainer feldmann. basically it's first waiting for the first child to get a score back, before dividing the other moves to other processors. So initially you start with 1 processor, and some others get work when others have finished. A good article to read has been written by Bob on DTS: ICCAJ march 1997 (no 1) Page 3..19 R. Hyatt: "The Dynamic Tree-Splitting parallel search algorithm" >>endgametablebases as 4th.
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.