Author: Roberto Waldteufel

Date: 16:16:05 10/25/98

Hi all, Has anyone tried this, or thought of trying this before? The main drawback of 32-bit CPU's for bitboards is that each time you need to step through the bits in a bitboard you have to step through two 32-bit values, since that is all that will fit in a register. I have an idea that partially overcomes this problem. It is based on the observation that many of the bitboards used in move generation are mono-chromatic, by which I mean that the 1's are either all light squares or all dark squares. For example, bishop moves, pawn captures and double pawn moves are always to a square of the same colour as the origin square, and knight moves and single pawn moves are always to a square of opposite colour to the origin square. I therefore propose a bitboard structure consisting of two 32-bit unsigned integers, one for the light squares and the other for the dark squares. If rotated bitboards are to be used, then the bits could be aligned for one set of diagonals, and a second pair of bitboards aligned for the other diagonals (ranks and files would be done same as before, only diagonals would need reorganising). Then when polling the bits of an attack map to find the moves for minor pieces, only one 32-bit bitboard is needed to hold all the destination squares, and generating pawn captures by means of shifting and logical ANDing can easily be divided into light-square captures and dark-square captures. I have not yet tried this, but I see no reason why it should not work. Of course, it does nothing to help rook-moves (including rook-type queen moves) or king moves, but these could be generated with no more work than is needed in a normal a1-h1,a2-b2,......a8-h8 ordering of the squares. Nevertheless, if some of the generation can be compressed to 32-bit operations instead of 64, it must surely help to some extent. Any comments? Roberto

- Re: Efficient Bitboard Implementation on 32-bit Architecture
**Bruce Moreland***16:21:33 10/26/98*- Re: Efficient Bitboard Implementation on 32-bit Architecture
**James Robertson***11:00:05 10/27/98* - Re: Efficient Bitboard Implementation on 32-bit Architecture
**Amir Ban***02:57:30 10/27/98*- Re: Efficient Bitboard Implementation on 32-bit Architecture
**Bruce Moreland***01:14:35 10/28/98*

- Re: Efficient Bitboard Implementation on 32-bit Architecture

- Re: Efficient Bitboard Implementation on 32-bit Architecture
- Re: Efficient Bitboard Implementation on 32-bit Architecture
**Robert Hyatt***16:28:54 10/25/98*- Re: Efficient Bitboard Implementation on 32-bit Architecture
**Roberto Waldteufel***20:19:09 10/25/98*- Re: Efficient Bitboard Implementation on 32-bit Architecture
**Robert Hyatt***06:20:05 10/26/98*- Re: Efficient Bitboard Implementation on 32-bit Architecture
**Roberto Waldteufel***08:35:18 10/26/98*

- Re: Efficient Bitboard Implementation on 32-bit Architecture

- Re: Efficient Bitboard Implementation on 32-bit Architecture
- Re: Efficient Bitboard Implementation on 32-bit Architecture
**Peter Fendrich***16:58:08 10/25/98*- Re: Efficient Bitboard Implementation on 32-bit Architecture
**Robert Hyatt***06:23:19 10/26/98*- Re: Efficient Bitboard Implementation on 32-bit Architecture
**Peter Fendrich***11:57:46 10/26/98*

- Re: Efficient Bitboard Implementation on 32-bit Architecture

- Re: Efficient Bitboard Implementation on 32-bit Architecture

- Re: Efficient Bitboard Implementation on 32-bit Architecture

This page took 0.04 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.