Author: Bob Durrett
Date: 09:47:54 12/20/02
Go up one level in this thread
On December 20, 2002 at 12:13:36, Andreas Herrmann wrote: >On December 20, 2002 at 11:49:17, Jonathan Lee wrote: > >>Statistics are interesting computer chess. For example, you >>can prune the nodes differently (one for the middle game, another for the >>endgame, another for the king and pawns only, etc.) so that you could have a >>dynamic pruning system. (Does that make sense to anyone?) >> >>Or do you think efficiency has almost reached it peak in the software end of it? >>Jonathan > >i think most or all do that for excample in the nullmove pruning. Do nullmove >for excample not in pure pawn endgames or if there are not a min. number of >pieces on the board. >See also the enhanced R2/3 nullmove pruning by Ernst A. Heinz where R depends an >the number of the pieces and the distance. > >You can do such things also in other pruning techniques and also for search >extensions. > >Andreas Inertia Bob D.
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.