Author: Aivaras Juzvikas
Date: 06:12:41 07/22/04
Go up one level in this thread
On July 22, 2004 at 09:01:09, Gopikrishna wrote: >Whats the reason its taking so much time to search moves beyond 9 plies in >depth.Like after 13 plies its taking some hours for a single ply of search for a >given middle game position.I know its because of enormous growth in tree size >but some engines like Diep searched 18 plies of depth in some minutes! > I am using iterative deepening also with aspiration windows but actually no pv >search.So what could be done to make it search much more plies deeper in less >time? Thanks for any advice. improve your move ordering, implement hash tables, killer moves, see.
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.