Author: Ricardo Gibert
Date: 22:48:02 10/27/02
Go up one level in this thread
On October 28, 2002 at 01:17:41, Nagendra Singh Tomar wrote: >What all reasons can you think of for a ply 'n+1' searching lesser nodes than >ply 'n' search. > >regds >tomar The most obvious is a ply n search had really bad move ordering that gets much improved for ply n+1 thanks to the hash moves saved in the hash table.
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.