Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: algorithm question

Author: Sven Reichard

Date: 14:14:17 09/10/02

Go up one level in this thread


On September 10, 2002 at 04:38:48, Gerd Isenberg wrote:

>OK, i was confused by the syntax in following lines:
>
>   while reachable <> oldReachable and not reachable[B]
>   return reachable[B]
>
>reachable and reachable[B] ?
>

Sorry, my mistake. <reachable> is a bitboard, thus a single 64-bit variable.
reachable[B] is a boolean expression meaning "is square B set in the bitboard
<reachable>?". I.e., I treat a bitboard just like an array of booleans.

Sven.



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.