Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: EGTB algoritmic question

Author: Tony Werten

Date: 16:11:24 07/25/02

Go up one level in this thread


On July 24, 2002 at 13:34:54, Alvaro Jose Povoa Cardoso wrote:

>Hi all,
>I've been working on EGTB generation with DTM.
>I use the 2 most significant bits of a byte to store win/draw/loss/broken.
>So I have 6 bits left for DTM that gives only 64 values wich are insufficient
>for my needs.
>My question is if there is a way to increase this 64 DTM limit and still use a
>single byte for each EGTB entry.

I think you are making it too difficult.

A byte can go from -128 to 127. If positive then stm wins, if negative stm
looses, if 0 then draw or broken.
If you want to find out wich one of the 2 ( altough I wouldn't know why ) then
look if the position is illegal. If so then it's broken else it's a draw. But
since you can't reach an illegal position this doesn't matter.

Tony

>
>I've read some ICCA Journal articles on EGTB but they have no information on
>this particular detail.
>
>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.