Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Use of square eval using Bit Boards aka Ed's Rebel Evaluation,but for bb

Author: Tony Werten

Date: 14:22:40 01/08/03

Go up one level in this thread


On January 08, 2003 at 16:25:44, Russell Reagan wrote:

>On January 08, 2003 at 14:31:10, Ed Schröder wrote:
>
>>Yes Gerd, this is probably most true. I never had the time to put energy in the
>>bit-boards technique. Do you have any idea about the number of clocks needed to
>>extract the hanging pieces from a position using bitboards?
>
>I wrote a program using the same algorithms that Gerd uses for generating
>attacks, but mine are written in C instead of using MMX like Gerd, so mine are
>going to be slower than his. In any case, the engine is somewhat slow. It gets
>around 70knps or maybe a little more on my PIII 733 MHz machine (compare with

I don't want to bring you down but that is kind of slow.

XiniX, while generating Ed's attackboards and doing full evaluation and
everything else still gets 400Kn/s in the middlegame on a amd2000

And that's only with generating the attackboards, not actually using them to
speed up stuff.

Tony

>approximately 250knps for Yace), and it is only doing alpha-beta with
>material+mobility evaluation and nothing else like hash table, move ordering, or
>anything else that would cause a slow down. So I think for generating attack
>bitboards on the fly, it is doable on a 32-bit machine, but is probably better
>to wait until 64-bit machines unless you are good with MMX assembly like Gerd,
>or if you use rotated bitboards like in Crafty it might be reasonably fast as
>well.



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.