Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Question to Bob: Crafty , Alpha and FindBit()

Author: Dezhi Zhao

Date: 03:18:55 06/12/98

Go up one level in this thread



On June 12, 1998 at 03:41:43, Vincent Diepeveen wrote:

>Now what's more likely: BSF/R to become faster in future or mispredicted
>branches becoming faster :)

Yes. It only takes 1 or 2 cycles on PII if the 2 operands are both in
registers.
However there some problems with BSF/R instructions.
1. They are machine dependent.
2. There are no (BSF/R) operators in C or C++ compliers. You have to
    use them as asm inline.




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.