Desktop Reversi game made in Kotlin and Swing. The project focuses on implementing and exploring AI algorithms for zero-sum games, including MinMax, Alpha-Beta pruning, and various heuristics.
-
Updated
Jun 9, 2017 - Kotlin
Desktop Reversi game made in Kotlin and Swing. The project focuses on implementing and exploring AI algorithms for zero-sum games, including MinMax, Alpha-Beta pruning, and various heuristics.
Some applications of optimization using linear, binary, and integer programming.
A tic tac toe game with an AI that you just can't beat
my favorite projects
A minimax algorithm to solve a two-player connection board game
Psychopy implementation of the article : "Neural computations underpinning the strategic management of influence in advice giving" by Uri Hertz & BB
Simulating the game theory behind Linaia-Agon by Iannis Xenakis
Demonstration of the concept of convergence for the Fictitious Play algorithm, simulating a simple zero-sum game over multiple iterations.
A 2D JavaFX implementation of one of the most popular and old board games. The AI player's moves are calculated using the expectiminimax algorithm.
A custom MARL (multi-agent reinforcement learning) environment where multiple agents trade against one another (self-play) in a zero-sum continuous double auction. Ray [RLlib] is used for training.
Add a description, image, and links to the zero-sum topic page so that developers can more easily learn about it.
To associate your repository with the zero-sum topic, visit your repo's landing page and select "manage topics."