Computer Chess Club Archives

Search

Messages

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

Author: Ricardo Gibert

Date: 18:59:07 12/19/03

Go up one level in this thread

Neither. The number of positions a program examines in the course of a game is
finite. If the TT is large enough to accomodate all of them, then further
increasing the size the TT will not be productive. This is not just a case of
diminishing returns. It's more like a brick wall.

On a real world machine, you might even get some slow down if the TT is too big.

I suspect that most people tend to overestimate the value of increasing the size
of the TT in chess programs.

• Re: Is improvement from hash tables in middle game linear or exponential? Uri Blass 19:50:22 12/19/03

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.