Computer Chess Club Archives

Search

Terms

Messages

Subject: Speed difference between BSF and BSR?

Author: Severi Salminen

Date: 01:32:21 11/26/00

Hi!

I use Bit Scan Forward and Bit Scan Reverse in my chess program to find indexes
of bits. Does it take longer (On pentium or Athlon PC) to find a bit which is
further than near the beginning of search? If I have a rook standing at a8
(which is position 63 in my program) should I use BSR instead of BSF? So, should
I have separate functions to start the scanning from LSB end and MSB end or
could I use the same function?

Is there any way to specify an inline assembler macro which returns a value? Now
I'm using a function. I'm using VC6++ Ent.

Severi

Re: Speed difference between BSF and BSR? Oliver Roese 06:37:23 11/26/00
- Re: Speed difference between BSF and BSR? Severi Salminen 07:46:28 11/26/00
Re: Speed difference between BSF and BSR? Bo Persson 04:11:18 11/26/00
- oops Bo Persson 04:23:10 11/26/00
  - Re: oops Severi Salminen 07:49:30 11/26/00
    - Re: oops Dan Andersson 08:22:17 11/26/00
      - Re: oops Severi Salminen 08:32:27 11/26/00
        
        Re: oops Dan Andersson 10:10:22 11/26/00
        
        More 64-bit support Bo Persson 09:06:23 11/26/00
        
        Re: oops Bo Persson 08:48:19 11/26/00
        
        Re: oops Severi Salminen 14:16:51 11/26/00

This page took 0.01 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.