This is a python implementation of popular game Tic-Tac-Toe. I've used minmax algorithm to decide the moves of the bot player. The search tree is dynamically generated and we use Depth First Search for traversing through the tree.
ChetanKhanna/Tic-Tac-Toe
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
A simple implementation of Tic Tac Toe using maxmin algorithm
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published