The goal of this project is to find the number of legal moves branching from any given chess position as fast as possible, with clear minimalistic code. For simplicity, we don't include threading, SIMD instructions or a hash table. With my Intel i5-8400 CPU, it currently completes perft(7) in ~6s which equates to ~530M nodes per second.
It assumes a UNIX-like operating system such as linux or mac and would need to be modified to compile on windows.
cd src
make
To run the perft:
./perft <FEN> <depth>
To run the tests:
./test
.png)