Hi everyone,
I made a chess engine using an alpha-beta pruning / negamax algorithm along with a transposition table to optimise the pre-calculation of moves in a game tree.
please have a look and let me know how can i improve this chess engine and optimise its recursive calls(depth) to manage latency.
GitHub : https://github.com/EuclidStellar/Sepentia-ChessEngine ( if you find it good please do star it )
also if you are interested to know how i made this here's a medium article I wrote on it :https://medium.com/@euclidstellar_57634/creating-a-chess-engine-sepentia-835a86aa25da
I'm not good at chess engines but if I know Big Algo they must be using 1e9 different heuristics.
If you change the depth $$$4 \rightarrow 5$$$, will it be too slow?
https://www.youtube.com/watch?v=U4ogK0MIzqk This can help you, it has a lot of good techniques for making chess engines. If you want to make an even stonger bot, here is another video: https://www.youtube.com/watch?v=_vqlIPDR2TU
Hope this helps!
https://youtu.be/Ne40a5LkK6A
Did you implement Zobrist hashing for the board state? Because Zobrist Hashing can make your code almost 4000 times faster.
I used to be interested in making bots for chess-like 2-player zero-sum games too. I found this resource to be very useful: https://www.chessprogramming.org/Main_Page. Check it out.
I wrote a chess engine after watching that Sebastian Lague video a year ago. Mine kinda sucked, I found this one though https://github.com/thomasahle/sunfish It is very good
Hey, that's great! I also made a chess engine using the same algorithm with other optimizations. You can check it out here: https://github.com/imranakki/OBSIDIAN. It plays well, but sometimes makes dumb moves when the time runs out.