| Crates.io | connect-four-ai |
| lib.rs | connect-four-ai |
| version | 1.0.0 |
| created_at | 2025-08-09 01:10:33.117504+00 |
| updated_at | 2025-08-21 15:12:38.576838+00 |
| description | A high-performance Rust implementation of a perfect Connect Four solver. |
| homepage | https://github.com/benjaminrall/connect-four-ai |
| repository | https://github.com/benjaminrall/connect-four-ai |
| max_upload_size | |
| id | 1787468 |
| size | 1,243,020 |
A high-performance, perfect Connect Four solver written in Rust, with bindings for Python and WebAssembly.
This library can strongly solve any Connect Four position and determine the optimal move. For full details, performance benchmarks, and demos, please see the main GitHub Repository.
Perfect Solver: Implements an optimised negamax search, which utilises alpha-beta pruning and a transposition table to quickly converge on exact game outcomes.
AI Player: Features an AI player with configurable difficulty. It can play perfectly by always choosing the optimal move, or can simulate a range of skill levels by probabilistically selecting moves based on their scores.
Bitboard Representation: Uses a compact and efficient bitboard representation for game positions, allowing for fast move generation and evaluation.
Embedded Opening Book: Includes a pre-generated opening book of depth 8, which is embedded directly into the binary for instant lookups of early-game solutions.
Parallel Book Generator: A tool built with rayon for generating new, deeper
opening books.
Cross-Platform: Available as a Rust crate, Python package, and WebAssembly module for seamless integration into a wide range of projects.
This library can be added to a Cargo project by running the following command in your project directory:
cargo add connect-four-ai
or by adding the following line to your Cargo.toml:
connect-four-ai = "1.0.0"
This is a basic example of how to use the Solver to find the score of a position:
use connect_four_ai::{Solver, Position};
fn main() {
// Creates a position from a sequence of 1-indexed moves
let position = Position::from_moves("76461241141").unwrap();
// Initialises and uses the Solver to calculate the exact score of the position
let mut solver = Solver::new();
let score = solver.solve(&position);
println!("{score}"); // Output: -1
}
This project is licensed under the MIT License. See the LICENSE file for details.