For this task, you need to write two programs.

The firat program will implement the Minmax tree on the TIC TAC TOE Game. At the end, you need to display the total number of nodes expanded. Once the Minmax has trained, the user should be able to play a game againat your algorithm.

For the second program, implement the Alpha Beta Pruning technique to improve the first program. At the end display the total number of nodes expanded. Once this agent is trained, the user ahould be able to play a game against the agent.

Suggestions

Pay close attention to all specifications on this page. Even in cases where the program works correctly, points will be taken off for non$-$compliance with the instructions given on this page $($such as a different format for the program output, wrong compression format for the submitted code. and so on$).$ The reason is that non$-$compliance with the instructions makes the grading process aignificantly $($and unneceasarily$)$ more time$-$consuming.

Grading

The assignments will be graded out of $40$ points.

$-20$ points for the First Program. It should find the optimal path at all times with the correct number of states expanded.

$-20$ points for the Second Program. It ahould run faster and the number of states generated ahould be lower. It should also find the optimal path

$-$ Negative points: penalty points will be awarded by the instructor and TA generously and at will, for issues auch as: aubmisaion not including precise and acourate instructions for how to run the oode, wrong compresaion format for the submisaion, or other failures to comply with the instructions given for this asaignment. Partial oredit for incorrect aolutions will be given ONLY for code that is well$-$deaigned and well$-$documented. Code that is badly designed and badly documented can atill get full credit as long as it accomplishea the required taska.