Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Rough comparison between rotated bitboards and 0x88

Author: Dann Corbit

Date: 17:10:30 06/19/00

Go up one level in this thread


On June 19, 2000 at 19:57:19, James Robertson wrote:
>On June 19, 2000 at 19:37:14, Andrew Dados wrote:
[snip]
>>Even worse news: When I went down to asm as you did for bitboards, I was able to
>>speed up capture detection for 0x88 by some 66% :)
>
>This is amazing.... did you improve the algorithm, or just are you 66% smarter
>than the compiler? If you say the latter, expect to have many people asking you
>to make sure optimizations are on when you recompile the C++ version. :)

Almost astonishing.  I would like to know the compiler and settings that were
used.  Ten years ago, you could almost always double the speed of a C program by
an assembly rewrite, but I find that it is very difficult to improve on the
modern optimizing compilers of today by a significant amount.




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.