Bit Twiddling Hacks (2005)

Neat. Also here&#x27;s some other sources beyond the usual CS bookshelf suspects:<p><a href="http://www.hackersdelight.org/" rel="nofollow">http:&#x2F;&#x2F;www.hackersdelight.org&#x2F;</a><p><a href="http://www.inwap.com/pdp10/hbaker/hakmem/hakmem.html" rel="nofollow">http:&#x2F;&#x2F;www.inwap.com&#x2F;pdp10&#x2F;hbaker&#x2F;hakmem&#x2F;hakmem.html</a><p>(We recently had to grab the C standards in order to bust out some integer under&#x2F;overflow macros that wouldn&#x27;t be brittle.)

There&#x27;s also a lot of 64-bit hacks on pages related to chess programming (8x8 boards). For example: <a href="https://chessprogramming.wikispaces.com/Bitboards" rel="nofollow">https:&#x2F;&#x2F;chessprogramming.wikispaces.com&#x2F;Bitboards</a><p>And my faviourite bit hack question on SO: <a href="https://stackoverflow.com/questions/14537831/isolate-specific-row-column-diagonal-from-a-64-bit-number" rel="nofollow">https:&#x2F;&#x2F;stackoverflow.com&#x2F;questions&#x2F;14537831&#x2F;isolate-specifi...</a>

It&#x27;s an awesome page.<p>I would guess one of the reasons it&#x27;s here though is that it&#x27;s almost required reading for Google interviews, #DetermineIfPowerOf2 is a particular favorite.

Another resource in the same vein (it links to this page, among others):<p><a href="http://aggregate.org/MAGIC/" rel="nofollow">http:&#x2F;&#x2F;aggregate.org&#x2F;MAGIC&#x2F;</a>

This has been popular over the years, but hasn&#x27;t had attention on HN in a while:<p><a href="https://hn.algolia.com/?q=bit+twiddling+hacks#!/story/forever/0/bit%20twiddling%20hacks" rel="nofollow">https:&#x2F;&#x2F;hn.algolia.com&#x2F;?q=bit+twiddling+hacks#!&#x2F;story&#x2F;foreve...</a><p>We put 2005 on it, though the Internet Archive says there were earlier versions.

He should pay bounties in BTC...