Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: BitScan with reset - not so impressive with 3DNow!

Author: Gian-Carlo Pascutto

Date: 03:40:36 12/03/02

Go up one level in this thread


On December 02, 2002 at 19:43:15, Gerd Isenberg wrote:

>Congrats, Walter!!
>
>10-bit pattern		bsf	PI2FD	btr	c      LSB_64
>0x0000000011111133	15.3	18.0	19.1	22.8    17.8
>0x1010111010101110	19.7	18.5	19.6	23.4    17.8
>0x1111113300000000	20.6	18.0	19.1	22.8    17.8

Does this mean that this is the fastest currently known
FindFirstAndRemove *and* that it doesn't need assembly?

Impressive for sure!

Any similar tricks for lightning-speed popcounting?

What's the fastest sequence you've got for popcounting so
far? (preferably one that doesn't depend too much on new
instructions)

--
GCP



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.