Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Bitboard VS array board ,speed difference in movegen()

Author: James Swafford

Date: 16:07:51 02/24/01

Go up one level in this thread


On February 24, 2001 at 00:57:05, TEERAPONG TOVIRAT wrote:

I'm also interested in this comparison - if you come up with something
meaningful I'd like to add it to my website.

Comparing functions is ok, but it'd be much more interesting to
compare to whole engine (including make/unmake and the eval).
There are neat things you can do with bitboards in the eval with
simple boolean operations.

--
James



>Hi,
>
>I want to measure the speed difference in move
>generation between bitboard and array board.
>I think it's unfair to compare the speed of these
>two movegen() directly,because bitboard calculates
>attacked squares in makemove() and also unmake()
>(at least the technique I used) .
>So,the test should include makemove(),unmake() too.
>The question is what is the optimum ratio for
>each function?
>Suppose the branching factor is 4, this means that
>in a real situation,approximately the first 4 moves
>are passed to next ply repeatedly.
>So, the ratio should be 1:4:4 for movegen():
>makemove():unmakemove. Here is my test...
>
>       for(iteration n times)
>        {
>        movegen() // of course, n times
>        for(first 4 moves) // so, 4n times
>         	{
>	makemove();
>        	unmakemove();
>        	}
>        }
>
>Any comments?
>
>Thanks in advance,
>Teerapong



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.