#Ultimate Tic Tac Toe

##The Game and Rules

The game is a modification of the classic Tic-Tac-Toe which if played optimally always ends in a tie game.
The basic modification is that the playing grid is now a 3x3 grid which contains a mini-3x3 grid inside each cell.
A cell is claimed by a player as his if he wins the mini-3x3 grid contained in it. But the cell in which a player can play is not decided by him, but by the move his opponent makes.
This makes the game upredictable and complicated. A detailed description of the complicated rules is available on http://mathwithbaddrawings.com/2013/06/16/ultimate-tic-tac-toe/.

##Tools used

Game is built using pygame module in python mainly, with AI program written in C for more accurate move decision.

##Requirements and Tests

Tested to work on Fedora 20-64 bit and 32 bit machines.
You will require python,gcc commands and pygame,sys modules for python to run this game.

##Play Our AI

Once you have managed to understand the rules and decide to play versus the computer just clone the repository and execute the game.py file.

##About the AI

It implements a Monte Carlo algorithm which runs multiple games and based on outcomes/data decides the move to make.

##Performance of the AI

Submission of the AI on hackerrank saw us reach 6th on the Leaderboard.
For more:https://www.hackerrank.com/challenges/ultimate-ttt (Submitted by 'vaishious')

For an alternate AI try out the minimax branch of the repository.
This AI uses a Minimax algorithm coupled with Alpha-Beta Pruning to find the best path to take in the current game tree.