The author covers the implementation of a pseudo random number generator using the XORSHIFT32 algorithm in this edition of Devlog 0x1. They also explain magic bitboards, an optimization technique in chess engines for calculating piece movement possibilities quickly. Magic numbers, pre-computed lookup tables, and bitwise operations are used to create unique indices. The author uses the initial state 1804289383, commonly used in engine implementations. The implementation of the PRNG is straightforward, involving bit shifts on the initial state. The code snippet provided shows how the XORSHIFT32 algorithm is applied to generate random numbers. Check out the video by Maxim Korzh and the article on finding magic numbers for more information.
https://www.strydr.net/articles/devlog-0x1