An alternative efficient chessboard representation based on 4-bit piece coding
| Autor: | Vučković, Vladan |
|---|---|
| Rok vydání: | 2012 |
| Předmět: |
Chess notation
Theoretical computer science computer chess Computer science 010102 general mathematics chessboard representation 0102 computer and information sciences Management Science and Operations Research 4-bit Data structure 01 natural sciences chess engines data structures 010201 computation theory & mathematics lcsh:T58.6-58.62 lcsh:Management information systems Computer chess 0101 mathematics Coding (social sciences) |
| Zdroj: | Yugoslav Journal of Operations Research, Vol 22, Iss 2, Pp 265-284 (2012) Yugoslav Journal of Operations Research (2012) 22(2):265-284 |
| ISSN: | 1820-743X 0354-0243 |
| DOI: | 10.2298/yjor081028011v |
| Popis: | This paper describes theoretical and practical aspects of an alternative efficient chessboard representation based on 4-bit piece coding technique. There are two main approaches used by the majority of computer chess programs: arrays and bitboards. However, after the years of researching and experimenting with chess engine Axon and its parallel version Achilles , we would like to introduce an alternative chessboard representation C. C. R. ( Compact Chessboard Representation ) based on a new coding technique that performs very well both on 32-bit and 64-bit hardware platforms. Keywords: Computer chess, Chess engines, Data structures, Chessboard representation. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|