Computer Chess Club Archives

Search

Messages

Subject: Re: Interview with Christophe theron (from chessbase) about GT2 and CT14

Author: Uri Blass

Date: 06:31:04 04/19/01

Go up one level in this thread

On April 19, 2001 at 08:55:39, David Rasmussen wrote:

>On April 18, 2001 at 16:01:06, Uri Blass wrote:
>>
>>I know it but the point is that programs are very fast and every algorithm in
>>chess that is better for deep search is probably better for today's hardware.
>>>
>
>That is simply not true. One example is Enhanced Transposition Cutoff, as I've
>mentioned earlier. ETC will always be an improvement in the long run, since
>you're winning an exponential amount of time by using a constant (but on todays
>systems, large) amount of time. This is often not beneficial on todays system,
>but on a much quicker system, it would be.

What is the Enhanced Tranposition Cutoff algorithm?

Uri

• Re: Interview with Christophe theron (from chessbase) about GT2 and CT14 Uri Blass 07:22:12 04/19/01
  • Scalable Search David Rasmussen 03:44:09 04/20/01
    • Re: Scalable Search Robert Hyatt 06:59:58 04/21/01

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.