Computer Chess Club Archives

Search

Messages

Subject: Re: huge speedup by using pointers instead of arrays

Author: Uri Blass

Date: 03:15:05 09/28/04

Go up one level in this thread

On September 28, 2004 at 05:33:46, Roman Hartmann wrote:

>About half a year ago I started to write a move generator from scratch (to be
>honest that was allready my second attempt) and soon I realized that this would
>not be an easy task as progress was very slow. But anyway a few days ago I
>finnished this task also due the help of this forum (I found the EP and castling
>bug with the help of the divide command of Sharper).
>
>Anyway, as I’m not using biboards in my program I was sure my move generator
>would be rather slow compared to state of the art bitboard programs.


Why?

BitBoard is not considered to be faster in generating moves than non bitboards
and a lot of commercial programs do not use bitboards.

Uri

• Re: huge speedup by using pointers instead of arrays Roman Hartmann 04:17:00 09/28/04
  • Re: huge speedup by using pointers instead of arrays Michael Henderson 06:18:51 09/28/04

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.