Skip to content

cosmin-ionita/Ultimate-Tic-Tac-Toe

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

61 Commits
 
 
 
 
 
 

Repository files navigation

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:

The AI Games Rules

About

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.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages