int8/chess-position-evaluation

Stars
22
Rank 1,048,934 (Top 21 %)
Language
Python
License
MIT License
Created almost 7 years ago
Updated over 2 years ago

int8/chess-position-evaluation

int8

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

Chess position evaluation using neural networks

monte-carlo-tree-search

Monte carlo tree search in python

counterfactual-regret-minimization

Counterfactual regret minimization algorithm for Kuhn poker

VAE_tensorflow

Variational autoencoder in Tensorflow

gomcts

Monte carlo tree search in Go language

regret-matching

Simple implementation of regret matching algorithm for RPS nash equilibrium computation via self-play

go-counterfactual-regret-minimization

Counterfactual regret minimization algorithm for various heads up poker games

AutoencodersTensorFlow

Simple autoencoders for clustering in TensorFlow

NeuralNetworks

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

Large-Spectral-Clustering

Large Scale Spectral Clustering with Landmark-Based Representation

Manacher-Algorithm-in-Scala

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

chevy

Chess position Evaluation via hand-crafted features

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.