Computer Chess Club Archives




Subject: Re: Null-Move: Difference between R = 2 and R = 3 in action

Author: Uri Blass

Date: 02:55:43 07/20/02

Go up one level in this thread

On July 20, 2002 at 05:47:38, Gian-Carlo Pascutto wrote:

>On July 20, 2002 at 02:52:11, Uri Blass wrote:
>>My question was not about comparing using hash tables
>>and not using hash tables but about comparing using hash tables
>>in the normal way and using hash tables
>>for all purposes except pruning.
>In the example given, the move ordering from hashtable is almost
>irrelevant, so all the gains are due to pruning.

I did not ask about single example from endgame but about
the middle game or about rating improvement.


This page took 0.08 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.