Description: |
| Part of the final project for my algorithms class was to make a tic-tac-toe game that uses min-max and alpha-beta pruning as the intelligence for the computer. Throughout the semester, the professor had the class begin with a brute force method as the algorithm for the computer, then a simple recursive method, and finally the min-max and alpha-beta algorithms.
The purpose of the min-max algorithm is to generate a search tree based off of the current state of the board and simulate moves where each player plays the most optimal move. Then, the move associated with the branch with the most ideal outcome is chosen by the computer.
What really helped me understand the concept of min-max and alpha-beta was this website. Don't be overwhelmed by the size of the source code. There is a lot going on; however, the comments should provide enough separation between the various aspects of the program. |
Screenshots: |
 Screenshot 1 of 3 |
Source Code: |
 |
|
Downloaded 5 times |
Viewed 501 times |
