Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Stan“s Chess 1.1

Author: David Dory

Date: 23:41:55 08/10/02

Go up one level in this thread


On August 10, 2002 at 10:47:15, Stan Arts wrote:

>The main differences between 1.0 and 1.1 are:
>
>-Now knows and claims 3 fold repetitions and the 50 move rule.
>-10% more nodes/sec (=total program speed)
>-I now use the "killer heuristic" which makes search more efficient.
>-Under winboard it now knows of all result claims and the clock correctly
>stops after a result can be claimed.
>-Under winboard it is now able to send evaluationdata (searchdepth, searchtime,
>total nodes for this move, best move found so far and the move it expects you
>to play in return.)
>-It has more knowledge, especially about king-safety, slightly more active
>play, and some specific new things.
>-And some details have been changed :)

Congratulations, Stan!

Looks like you've been busy with your program. I look forward to trying it out.

Dave



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.