Computer Chess Club Archives


Search

Terms

Messages

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

Author: Dann Corbit

Date: 09:10:33 02/11/02

Go up one level in this thread


On February 09, 2002 at 12:14:22, Ricardo Gibert wrote:

>On February 09, 2002 at 03:07:47, Dann Corbit wrote:
>
>>On February 08, 2002 at 17:17:26, Oliver Roese wrote:
>>
>>>Hi!
>>>
>>>http://citeseer.nj.nec.com/338945.html
>>>Hope you find it interesting.
>>
>>Unless I've screwed it up a bit, it doesn't quite work right at the endpoints.
>
>If you take the trouble of understanding the *idea* of the algorithm, you would
>realize that the idea is sound even if a particular incarnation in code may not
>be.

A perfect hash that maps to the right bit is obviously a commically simple idea.
 However, if the author of the original paper has not bother to make even the
most rudimentary tests for correctness, I doubt the entire outcome of the paper.
 Is it really faster?  Maybe not, if you have to model everthing correctly.



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.