in-op/GameAI
Various C# implementations of game AI
This is a collection of C# implementations of classic game AI algorithms designed to help developers build intelligent opponents for two-player, zero-sum games like Chess or Tic-Tac-Toe. It takes in the current state of a game and, using algorithms like MiniMax or Monte-Carlo Tree Search, outputs the optimal next move for the AI player. Game developers working in C# would use this to add sophisticated AI to their games.
No commits in the last 6 months.
Use this if you are a C# game developer looking to integrate advanced AI decision-making into your turn-based, perfect-information games.
Not ideal if you are developing games that are not turn-based, have imperfect information (like poker), or if your project is not in C#.
Stars
93
Forks
22
Language
C#
License
MIT
Category
Last pushed
Aug 21, 2020
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/in-op/GameAI"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
Scriptim/Abalone-BoAI
A Python implementation of the board game Abalone intended to be played by artificial intelligence
arminkz/Reversi
Artificial intelligence of the Reversi / Othello
Zolomon/reversi-ai
A text based python implementation of the Reversi game with an artificial intelligence as opponent.
VelbazhdSoftwareLLC/IthakaBoardGame
Ithaka board game is played on a four by four square grid with three pieces in each of four colors.
danijelaskov/expectiminimax-backgammon
A 2D JavaFX implementation of one of the most popular and old board games. The AI player's moves...