The video will be linked on github, since I don't have enough time to create it before the submissions end!

Features

Legal move generator (Surge library) NNUE for evaluation Various pruning techniques in search, such as LMR, PVS, razoring, etc.. Transposition tables

How good is it

I don't know. But I can't win against it if I give it 5 seconds only, so either my bot's good or I'm trash.

Difficulties and Challenges

As some wise guy on some chess forum once said, programming is 90% debugging and 10% writing bugs.

Future Prospects

More sophisticated NNUE architecture Singular extension search? Profile-guided optimizations Checks in quiescence

Built With

Share this project:

Updates