Computer Chess Club Archives

Search

Messages

Subject: Re: "Using de Bruijn Sequences to Index a 1 in a Computer Word"

Author: Ricardo Gibert

Date: 09:53:32 02/09/02

Go up one level in this thread

On February 08, 2002 at 17:17:26, Oliver Roese wrote:

>Hi!
>
>http://citeseer.nj.nec.com/338945.html
>Hope you find it interesting.
>
>Oliver

Yes, it is quite interesting. Thanks!

For 32 bits, the perfect hash function x%37 instead of the minimal perfect hash
function (x*debruijn32)>>27 also works well. The difference is a slightly larger
lookup table will be needed and a division is performed instead of a
multiplication plus a shift. For 64 bits the modulus 67 works.

• Re: "Using de Bruijn Sequences to Index a 1 in a Computer Word" Dann Corbit 17:23:08 02/11/02
  • Re: "Using de Bruijn Sequences to Index a 1 in a Computer Word" Ricardo Gibert 02:03:32 02/12/02
    • Re: "Using de Bruijn Sequences to Index a 1 in a Computer Word" Dan Newman 12:58:49 02/12/02

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.