Computer Chess Club Archives

Search

Messages

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

Author: Volker Böhm

Date: 00:20:43 12/20/05

Go up one level in this thread

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?

Greetings Volker

• Re: optimization on reduced int range - e.g. knight-distance Gerd Isenberg 04:42:54 12/20/05
• Re: optimization on reduced int range - e.g. knight-distance Tord Romstad 00:39:44 12/20/05

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.