Skip to content

In this project, my primary goal was to implement an AI player class powered by the Monte Carlo Tress Search algorithm which can play for a win as well as defend a defeat to compete with a Human player.

License

Notifications You must be signed in to change notification settings

shehanrathnayake/implementation-of-monte-carlo-tree-search-algorithm-for-connect-4-game

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

22 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Implementation of Monte Carlo Tree Search Algorithm for The Connect-4 Game

Version

1.0.0

Introduction

In this project, my primary goal was to implement an AI player class powered by the Monte Carlo Tress Search algorithm which can play for a win as well as defend a defeat to compete with a Human player.

Demonstration

In the demonstration, AI player represent the green color and Human player represent the blue color.

demo

demo

demo

demo

demo

Disclaimer

The project is solely belongs to the IJSE except for the code of Monte Carlo Tree Search Algorithm implementation developed by me.

License

Copyright © 2023 DEP. All rights reserved
This project is licensed under the MIT License.

About

In this project, my primary goal was to implement an AI player class powered by the Monte Carlo Tress Search algorithm which can play for a win as well as defend a defeat to compete with a Human player.

Topics

Resources

License

Stars

Watchers

Forks