Author: Fabien Letouzey
Date: 02:19:46 06/29/04
Go up one level in this thread
On June 28, 2004 at 21:10:40, Uri Blass wrote:
Hi Uri,
>I do not understand the reason for the name of the following function
>It does not check if a square is empty but only if the square is not a pawn.
>static bool square_is_empty(const board_t * board, int square) {
>
> ASSERT(board!=NULL);
> ASSERT(square_is_ok(square));
>
> return !PIECE_IS_PAWN(board->square[square]);
>}
This module is the pawn hash table. I need to make sure that the position of
pieces does not interfere. As far as this module is concerned, a square that
does not contain a pawn is "empty".
>Another note is that if I understand correctly c6 is considered to be backward
>pawn in the structure c6,c5,b5 no pawn at the d file.
>Do I understand it correctly?
Yes.
Everybody agrees about what a(n) isolated/doubled/passed pawn is but not
backward, isn't it interesting? :)
>Uri
Fabien.
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.