Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: piece-lists versus bitboards on 64-bit-systems

Author: Reinhard Scharnagl

Date: 01:27:28 03/13/05

Go up one level in this thread


On March 13, 2005 at 04:18:59, F. Reul wrote:

>Hello,
>a few weeks ago, I read an article in "ct-magazin" about the 64-bit-world. The
>benchmark-test "186.crafty" promises 20 percent speed-increase with the new
>64-bit-compilers of Intel and Microsoft with Windows x64 on a 64-bit-system.
>
>My question, can some programmers confirm these results, are there any articles
>online to read about this, and is a speed-increase of bitboard-engines more
>than 30 percent possible or not?
>
>Can the "microsoft-whidbey-compiler" optimize on 64-bit-systems with
>"feedback-protocol", or is the "intel 8.1-compiler" better for bitboard-engines
>?
>
>What´s about the speed-increase of classic-32-bit engines (0x88 or similar
>architectures) ?

If 0x88 stands for flat data structures, ok. But 0x88 for me seems not to be
the most performant flat data structure.

And before talking on 64 bit approaches it would make sense to have a top ten
hitlist of those based on 32 bit. I have not the idea that bitboards are more
performant than flat data structures.

>I would be very happy, about a discussion :-))

Because of the fact that most people would still not use a 64 bit OS, it would
be interesting to discuss 32 bit experiences first.

Reinhard.



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.