adarshsankarrs / ai-chess-game Goto Github PK
View Code? Open in Web Editor NEWTo simulate a chess game that advances by determining the optimal move each and every time, the Monte Carlo Tree Search (MCTS) algorithm was employed. The model has the ability to function as a framework for determining the optimal moves in various chess scenarios. Streamlit is used in the deployment of the chess webapp.