Computer Chess Club Archives

Search

Messages

Subject: Re: 0x88 compared to rot BB

Author: Bas Hamstra

Date: 03:46:01 01/13/03

Go up one level in this thread

On January 13, 2003 at 05:32:13, Rémi Coulom wrote:

>On January 12, 2003 at 17:14:18, Bas Hamstra wrote:
>
>>I am playing with a 0x88 implementation, that is supposed to be faster than my
>>rotated BitBoard program. Just for fun. However I am a little disappointed
>
>I use 0x88 in TCB. 0x88 should be faster than bitboards for basic operations.
>TCB is 30-40% faster than crafty on perft (with a perft implementation similar
>to Crafty's). Your code looks very far from optimal. I plan to make my source
>publicly available soon, so people can take a look at how I do it.
>
>Rémi

In what respect is the code very far from optimal? A few hints would be
appreciated.

Bas.

• Re: 0x88 compared to rot BB Rémi Coulom 04:44:46 01/13/03
  • Re: 0x88 compared to rot BB Rémi Coulom 07:34:13 01/13/03
    • Re: 0x88 compared to rot BB Dieter Buerssner 11:50:37 01/13/03
      • Re: 0x88 compared to rot BB Rémi Coulom 02:35:23 01/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.