Author: Gian-Carlo Pascutto
Date: 11:11:24 09/03/03
Go up one level in this thread
On September 03, 2003 at 14:05:27, Robert Hyatt wrote: >>In the example above, you'd still need to get the next move or put yourself >>in the idle list, even though updating the score wouldn't be needed. > >Getting the next move doesn't count. Given there are 35 moves in a normal >position, even a 2 ply search beyond that move dwarfs the time needed to access >a non-local memory area to get the next move. I think this depends very much on how fast or slow non-local memory is. -- 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.