Author: Jeremiah Penery
Date: 10:12:47 10/11/02
Go up one level in this thread
On October 11, 2002 at 12:51:41, Vincent Diepeveen wrote: >On October 11, 2002 at 11:32:11, Jeremiah Penery wrote: > >>Why is it harder to order moves when you have a more complex evaluation? It >>would seem to depend more on the accuracy of the evaluation, rather than the >>complexity. > >With your example of a piece square table move ordering is still pretty >trivial: > > expected best move = material + SEE(position) + psq[to] - psq[from] That may be good for the current iteration, but it is more likely to result in fail high/low researches when things change significantly. A more complex, but more accurate evaluation will require less researches. >The more factors add to your evaluation function the harder it is to >predict which branch is better. The above way to order moves is very >quick. > >Of course it's possible to get a better move ordering, for example >in DIEP, by statically evaluating all moves first. > >That drastically reduces number of nodes needed to finish a ply. However >you evaluate a lot of positions there extra. It slows down my nodes a second >by more than a factor 2. If it speeds your search up, who cares about nodes/sec? I would rather get 10 ply with 100k nps than get 5 ply with 1m nps.
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.