Ultimate Tic Tac Toe
The purpose of this project is to create an optimal algorithm that solves the problem of beating an Ultimate-Tic-Tac-Toe Bot. It is a solution to our Algorithm Design Project's course.
Useful links:
This repository contains an efficient implementation of a BOT that solves the Ultimate Tic-Tac-Toe board game. The algoritm is based on a combination of Negamax and Monte Carlo techniques.
Java
The purpose of this project is to create an optimal algorithm that solves the problem of beating an Ultimate-Tic-Tac-Toe Bot. It is a solution to our Algorithm Design Project's course.
Useful links: