Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Differences between 0x88 ,10x12 and Bitboards!?

Author: Robert Hyatt

Date: 22:14:45 11/19/02

Go up one level in this thread


On November 19, 2002 at 15:36:37, Gian-Carlo Pascutto wrote:

>On November 19, 2002 at 14:56:11, Vincent Diepeveen wrote:
>
>>We are now at square sq and want to know whether a complex pattern is
>>happening. For example:
>>
>>if( sq >= 8 && board[sq-8] == bishop && board[sq-7] == rook && ...
>
>In most classical approaches the sq >= 8 would not be needed here.
>
>--
>GCP


Even worse, no bitboard programmer in his right mind would start with an ad hoc
"pattern" like the above.  The first question is "what do I want to detect?"
and then the question is "how can I best implement that using bitmaps?"  This
second question takes time at first.  And gets easier to answer with more
experience.  Sort of like trying to learn how to use a programming language like
Snobol4 or something similar, after only doing C programming for 10+ years.

Trying to do such a stupid test as above makes no sense as there is no
"context".  The above might be the way to ask whatever question that is in a
program using a board array.  But it probably isn't the way I would ask it in a
bitmap program...



This page took 0.04 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.