Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Representations

Author: Stuart Cracraft

Date: 09:15:46 12/21/05

Go up one level in this thread


On December 21, 2005 at 09:04:17, David Rasmussen wrote:

>I am most familiar with bitboards, but now I have to make a chess program with
>an old C compiler (gcc 2.6.0) that doesn't support "long long". I could typedef
>a struct with two 32-bit ints to be a bitboard and then implement the logical
>operators in functions, but I want to consider other options.
>
>What would be a good representation for a "competitive" chess program (not a toy
>project), on a platform with little memory and slow performance (C is compiled
>into a interpreted language in this case).
>
>/David

Very unusual requirement by your sponsor to use an old C compiler that doesn't
support "long long". I would be skeptical of that kind of requirement but
understand the kinds of situations they can arise in.

Your typedef is fine.

The overall problem of course is that you won't get the benefits of many
advances to the GCC compiler since.

Stuart



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.