minimax-alpha-beta 0.1.1

An implementation of Alpha-Beta Pruning + Minimax Algorithm for arbitrary two player minimax style games like Chess, Go, TicTacToe, etc.
Documentation
[dependencies]

[package]
authors = ["Aalekh Patel <aalekh.gwpeck.7998@icloud.com>"]
categories = ["algorithms", "mathematics"]
description = "An implementation of Alpha-Beta Pruning + Minimax Algorithm for arbitrary two player minimax style games like Chess, Go, TicTacToe, etc."
documentation = "https://www.github.com/aalekhpatel07/minimax"
edition = "2018"
homepage = "https://www.github.com/aalekhpatel07/minimax"
keywords = ["game", "game-ai", "Minimax", "alpha-beta-pruning", "efficient-minimax"]
license = "MIT"
name = "minimax-alpha-beta"
readme = "README.md"
repository = "https://www.github.com/aalekhpatel07/minimax.git"
version = "0.1.1"