Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Is improvement from hash tables in middle game linear or exponential?

Author: Robin Smith

Date: 10:48:08 12/20/03

Go up one level in this thread


On December 20, 2003 at 08:23:24, Vincent Diepeveen wrote:

>Please write down according to your formula how much deeper B was supposed to
>search than A after 10 hours of search.

My guess is 0 plies deeper, rounded to the nearest ply.

Robin



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.