Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: optimization on reduced int range - e.g. knight-distance

Author: Tord Romstad

Date: 00:39:44 12/20/05

Go up one level in this thread


On December 20, 2005 at 03:20:43, Volker Böhm wrote:

>Hi Gerd,
>
>suppose a 0x88 coding of the positions you can get an index simply by:
>
>position1 - position2 + 128
>
>but you will need a table with 256 entries. Don´t you think this is faster?

The whole point is that this doesn't work.  As Gerd mentioned,
a1-b2+128 equals c3-b2+128, but knight_distance(a1, b2) does not equal
knight_distance(b2, c3).

Tord



This page took 0.01 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.