Abstract
The game of Chinese Checkers has a computationally expensive move generation function. Finding legal moves dominates the performance of a Chinese Checkers program. This paper describes a bitboard representation of the Chinese Checkers board, how to efficiently generate and apply moves to the board, and how to rank and unrank states. When available, the BMI2 PDEP (parallel bits deposit) and PEXT (parallel bit extract) instructions offer significant efficiency gains, especially over a non-bitboard based implementation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
