Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: late move reductions

Author: Uri Blass

Date: 04:48:30 03/02/06

Go up one level in this thread


On March 02, 2006 at 05:41:18, Tord Romstad wrote:
<snipped>
>  The biggest
>recent leap in playing strength for my program recently (except for
>parallel search, of course) came when I finally decided to drop the use
>of history counters altogether, and use evaluation data and null move
>threat detection instead.  This also makes sense from an intuitive point
>of view, IMHO.  When deciding whether a move should be reduced, the
>impact of the move on the current position should be much more relevant
>than how the same move has performed in the often totally different
>positions we have visited earlier in the search.

The problem is that you have not perfect evaluation so evaluation data may be
wrong so intuitively combination of both is probably best.

If the move never failed high then it probably also never failed high in
similiar conditions(of course counters for different conditions may be used).

Uri



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.