bishbosh-0.1.4.0: Plays chess.
Safe HaskellNone
LanguageHaskell2010

BishBosh.Search.AlphaBeta

Description

AUTHOR
Dr. Alistair Ward
DESCRIPTION
Synopsis

Types

Type-synonyms

Data-types

Functions

extractSelectedTurns :: NPlies -> Result positionHash -> (DynamicMoveData positionHash, [Turn], NPositions) Source #

  • Drop the specified number of plies; typically those made before starting the search.
  • CAVEAT: abandons the fitness component of the quantified game.

negaMax Source #

Arguments

:: Ord positionHash 
=> NPlies

The depth to which the tree should be searched; i.e. the number of plies to look-ahead.

-> SearchState positionHash 
-> Reader (Result positionHash) 
  • Implements a depth-first search (implemented as nega-max), with alpha-beta pruning.
  • alpha is the minimum fitness of which the maximising player is assured.
  • beta is the maximum fitness which the minimising player will tolerate.