Author: Pham Hong Nguyen
Date: 18:38:24 09/15/04
Go up one level in this thread
On September 15, 2004 at 09:53:53, Stuart Cracraft wrote:
>Hi,
>
>Anyone know of some code somewhere that implements
>at least part (or all) of the originally described
>singular extension and/or any modifications to it that
>have proven worthwhile (if any)?
>
>I am curious what mediocre (or better) results people
>have gotten with singular extension. Originally Anantharaman
>hypothesized that it wouldn't be good at the slower
>speeds of most programs at the time and would require
>fast speeds to show effect. Has this proven true or
According Hsu ("Behind Deep Blue" pp 55), the SE is first time to implemented
for ChipTest with speed 300,000 positions / second and the SE version has beaten
the old version 15:5. This speed is surely not high today.
>false in the intervening 15 years?
>
>Is singular extension now generally discredited as a
>non-reproducible singularity in and of itself?
>
>Thanks,
>
>Stuart
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.