csa

README

combinatorial-search-algoritms

Minimax search combinatorial algorithm variants:

• minimax
• minimax with alpha-beta prunning
• semi-parallel minimax

Please, feel free to pull request if you find a bug!

Documentation

Index

• func MinimaxInitScore(maximizing bool) int
• type SearchNode
  • func Minimax(node SearchNode, depth int, maximizing bool) (SearchNode, int)
  • func MinimaxAlphaBetaPrunning(node SearchNode, depth int, maximizing bool) (SearchNode, int)
  • func MinimaxConcurrent(node SearchNode, depth int, maximizing bool, workers int) (SearchNode, int)
• type SearchNodeGenerator

Functions

func MinimaxInitScore

func MinimaxInitScore(maximizing bool) int

Types

type SearchNode

type SearchNode interface {
	Score() int
	IsTerminal() bool
	SearchNodeGenerator() SearchNodeGenerator
}

func Minimax

func Minimax(node SearchNode, depth int, maximizing bool) (SearchNode, int)

func MinimaxAlphaBetaPrunning

func MinimaxAlphaBetaPrunning(node SearchNode, depth int, maximizing bool) (SearchNode, int)

func MinimaxConcurrent

func MinimaxConcurrent(node SearchNode, depth int, maximizing bool, workers int) (SearchNode, int)

type SearchNodeGenerator

type SearchNodeGenerator func(maximizing bool) SearchNode