![]() ![]() A typical chessboard was implemented as an 8x8 array, with each square represented by a single byte: an empty square was allocated value 0, a black king could be represented by the number 1, etc. In the early days of chess programming, memory was extremely limited (some programs ran in 8K or less) and the simplest, least expensive representations were the most effective. ![]() The rest of this article describes the major issues related to each component and introduces some of the concepts to be explored in the series. This series will cover all of the above, except the user interface, which is essentially a 2D game like any other.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |