![]() In order to understand magic bitboards, we first need to understand rotated bitboards. Repeated re-readings of that paper is what finally made this all fit together for me. If you want another, somewhat more rigorous, attempt at explaining this, I recommend Pradyumna Kannan’s paper on the subject. I am, myself, in no way an expert on this topic, which hopefully means I stand more of a chance of explaining the basics to beginners! This is not an in-depth discussion there is not enough information here to go and implement anything, but hopefully there is enough information to understand what you’re seeing if you go do further research. So here’s my attempt at an introduction, geared towards people with an existing background in software engineering, but not chess programming. All of them simply lay out the implementation with little explanation, or with explanation steeped in detailed chess programming jargon, inappropriate for a newcomer. While there are plenty of explanations online for how the related techniques of “bitboards” and “rotated bitboards” work, I had a hard time finding an explanation of how and why magic bitboards work. “Magic bitboards” are a common technique in computer chess engines for move generation most modern chess engines use some variant of the technique. Chess Move Generation with Magic Bitboards Essays About Me Chess Move Generation with Magic Bitboards
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |