An AI hexapawn game solver built with Python.
- Implemented MiniMax search with Alpha–beta pruning algorithm to predict the best next move based on how many moves ahead the user is to look ahead.
- Built components to teach the program how to play hexapawn and generate next move to analyze.
- Developed a static board evaluator to estimate the heuristic value of the moves.
GitHub - claud32/Hexapawn-Game-Solver: A Python hexapawn game solver
A Python hexapawn game solver. Contribute to claud32/Hexapawn-Game-Solver development by creating an account on GitHub.
claud32