Play, learn, solve, and analyze No-Limit Texas Hold Em. Implementation follows from Monte Carlo counter-factual regret minimization over with hierarchical K-means imperfect recall abstractions.
MIT License
26
stars
1
forks
source link
impl Policy such that it encapsulates random choice #11
Policy { choices: Vec<[Action, Weight]> }