Author: Vincent Diepeveen
Date: 15:25:31 06/04/01
Go up one level in this thread
On June 04, 2001 at 10:59:41, Robert Hyatt wrote: >On June 04, 2001 at 06:44:26, Dan Andersson wrote: > >>Impressive branching factor. Do you use ETC to reduce the tree/graph? And do you >>try to search smaller subtrees by finding irregular branching factors? I think >>it would be interesting to see its search performance without Q-search. >> >>Regards Dan Andersson > > >MTD(f) is a killer with material-only. You don't do _any_ re-searches at >all, which means it searches a perfectly ordered tree. Noop it doesn't necessarily search a perfectly ordered tree depending upon move ordering and nullmove implementation. Material can fall of the board by stupid moves for example.
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.