A strategic game implemented in the α-β-pruning or beam search scheme based on a function assessing the game state.
-
Updated
Sep 14, 2024 - C#
A strategic game implemented in the α-β-pruning or beam search scheme based on a function assessing the game state.
An implementation of the classic Nim game featuring an AI opponent trained using Q-learning reinforcement learning. Players take turns removing items from piles, with the last player to remove an item losing. The AI learns optimal strategies through self-play and provides a challenging opponent for human players.
an implementation of the famous tic-tac-toe game
A console-based Nim client written in Pascal featuring multiplayer and computer opponent.
Add a description, image, and links to the ai-opponent topic page so that developers can more easily learn about it.
To associate your repository with the ai-opponent topic, visit your repo's landing page and select "manage topics."