minimax-alpha-beta 0.2.0

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

# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html

[features]
default = ["tictactoe"]
tictactoe = []
chess = ["dep:shakmaty"]

[dependencies]
shakmaty = { version = "0.21.3", optional = true }
anyhow = { version = "1.0.59" }
clap = { version = "3.2.16", features = ["derive"]}

[profile.release]
lto = "fat"
debug = false

[[bin]]
name = "tic-tac-toe"
path = "src/main.rs"