MinMax is a method of minimizing the maximum possible loss of either player in any board game. In this case, the game will be a Tic Tac Toe game and the players will be a human player and the computer itself driven by the MinMax algorithm.
-
Notifications
You must be signed in to change notification settings - Fork 0
MinMax is a method of minimizing the maximum possible loss of either player in any board game. In this case, the game will be a Tic Tac Toe game and the players will be a human player and the computer itself driven by the MinMax algorithm.
andrepaulodantas/artificial-intelligence-MIN-MAX
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
MinMax is a method of minimizing the maximum possible loss of either player in any board game. In this case, the game will be a Tic Tac Toe game and the players will be a human player and the computer itself driven by the MinMax algorithm.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published