Computer Chess Club Archives

Search

Terms

Messages

Subject: Re: question about optimizing code - Andrews one

Author: Tim Foden

Date: 05:16:01 07/08/03

Go up one level in this thread

On July 08, 2003 at 05:31:04, Gerd Isenberg wrote:

>Andrew's one - as expected faster than Tim's approach
>
>so far:
>Andrew    n = 1799993753, time = 5.828
>Tim       n = 1799993753, time = 6.875
>Switch256 n = 1799993753, time = 2.671
>
>so now i really have to work ;-)

Ah... But what about with a data set where on average only 1.27405 bits are set
(see http://www.talkchess.com/forums/1/message.html?305213)?  I guess this may
bring the numbers closer together... but my simple approach will probably still
be slower.  :)

Cheers, Tim.

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.