Artificial Intelligence for Checkers written in C#
This AI implementation:
-
Recursively builds a game tree of n-plies, where n is specified by AI_MAXPLYLEVEL. (By default, this field has a value of 2).
-
Scores each move based on weighted criteria.
-
Sums the branch scores
-
Executes the move with the highest score.
This function recursively finds all valid moves on the given board with the selected checker. Follows standard checker rules for single and multi-piece captures and handles several edge cases (mainly infinite move loops).