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:
-
Notifications
You must be signed in to change notification settings - Fork 0
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.
cosmin-ionita/Ultimate-Tic-Tac-Toe
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
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 0
No packages published