Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Promotion frequency

Author: Dann Corbit

Date: 22:34:53 07/23/02

Go up one level in this thread


On July 24, 2002 at 00:03:39, Russell Reagan wrote:

>Perhaps it would be possible to write a program to probe the EGTB's to see how
>many underpromotions are the best line. That way you could get perfect data on
>how many are necessary, and how many are just the shortest distance to mate.

By the time we get to EGTB, we can use EGTB to solve it.  I think the dense
positions are a lot more interesting.

Coincidentally, only a few of the positions I posted in the test suite has less
than 7 chessmen.



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.