Implementation of adversarial search by the Minimax algorithm and α-β pruning to play (m, n, k)-games. An (m, n, k)-game is a board game in which two players take turns in placing X's and O's on an m × n board, the winner being the player who first gets 'k' Xs (resp. Os) in a row, horizontally, vertically, or diagonally. Thus, tic-tac-toe is the (3, 3, 3)-game. More information can be found at https://en.wikipedia.org/wiki/M,n,k-game
forked from ollebompa/Adverserial-Search-on-m-n-k-games
-
Notifications
You must be signed in to change notification settings - Fork 0
Implementation of adversarial search by the Minimax algorithm and α-β pruning to play (m, n, k)-games. An (m, n, k)-game is a board game in which two players take turns in placing X's and O's on an m × n board, the winner being the player who first gets 'k' Xs (resp. Os) in a row, horizontally, vertically, or diagonally. Thus, tic-tac-toe is the
PBozmarov/Adverserial-Search-on-m-n-k-games
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Implementation of adversarial search by the Minimax algorithm and α-β pruning to play (m, n, k)-games. An (m, n, k)-game is a board game in which two players take turns in placing X's and O's on an m × n board, the winner being the player who first gets 'k' Xs (resp. Os) in a row, horizontally, vertically, or diagonally. Thus, tic-tac-toe is the
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published
Languages
- Python 100.0%