Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Dynamic Pruning System

Author: Vincent Diepeveen

Date: 10:50:50 12/20/02

Go up one level in this thread


On December 20, 2002 at 11:49:17, Jonathan Lee wrote:

Without going into discussion about words, the only
interesting thing is pseudo code here.

You can invent great things, but it is the pseudo code which
describes how it practically works.

Please put in pseudo code what you mean with dynamic pruning,
because as far as i know, everything in computerchess is dynamic
nowadays anyway.

My evaluation is evaluating the actual position which is dynamically
existing at the leafs. So the whole search in itself i can see
as dynamic.

>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



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.