A Python framework for implementing AI agents that use adversarial strategies in two-player, zero-sum games.
-
Updated
Oct 10, 2022 - Python
#
montecarlo-tree-search
Here are 7 public repositories matching this topic...
Computational Intelligence @ Polito - Project Assignment
computational-intelligence adversarial-learning minmax quixo minmax-alpha-beta-pruning montecarlo-tree-search
-
Updated
Jan 28, 2024 - Python
A chess-based kotlin implementation of the Monte Carlo Tree Search
-
Updated
Jun 22, 2024 - Kotlin
Repositório para o projeto de IA
-
Updated
Mar 17, 2023 - Python
Unity2D_대전 전략 오목 게임
-
Updated
Mar 5, 2025 - C#
Monte-Carlo Tree Search applied to the Tic-Tac-Toe game.
-
Updated
Feb 9, 2024 - Python
Reinforce4j is a Java library designed for implementing reinforcement learning algorithms, with a primary focus on Monte Carlo Tree Search (MCTS). It provides tools and frameworks for building agents that can learn to play games, demonstrated with examples like Tic-Tac-Toe and Connect 4. The library supports integration with machine learning models
-
Updated
Aug 12, 2025 - Java
Improve this page
Add a description, image, and links to the montecarlo-tree-search topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the montecarlo-tree-search topic, visit your repo's landing page and select "manage topics."