Computer Chess Club Archives

Search

Messages

Subject: Newbie binary LSB question

Author: scott farrell

Date: 13:27:53 12/04/03

Gerd (I think) recently gave me a link to a high tech djinni (really deBrujin or
soething) for LSB - which works great  .. thanx :).

It got me thinking, this seems to run very fast for my java chompster:

(x& (x-1)) ^x

which works out the lsb, but it is 64 bit, a straight cast to (int) doesnt work
(as the cast just grabs the first/last 32 bits or something).

Is this why we need all the high tech maths to get the right 32 bits out?

Maybe someone can help with how to process the above into a 32 bit int.

Thanx
Scott

• Re: Newbie binary LSB question Gerd Isenberg 05:03:09 12/05/03
• jsut for kicks, ehre is my popcount function scott farrell 13:43:54 12/04/03
  • Re: jsut for kicks, ehre is my popcount function Anthony Cozzie 05:54:39 12/05/03
• Re: Newbie binary LSB question ... corection? scott farrell 13:38:21 12/04/03
  • Re: Newbie binary LSB question ... corection? Slater Wold 13:43:27 12/04/03
    • Re: Newbie binary LSB question ... corection? scott farrell 14:06:05 12/04/03

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.