Computer Chess Club Archives

Search

Messages

Subject: Re: question about an efficient way to change the bits of a number.

Author: Ratko V Tomic

Date: 08:10:07 07/27/03

Go up one level in this thread

>To compute b = a for mask m: b = (b&~m)|(a&m)   [untested]
>
>That's 4 operations. 3 if m is a constant when the "~" will optimized away.

A quicker way (max 3 ops):

  b^=(a^b)&m;

• Re: question about an efficient way to change the bits of a number. Ricardo Gibert 08:39:05 07/27/03
  • Re: question about an efficient way to change the bits of a number. Ratko V Tomic 14:47:54 07/27/03
  • Re: question about an efficient way to change the bits of a number. Gerd Isenberg 10:14:51 07/27/03
    • Re: question about an efficient way to change the bits of a number. Ricardo Gibert 10:43:54 07/27/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.