Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Generating Game Trees

Author: Uri Blass

Date: 04:48:42 06/16/03

Go up one level in this thread


On June 16, 2003 at 07:30:47, Andrei Fortuna wrote:

>On June 16, 2003 at 07:08:44, Uri Blass wrote:
>>
>>In my program I calculate the evaluation at every node and in the leaves I may
>>calculate only part of the evaluation.
>
>Wow! Isn't this slower than the usual method of evaluation only in leaves ?
>What are the advantages if I may ask ? Better move ordering ? Just curious ...

I do not want to share too much information about the advantages in order not to
help other programmers but
Rebel also use similiar ideas and you can read about Rebel in the following
link(I use evaluation for some ideas that are not in Rebel):

http://members.home.nl/matador/chess840.htm


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.