Author: Tom Kerrigan
Date: 14:58:23 09/21/98
Go up one level in this thread
Iterative deepening might be a wash at 4 ply, but I would not like to start a 10 ply search with an empty PV array/hash table/history array. -Tom On September 21, 1998 at 07:10:13, Pat King wrote: > >On September 20, 1998 at 19:31:36, John Coffey wrote: > >>We all know that searching 1 ply, 2ply, 3ply, 4ply etc produces faster >>results than just searching 4 ply by itself because the move odering >>improves the efficiency of the alpha-beta pruning. > >Do we? I know improved move ordering helps speed up subsequent searches, >but enough to be faster than one 4 ply search? I thought the primary benefit of >iterative deepening was always having a move on hand in case time constraints >prevent you from doing the full search. > >Pat
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.