Computer Chess Club Archives

Search

Messages

Subject: Re: Question for Gerd: reduce rbb lookup tables

Author: Russell Reagan

Date: 14:34:58 07/14/03

Go up one level in this thread

On July 14, 2003 at 17:15:50, Bas Hamstra wrote:

>A while ago, in Leiden, Frans mentioned you had a trick to reduce the rotated bb
>lookup tables by a factor 2, without further disadvantages. It had something to
>do with the edges of the board, some "ray-states" you can ignore. I didn't
>understand his short explanation back then. Could you explain?

Hi Bas,

Out of curiosity, how large are the lookup tables you currently use for rotated
bitboard attack generation?

Thanks,
Russell

• Re: Question for Gerd: reduce rbb lookup tables Bas Hamstra 14:50:04 07/14/03
  • Re: Question for Gerd: reduce rbb lookup tables Russell Reagan 16:06:02 07/14/03
    • Re: Question for Gerd: reduce rbb lookup tables Russell Reagan 17:03:22 07/14/03

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.