Skip to content

Latest commit

 

History

45 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

🟡 Connect Four with Monte Carlo Tree Search (MCTS)

I used MCTS because Python wasn't fast enough for Minimax, and I wasn't smart enough to make good heuristics — so I made an MCTS implementation instead.

The reasoning for publishing this project was that I couldn't find many implementations for this specific problem: a two-person, omniscient board game that is turn-by-turn. A lot of special features come into play when deciding how to best implement MCTS in this kind of environment.

I plan to explain more at a later time when I develop a more educational version of this program.

About

Connect four ai with monte carlo tree search in python

Resources

Stars

0 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages