An AI that plays Tic-Tac-Toe using the Minimax algorithm, ensuring it always wins or draws. Demonstrates optimal decision-making and game logic implementation.
-
Updated
Jul 28, 2024 - Python
An AI that plays Tic-Tac-Toe using the Minimax algorithm, ensuring it always wins or draws. Demonstrates optimal decision-making and game logic implementation.
Work-throughs of qiskit/pyquil quantum computing tutorials & exercises
Algorithms for computing or learning equilibria in multi-objective games
An algorithm to calculate all pure strategy Nash equilibria in multi-objective games with quasiconvex utility functions
Add a description, image, and links to the algorithmic-game-theory topic page so that developers can more easily learn about it.
To associate your repository with the algorithmic-game-theory topic, visit your repo's landing page and select "manage topics."