The interesting thing of this project is the AI approach to the solution: MiniMax (in the negmax version) and alpha-beta pruning are used. As for the use you may select to play between humans or against computer (vs AI slider); select if computer plays first (AI first slider); choose the strategy adopted by AI (random, minimax and alpha-beta pruning) and, finally, the level (depth) of the search strategy.
Original project but for the revisitation of old lessons on AI. I had some problems with the 'break' statement of other programming languages. You can see the study in this other project: https://scratch.mit.edu/projects/134300617/
