1. Design and implement a Mini-Checkers game for a human to play against a computer. The game is played on a reduced game board size of 6 x 6 square.Implement the Alpha-Beta Search Algorithm. Every time your program calls the Alpha-Beta Search Function to determine the next best move, outputs the following statistics for the game (1) maximum depth of tree (let the root node be level 0), (2) total number of nodes generated (including root node) in the tree, and (3) number of times pruning occurred in the MAX-VALUE function and (4) number of times pruning occurred in the MIN-VALUE function.If your program cannot finish computing for a move within 15 seconds, then you should cutoff the search at certain depth level l and use an evaluation function to estimate the expected utility value for nodes at the cutoff level.
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"