int8/go-counterfactual-regret-minimization int8/go-counterfactual-regret-minimization

  • Stars
    star
    14
  • Rank 1,438,076 (Top 29 %)
  • Language
    Go
  • Created about 6 years ago
  • Updated almost 4 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
int8/go-counterfactual-regret-minimization
github

int8

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

Counterfactual regret minimization algorithm for various heads up poker games

More Repositories

1

monte-carlo-tree-search

Monte carlo tree search in python
Python
507
star
2

counterfactual-regret-minimization

Counterfactual regret minimization algorithm for Kuhn poker
Python
146
star
3

VAE_tensorflow

Variational autoencoder in Tensorflow
Python
63
star
4

gomcts

Monte carlo tree search in Go language
Go
26
star
5

chess-position-evaluation

Chess position evaluation using neural networks
Python
22
star
6

regret-matching

Simple implementation of regret matching algorithm for RPS nash equilibrium computation via self-play
Python
18
star
7

AutoencodersTensorFlow

Simple autoencoders for clustering in TensorFlow
Python
5
star
8

NeuralNetworks

The implementation of neural network with cross entropy error function for the problem of multi-label classification. Adam, Adadelta, SGD, Momentum optimizers included
Julia
5
star
9

Large-Spectral-Clustering

Large Scale Spectral Clustering with Landmark-Based Representation
Julia
1
star
10

Manacher-Algorithm-in-Scala

Scala implementation of Manacher Algorithm applied to the problem of calculating the number of palindromes in a string
Scala
1
star
11

chevy

Chess position Evaluation via hand-crafted features
Python
1
star
12

LogisticRegression

Julia implementation of Logistic Regression. It involves optimization of log-likelihood function using gradient descent method, basic evaluation metrics such as AUC has been implemented too.
Julia
1
star