Adversarial AI Agent (MiniChess)
Published:
Keywords: Artificial Intelligence, Search Algorithms, Game Theory
Technical Details
Built a competitive AI agent capable of playing a simplified version of Chess against human or AI opponents.
- Core Algorithms: Implemented Minimax search with Alpha-Beta pruning to optimize decision trees and reduce computation time.
- Heuristics: Designed custom heuristic evaluation functions to estimate board advantages in mid-game states.
- Optimization: Tuned search depth and evaluation metrics to balance move quality with strict time constraints.