Author: Robert Hyatt
Date: 19:45:44 06/04/01
Go up one level in this thread
On June 04, 2001 at 18:25:31, Vincent Diepeveen wrote: >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. Try it before saying that. It is so close to perfectly ordered that it can be called "perfectly ordered" with no danger of being wrong enough that it can be measured. He said he had move ordering operational. Which means good captures first. That is enough for a material-only search. Throw in killers and hashing and it is so close to perfect it counts...
This page took 0.01 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.