Computer Chess Club Archives

Search

Messages

Subject: Re: EGTB algoritmic question

Author: GuyHaworth

Date: 11:17:04 07/10/02

Go up one level in this thread

Yes, if you are computing your EGT(B) to the DTM(ate) metric.

You might find a 'mate in many moves', only to discover that there was a much
quicker 'mate in much few moves' which appears many retrograde_cycles later in
the computation.

For example, I forget the exact position but you will get the idea:

wQb3wBh1h2/bKa1bNe1+w ....

1.Qa2+ forcing Kxb2 leaves (I guess) a deep KBBKN win

This mate would be found two cycles into the retrograde_analysis of KQBBKN but a
much quicker win using the Queen would turn up later.

I quoted this position (or similar) in a recent ICGA_Journal.

I recommend you might join ICGA_J, buy the back copies, and save yourself a lot
of time and anguish.

Good luck.

g

• Re: EGTB algoritmic question Daniel Clausen 13:23:54 07/10/02
  • ... a 'deferring' DTM EGT algorithm GuyHaworth 00:45:55 07/13/02
    • Re: ... a 'deferring' DTM EGT algorithm Vincent Diepeveen 07:35:32 07/13/02
  • Re: EGTB algoritmic question Simon Finn 05:45:09 07/11/02

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.