Minimax alogrithm is an algorithm that is used in decision making to find the optimal move for a player in a game. In this case it is for tic tac toe. The agent finds searches the optimal move it needs to defeat the user or end the game in a draw.
-
Notifications
You must be signed in to change notification settings - Fork 0
Minimax alogrithm is an algorithm that is used in decision making to find the optimal move for a player in a game. In this case it is for tic tac toe. The agent finds searches the optimal move it needs to defeat the user or end the game in a draw.
Vangmay/Minimax-algorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Minimax alogrithm is an algorithm that is used in decision making to find the optimal move for a player in a game. In this case it is for tic tac toe. The agent finds searches the optimal move it needs to defeat the user or end the game in a draw.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published