Working MCTS implementation

This is a basic working implementation of the MCTS algorithm. Though
currently the algorithm is slow compared with other implemenations, and
makes sub-optimal choices when playing tic-tac-toe. Therefore some
modifications are needed

src/lib.rs

@@ -0,0 +1,17 @@
+//! # rustic_mcts
+//!
+//! An extensible implementation of Monte Carlo Tree Search (MCTS) using arena allocation and
+//! configurable policies.
+
+pub mod config;
+pub mod mcts;
+pub mod policy;
+pub mod state;
+pub mod tree;
+
+pub use config::MCTSConfig;
+pub use mcts::MCTS;
+pub use state::Action;
+pub use state::GameState;
+pub use state::Player;
+pub use tree::node::RewardVal;