You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Jan 8, 2020. It is now read-only.
Throughout my early reading on the subject of building a Tic-Tac-Toe Artificial Intelligence, it was demonstrated that a minimax algorithm was the optimal solution. For the purposes of completing this project in a limited amount of time,
I chose to follow Wikipedia's Perfect Strategy which seems rather procedural, manually-coded, unproven, and overall sub-optimal.
In the future, I believe the A.I. could benefit well from a proven algorithm. In addition, I believe the minimax algorithm assigns weights to various choices so it could potentially be used to allow players to choose from multiple difficulty levels.
Throughout my early reading on the subject of building a Tic-Tac-Toe Artificial Intelligence, it was demonstrated that a
minimax
algorithm was the optimal solution. For the purposes of completing this project in a limited amount of time,I chose to follow Wikipedia's Perfect Strategy which seems rather procedural, manually-coded, unproven, and overall sub-optimal.
In the future, I believe the A.I. could benefit well from a proven algorithm. In addition, I believe the
minimax
algorithm assigns weights to various choices so it could potentially be used to allow players to choose from multiple difficulty levels.Articles of Interest:
The text was updated successfully, but these errors were encountered: