Computer Chess Club Archives

Search

Messages

Subject: Re: Efficient Rotated Bitboard Representations

Author: Bo Persson

Date: 04:27:43 10/31/98

Go up one level in this thread

On October 29, 1998 at 13:20:45, Roberto Waldteufel wrote:
[snip]
>Of course, once I started using assembler on the intel CPU, the bsf and bsr
>instructions were a god-send and I stopped all this nonsense with modular
>arithmetic....:-)
>
>Best wishes,
>Roberto

I thought these instructions were microcoded and extremely slow on anything
newer than a 386! When testing on a Pentium, a table lookup was actually much
faster for me.


Bo Persson
bop@malmo.mail.telia.com

• Re: Efficient Rotated Bitboard Representations Robert Hyatt 07:44:25 10/31/98
  • Re: Efficient Rotated Bitboard Representations Roberto Waldteufel 16:45:28 10/31/98
    • Re: Efficient Rotated Bitboard Representations Robert Hyatt 17:57:09 10/31/98
      • Re: Efficient Rotated Bitboard Representations Bo Persson 07:20:39 11/01/98
      • Re: Efficient Rotated Bitboard Representations Roberto Waldteufel 18:53:20 10/31/98

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.