Author: Robert Hyatt
Date: 21:08:17 08/24/02
Go up one level in this thread
On August 24, 2002 at 23:24:44, Brian Richardson wrote: >On August 24, 2002 at 17:59:37, Uri Blass wrote: > >>On August 24, 2002 at 17:46:18, Robert Hyatt wrote: >> >>>On August 23, 2002 at 14:48:19, Brian Richardson wrote: >>> >>>>On August 23, 2002 at 14:41:11, Dann Corbit wrote: >>>> >>>>>http://www.talkchess.com/forums/2/message.html?41900 >>>> >>>>This looks like an interesting variation on internal iterative deepening IID, >>>>but with generally deeper sub-searching. >>> >>> >>>Don't yo umean _shallower_??? >>> >>>IE IID does a depth-2 (recursive) search, while Ed proposed depth/2, which >>>is significantly less... > >No and Yes. Tinker just uses depth == 2 for the IID search, while Crafty uses >depth - 2. That is some variant on IID. The idea for IID is to recursively do depth-2 searches which is very similar to normal iterative deepening, except going by twosies rather than onesies... Sounds like you just do a depth=2 search to get a best move and go with that. At ply=3 in a 12 ply search I do a 2, 4, 5, 8 depth search to get a best move. >> >>It is dependent on the qusetion if depth<4 or depth>4. >>If depth=4 both searches are the same. >> >>Uri
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.