A Chess Game using Monte Carlo Tree Search algorithm .

Monte Carlo Tree Search (MCTS) algorithm is used to calculate the optimal move each and every time, simulating a progressive game of chess. This model could be used as a framework to figure out the best moves to make in various chess game conditions. The chess webapp is implemented with Streamlit.

Installation Steps

  https://www.anaconda.com/products/individual

Create a conda environment and activate it

  $ conda create streamlitapp
  $ conda activate streamlitapp

Install required packages from requirements.txt

  # Clone this repository and cd into it
  $ cd 
  $ pip install -r requirements.txt

Run the streamlit app

  $ streamlit run app.py  

App Screenshots