Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: ICT 4 Leiden : King vs Ruffian : Ruffian wins

Author: Uri Blass

Date: 07:03:13 04/24/04

Go up one level in this thread


On April 24, 2004 at 09:54:50, Robert Allgeuer wrote:

>On April 24, 2004 at 09:31:00, Uri Blass wrote:
>
>>
>>Movei of today still does not use hash tables for pruning so it cannot search
>>very deep in the endgame.
>>
>
>Btw, is there a specific reason why you decided not to use hash tables for
>pruning (i.e. only for move sorting I assume)?
>
>Thanks
>Robert

I can only say that my evaluation is path dependent and in my tests I did not
find it productive to use hash for pruning.

I believe that it is possible to do it in a productive way but I need to rewrite
things.

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.