I used the MiniMax Algorithm with the Alpha-Beta Pruning Algorithm to calculate the best Tic Tac Toe moves. This is the follow-up version of my previous Tic Tac Toe AI.
Based on: https://www.cs.cornell.edu/courses/cs312/2002sp/lectures/rec21.htm
-
Notifications
You must be signed in to change notification settings - Fork 0
Lennart2001/Tic-Tac-Toe-AI
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
TicTacToe AI that utilizes the Minimax Algorithm and the Alpha Beta Pruning Algorithm to reduce Game-Tree searches.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published