An N ✕ N Tic Tac Toe game with an AI opponent build with minimax algorithm, α-β pruning, and a heuristic function. The bot looks four moves ahead to pick the next best move.
-
Updated
Oct 14, 2018 - TypeScript
#
depth-limit-search
Here is 1 public repository matching this topic...
Improve this page
Add a description, image, and links to the depth-limit-search topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the depth-limit-search topic, visit your repo's landing page and select "manage topics."