A command-line game with an invincible computer player using the Negamax algorithm with alpha-beta pruning. Clean code.
-
Updated
Jul 28, 2020 - Ruby
A command-line game with an invincible computer player using the Negamax algorithm with alpha-beta pruning. Clean code.
Just another javascript implementation of tic-tac-toe (paper-and-pencil) game and minimax algorithm
Minimax 알고리즘 체커 게임 MFC 구현 예제
Gomoku game and AI implementation using the alpha-beta prunning algorithm.
A text-based TicTacToe game that uses minimax algorithm with alpha-beta pruning to ensure the outcome is always either a win or a tie for the computer.
Whirlwind game made in Java
Play Tic-Tac-Toe against a reinforcement learning agent that just learned to play through temporal difference learning
Minimalistic Tic Tac Toe with multiplayer and play vs computer
CS50's TicTacToe.
Tic-tac-toe using the Minimax algorithm.
Tic-Tac-Toe game using a minimax algorithm where the computer never looses.
Completed assignments (except final projects) of CS50
star-lord: how many [possible futures] did you see? doctor strange: fourteen million, six hundred and five.
Uses bitboards for speed and alpha beta to search for best move
Add a description, image, and links to the minimax topic page so that developers can more easily learn about it.
To associate your repository with the minimax topic, visit your repo's landing page and select "manage topics."