timpalpant / go-cfr

go-cfr implements several forms of Counter Factual Regret minimization in Golang

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

go-cfr

go-cfr is a package that implements several forms of Counterfactual Regret Minimization in Go. CFR can be used to solve for an approximate Nash Equilibrium in an imperfect information extensive-form game.

This project is a research library used to study different forms of CFR. For a similar alternative in C++/Python/Swift, see OpenSpiel.

No Maintenance Intended GoDoc Build Status Coverage Status Go Report Card

Usage

To use CFR, you must implement the extensive-form game tree for your game, by implementing the GameTreeNode interface.

An implementation of Kuhn Poker is included as an example.

package main

import (
	"fmt"

	"github.com/timpalpant/go-cfr"
	"github.com/timpalpant/go-cfr/kuhn"
	"github.com/timpalpant/go-cfr/tree"
)

func main() {
	poker := kuhn.NewGame()
	policy := cfr.NewPolicyTable(cfr.DiscountParams{})
	vanillaCFR := cfr.New(policy)
	nIter := 10000
	expectedValue := float32(0.0)
	for i := 1; i <= nIter; i++ {
		expectedValue += vanillaCFR.Run(poker)
	}

	expectedValue /= float32(nIter)
	fmt.Printf("Expected value is: %v\n", expectedValue)

	seen := make(map[string]struct{})
	tree.Visit(poker, func(node cfr.GameTreeNode) {
		if node.Type() != cfr.PlayerNodeType {
			return
		}

		key := node.InfoSet(node.Player()).Key()
		if _, ok := seen[string(key)]; ok {
			return
		}

		actionProbs := policy.GetPolicy(node).GetAverageStrategy()
		if actionProbs != nil {
			fmt.Printf("[player %d] %6s: check=%.2f bet=%.2f\n",
				node.Player(), key, actionProbs[0], actionProbs[1])
		}

		seen[string(key)] = struct{}{}
	})
}

Variants implemented

License

go-cfr is released under the GNU Lesser General Public License, Version 3.0.

About

go-cfr implements several forms of Counter Factual Regret minimization in Golang

License:GNU General Public License v3.0


Languages

Language:Go 95.0%Language:Assembly 5.0%