A very simple yet serious gobang game AI based on Monte-Carlo Tree Search and implemented in pure Python
-
Updated
May 20, 2017
A very simple yet serious gobang game AI based on Monte-Carlo Tree Search and implemented in pure Python
A python implementation of an agent for ultimate tic-tac-toe using Monte Carlo Tree Search and Upper Confidential Bound
The purpose of this study is to predict which ad will be the most preferred by the customers over the fictitious ads clicked by the users.
Strong Artificial Intelligence for 3-Dimensional Connect 4 using Upper Confidence Tree Algorithm
Real-Life Example for Machine Learning Projects (Python3) -Part-2
Reinforcement learning
Code templates for different ML algorithms
Implementation of the Upper confidence bounds and Thompson sampling algorithms in R for the multi armed bandit problem
Tools for implementing upper confidence bound optimization
A fighting game AI: KeepAwayBot, implemented in Java using Hierarchical Task Networks and the Upper Confidence Bounds Algorithm
Strong Aritifical Intelligence for Checkers created using Upper Confidence Tree algorithm with GUI.
(REINFORCEMENT LEARNING) : We are given a dataset that contains information about the ads clicked by the visitors at each visit to a webpage (amongst 10 different ads). Our Task is to find the most viewed ad i.e ad having the highest distribution of the viewers in Minimum number of Rounds and Resources. Here I have used "Upper Confidence Bound" …
An AI agent implemented using Monte Carlo Tree Search (MCTS) using Upper Confidence Bounds (UCT).
A python based ML tool for CRT inspection & optimization
A Comparative Evaluation of Active Learning Methods in Deep Recommendation
A simple implementation of Reinforcement Learning using UCB in python.
Add a description, image, and links to the upper-confidence-bounds topic page so that developers can more easily learn about it.
To associate your repository with the upper-confidence-bounds topic, visit your repo's landing page and select "manage topics."