GitHub - tkhall03/Minimax-Tic-Tac-Toe-Alpha-Beta-Pruning: This is a Minimax algorithm that impliments Alpha-beta pruning to never loose at Tic Tac Toe. Though if you make a mistake it might beat you.

tkhall03 / Minimax-Tic-Tac-Toe-Alpha-Beta-Pruning Public

This is a Minimax algorithm that impliments Alpha-beta pruning to never loose at Tic Tac Toe. Though if you make a mistake it might beat you.

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 10 Commits
OpenSans-Regular.ttf		OpenSans-Regular.ttf
requirements.txt		requirements.txt
runner.py		runner.py
tictactoe.py		tictactoe.py

About

This is a Minimax algorithm that impliments Alpha-beta pruning to never loose at Tic Tac Toe. Though if you make a mistake it might beat you.

No releases published

No packages published