Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: unique distance relationship, conclusion

Author: Gerd Isenberg

Date: 18:04:54 08/16/02

Go up one level in this thread


Thanks to all for your kind words :-)
Happy to hear that it was interesting and possibly usefull.

One other interpretation for the udr-values,
which make the unique feature so obvious:

Bit 765 - distance
Bit 4   - rankdist == filedist
Bit 321 - minidist * (rankdist != filedist)
Bit 0   - set if both squares on opposite color

rankdist ::= absolute rank distance
filedist ::= absolute file distance
distance ::= the maximum of rankdist and filedist
minidist ::= the minimum of rankdist and filedist

Remember that taxidistance is the sum of rankdist and filedist but also from
distance and minidist. Now the (7*dist + taxi) becomes clear.
The 2*(15*dist + taxi) term leaves bit 4 free for the diagonal information.

Cheers,
Gerd



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.