Computer Chess Club Archives


Search

Terms

Messages

Subject: What about effeciency?

Author: John Coffey

Date: 13:11:54 09/24/98

Go up one level in this thread


It seems to me that there would come a point where attempts to order
the moves at every branch of the tree would slow down the tree search.
I could see doing this in the lower levels of the tree, but wouldn't
there be a point of diminished returns?   I.e. if you were searching
N ply deep, maybe you would want to stop ordering at maybe N-3?

This brings up another issue:  Crafty (and for all I know, other programs)
will generate the entire move list at each branch before searching deeper.
It might do some ordering too.  But it might not be necessary to look at
all these moves, so the time spent generating some of the moves could be wasted.

My plan, right or wrong, for my Mars engine was to have different search
strategies at different levels of the tree.  Probably most programs do this
already.

John



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.