Computer Chess Club Archives

Search

Messages

Subject: simple question about bitboards

Author: Uri Blass

Date: 02:35:10 03/27/03

If I want to get rid of the least significant 1 of a BitBoard
I do for a bitboard a
a&=a-1

What is the fastest way to get rid of the most significant 1 of
a bitboard?

Is it slower than a&=a-1 and how much slower?
(it cannot be faster otherwise popcount of crafty could use it).

Uri

• Re: simple question about bitboards Gerd Isenberg 10:27:31 03/27/03
• Re: simple question about bitboards Russell Reagan 08:50:10 03/27/03
  • Re: simple question about bitboards Tony Werten 03:32:37 03/28/03
    • Re: simple question about bitboards Heiner Marxen 02:50:57 03/31/03
    • Re: simple question about bitboards Russell Reagan 10:54:23 03/28/03
      • Re: simple question about bitboards Tony Werten 23:36:45 03/28/03
  • Re: simple question about bitboards Ricardo Gibert 10:31:11 03/27/03
• Re: simple question about bitboards Dezhi Zhao 07:06:47 03/27/03
  • Re: simple question about bitboards Gerd Isenberg 10:17:22 03/27/03
    • Re: simple question about bitboards Robert Hyatt 13:00:26 03/27/03
• Re: simple question about bitboards Robert Hyatt 06:36:45 03/27/03

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.