An alternative efficient chessboard representation based on 4-bit piece coding

DOI10.2298/YJOR081028011VMaRDI QIDQ2856795zbMATH OpenFDO

Authors Vladan Vučković

Publication date 30 October 2013

Published in YUJOR. Yugoslav Journal of Operations Research (Search for Journal in Brave)

zbMATH Keywords

data structurescomputer chesschess engineschessboard representation

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04) Positional games (pursuit and evasion, etc.) (91A24)

Recommendations

• Computational methods and new results for chessboard problems
• Bits and pieces: Constructing chess endgame databases on parallel and vector architectures
• A simple formalization and proof for the multilated chess board
• An explicit solution to the chessboard pebbling problem
• Algorithm performance for chessboard separation problems
• An inescapable region for the chessboard pebbling problem on four quadrants
• A quantitative study of \(2\times4\) Chinese dark chess
• Optimal Computing the Chessboard Distance Transform on Parallel Processing Systems

Cited in

(1)

• An algorithm for the detection of move repetition without the use of hash-keys

This page was built for publication: An alternative efficient chessboard representation based on 4-bit piece coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2856795)