This my submission for the Tiny Chess Bots coding challenge.
- Video: https://youtu.be/iScy18pVR58
- Challenge: https://github.com/SebLague/Chess-Challenge
I started of using MiniMax but switched to NegaMax because it was easier to implement/read but also used a lot less tokens.
Read about it here.
Because of the 1024 token limit the use of piece-square tables was out of the question, or so I thought.
I ended up encoding the 6 piece-square tables into a single array using some bit shifting.
Read about it here.
The bot was constantly blundering pieces so I've added Quiescence Search to try and avoid this.
Read about it here.
I've also added Aspiration Windows to try and improve the search speed. I went from depth=4-6 to depth=5-8.
Read about it here.