Computer Chess Club Archives




Subject: Re: BitBoard challenge to Ernst A. Heinz and bitboard fans - no moderation

Author: Robert Hyatt

Date: 12:59:05 01/18/99

Go up one level in this thread

On January 18, 1999 at 11:40:27, Vincent Diepeveen wrote:

>On January 17, 1999 at 21:54:06, Robert Hyatt wrote:
>>>>what is 'lossy' code?  concept makes no sense to me in this context.
>>>he he he he he,
>>>I thought you gave lessons as a professor in things like that...
>>I do.  I teach about "lossless and lossy joins in database theory."  But
>>that implies 'losing something'.  I lose _nothing_.
>Haven't seen lossless bitboard code for the attacktables yet, only lossy
>and collecting the bits of it is something i don't prefer to do using
>a bunch of ifs... :)

I don't know what code you are looking at.  I lose _no_ attacks, _no_ pieces,
and _no_ information in my bitboard code.  If we are back on the 'mobility'
issue again (different value for each square attacked) I can do that if I need
to.  At present I don't see the need.  But if I wanted to have 3-4 'classes' of
squares to count mobility on, it would be trivial.

>About the Parallellism. I have other priorities, although it'll work
>before world championship i hope.
>For now i'm busy with a multi user system and win32 interfaces.

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.