A solver for Morris’s Variant D game using the minimax algorithm with optional alpha-beta pruning. This project is made generic enough that the solver could be applied to any game with two opposing sides and scorable moves with tokens.
arviceblot/MorrisVariantD
A solver for Morris's game with Variant D using a mini-max implementation.
C#