alphabeta

Documentation

Overview

Package alphabeta implements an endgame solver using depth-limited minimax with alpha-beta pruning.

Index

• Constants
• Variables
• type GameNode
  • func (g *GameNode) Copy() *GameNode
  • func (g *GameNode) CopyFrom(o *GameNode)
  • func (g *GameNode) GetDepth() uint8
  • func (g *GameNode) Parent() *GameNode
  • func (g *GameNode) String() string
• type Solver
  • func (s *Solver) Init(m1 movegen.MoveGenerator, m2 movegen.MoveGenerator, game *game.Game, ...) error
  • func (s *Solver) RootNode() *GameNode
  • func (s *Solver) SetComplexEvaluator(i bool)
  • func (s *Solver) SetIterativeDeepening(i bool)
  • func (s *Solver) SetPruningDisabled(i bool)
  • func (s *Solver) Solve(ctx context.Context, plies int) (float32, []*move.Move, error)

Constants

const (
	// Infinity is 10 million.
	Infinity = 10000000
	// TwoPlyOppSearchLimit is how many plays to consider for opponent
	// for the evaluation function.
	TwoPlyOppSearchLimit = 50
	// FutureAdjustment potentially weighs the value of future points
	// less than present points, to allow for the possibility of being
	// blocked. We just make it 1 because our 2-ply evaluation function
	// is reasonably accurate.
	FutureAdjustment = float32(1)
)

const PerTurnPenalty = float32(0.001)

Variables

var ErrNoEndgameSolution = errors.New("no endgame solution found")

Types

type GameNode

type GameNode struct {
	// contains filtered or unexported fields
}

a game node has to have enough information to allow the game and turns to be reconstructed.

func (*GameNode) Copy

func (g *GameNode) Copy() *GameNode

func (*GameNode) CopyFrom

func (g *GameNode) CopyFrom(o *GameNode)

func (*GameNode) GetDepth

func (g *GameNode) GetDepth() uint8

func (*GameNode) Parent

func (g *GameNode) Parent() *GameNode

func (*GameNode) String

func (g *GameNode) String() string

type Solver

type Solver struct {
	// contains filtered or unexported fields
}

Solver implements the minimax + alphabeta algorithm.

func (*Solver) Init

func (s *Solver) Init(m1 movegen.MoveGenerator, m2 movegen.MoveGenerator, game *game.Game, cfg *config.Config) error

Init initializes the solver

func (*Solver) RootNode

func (s *Solver) RootNode() *GameNode

func (*Solver) SetComplexEvaluator

func (s *Solver) SetComplexEvaluator(i bool)

func (*Solver) SetIterativeDeepening

func (s *Solver) SetIterativeDeepening(i bool)

func (*Solver) SetPruningDisabled

func (s *Solver) SetPruningDisabled(i bool)

func (*Solver) Solve

func (s *Solver) Solve(ctx context.Context, plies int) (float32, []*move.Move, error)

Solve solves the endgame given the current state of s.game, for the current player whose turn it is in that state.