#

montecarlo-tree-search

Here are 4 public repositories matching this topic...

agusuy / adversarial_search

A Python framework for implementing AI agents that use adversarial strategies in two-player, zero-sum games.

python artificial-intelligence minimax-search minimax-alpha-beta-pruning montecarlo-tree-search

Updated Oct 10, 2022
Python

ExalFabu / ci-quixo

Computational Intelligence @ Polito - Project Assignment

computational-intelligence adversarial-learning minmax quixo minmax-alpha-beta-pruning montecarlo-tree-search

Updated Jan 28, 2024
Python

kaellandrade / ia6561

Repositório para o projeto de IA

python inteligencia-artificial 2048-game gameboards codecup montecarlo-tree-search moteca

Updated Mar 17, 2023
Python

Tristan-Amadei / TicTacToe-MCTS

Monte-Carlo Tree Search applied to the Tic-Tac-Toe game.

reinforcement-learning tic-tac-toe montecarlo-tree-search

Updated Feb 9, 2024
Python

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.

Curate this topic

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."