Author: Alvaro Jose Povoa Cardoso
Date: 00:05:30 04/04/02
Hi Martin,
I red the Chinook team article on EGTB ("Solving Large Retrograde Analysis
Problems").
In my mind I was picturing an EGTB entry as a byte with 2 bits for position
classification (win, loss, draw, unkown) and 6 bits for a distance to win/loss
metric.
But in the article they mention the use of only 2 bits, leaving out the distance
to win/loss information.
My question is: using only 2 bits how can the engine make progress?
How can he find the shortest win or the longest loss without those 6 bits of
information?
Best regards,
Alvaro Cardoso
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.