Abstract
This note addresses theoretical and practical aspects of an important issue in computer-chess programming - the problem of chessboard representation. There are two main approaches used by the majority of computer-chess programs: arrays and bitboards. However, after many years of research and experiments with the chess engine A
Get full access to this article
View all access options for this article.
