Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: why write a fast chess program ?

Author: Andrew Williams

Date: 09:57:09 08/17/02

Go up one level in this thread


On August 17, 2002 at 12:33:01, Engin Üstün wrote:

>Hi,
>
>you are wrong, the most programs used bit-operations to get faster functions.
>
>i am use also some AND bit-operations for hash tables but i use not BITBOARDS.

You are not making yourself clear. Before you said:


>>> it's pitty that most of the chess programs are fast BITBOARD based and not
>>> selective search programs.

I then replied

>> I suspect that only a small minority of programs are bitboard-based.

Now you are talking about "bit-operations". If you mean 64-bit bitboards, where
each bit represents some condition about a particular square of the board, then
my statement is probably true. If you mean "the majority of programs use 64 bit
numbers (eg for hash tables)", then of course that is true, but what possible
relationship does that have with selective search?

Andrew



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.