ncpig 0.6.1

Non-Cooperative Perfect Information Games, and algorithms to play them.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19

//! All the important stuff.
//!
//! Use `use ncpig::prelude::*;` to get everything you need.

// mcts implementations need some petgraph stuff
pub use petgraph::graph::{Graph, Neighbors, NodeIndex};

pub use crate::competition::{Competition, CompetitionError, CompetitionStrategy};
pub use crate::game::{Action, Game, GameError, GeneralGameError, Heuristic, Player, State};
pub use crate::search::maxn::MaxN;
pub use crate::search::mcts::backpropagation::{AverageScore, Backpropagation, WinRate};
pub use crate::search::mcts::expansion::{Expansion, Greedy};
pub use crate::search::mcts::final_scorer::{NumVisits, PayoutValue};
pub use crate::search::mcts::playout::Playout;
pub use crate::search::mcts::selection::{Selection, UCT};
pub use crate::search::mcts::MonteCarloTreeSearch;
pub use crate::search::random::Random;
pub use crate::search::user_input::{FromUserInput, UserInput};
pub use crate::search::{SearchChoose, SearchError, SearchRank, SearchScore};