Author: Severi Salminen
Date: 02:10:33 10/20/00
Go up one level in this thread
>>How do I find n in a binary number 2^n? So f(1000b)=3? Now I just shift right: >Easiest answer is look at the crafty source. Intel has instructions >BSF/BSR to do this. Or you can do a table lookup. Code for both >approaches is included in Crafty. How fast are BSF and BSR? I know that pure shifting is very fast, but how many shifts do I have to do to be slower than BSR or BSF? Severi
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.