Skip to content
This repository has been archived by the owner on Jan 8, 2020. It is now read-only.

Re-Implement A.I. using minimax algorithm #13

Open
kurtismullins opened this issue Nov 20, 2013 · 0 comments
Open

Re-Implement A.I. using minimax algorithm #13

kurtismullins opened this issue Nov 20, 2013 · 0 comments
Assignees

Comments

@kurtismullins
Copy link
Owner

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:

@ghost ghost assigned kurtismullins Nov 20, 2013
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Projects
None yet
Development

No branches or pull requests

1 participant