robopoker 0.1.1

Implementations of Meta's Pluribus No-Limit Texas Hold-Em solution.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51

use crate::mccfr::bucket::Bucket;
use crate::mccfr::edge::Edge;
use crate::mccfr::info::Info;
use crate::mccfr::node::Node;
use petgraph::graph::DiGraph;
use petgraph::graph::NodeIndex;
use std::collections::BTreeMap;
use std::ptr::NonNull;

/// trees
pub struct Tree {
    graph: Box<DiGraph<Node, Edge>>,
    infos: BTreeMap<Bucket, Info>,
}

impl Tree {
    pub fn empty() -> Self {
        let infos = BTreeMap::new();
        let graph = Box::new(DiGraph::with_capacity(0, 0));
        Self { infos, graph }
    }
    pub fn infosets(&self) -> Vec<Info> {
        self.infos.values().cloned().collect()
    }
    pub fn witness(&mut self, node: &Node) {
        let index = node.index();
        let bucket = node.bucket();
        if let Some(infoset) = self.infos.get_mut(bucket) {
            infoset.add(index);
        } else {
            let graph = self.graph_raw();
            let infoset = Info::from((index, graph));
            self.infos.insert(bucket.clone(), infoset);
        }
    }

    pub fn node(&self, head: NodeIndex) -> &Node {
        self.graph_ref()
            .node_weight(head)
            .expect("being spawned safely in recursion")
    }
    pub fn graph_raw(&self) -> NonNull<DiGraph<Node, Edge>> {
        NonNull::from(self.graph.as_ref())
    }
    pub fn graph_ref(&self) -> &DiGraph<Node, Edge> {
        self.graph.as_ref()
    }
    pub fn graph_mut(&mut self) -> &mut DiGraph<Node, Edge> {
        self.graph.as_mut()
    }
}