Skip to content

v2.0.0

Choose a tag to compare

@HenrikCarlGustavBertilAkesson HenrikCarlGustavBertilAkesson released this 22 Jan 07:23
· 56 commits to main since this release
2f1b790

In this version the chess AI is based on Monte Carlo Tree Search but without persisting the generated search tree between move generations. The ability for the user to input number of simulations and playing the AI against a random move generating opponent is introduced. Some basic heuristics for board state evaluation was introduced to bias the move selection towards more promising moves. The AI performs consistently better than an opponent making random moves. Minor changes to the AI where it now takes as input only a chess object, and generates a new move solely based on the current board state input.