BishBosh.Search.AlphaBeta

AUTHOR

Dr. Alistair Ward

DESCRIPTION

• Performs an https://chessprogramming.wikispaces.com/Alpha-Beta search, implemented using https://chessprogramming.wikispaces.com/Negamax.
• Moves are dynamically re-ordering using the killer-heuristic.
• https://chessprogramming.wikispaces.com/Repetitions & https://chessprogramming.wikispaces.com/Transpositions are detected.

Types

Type-synonyms

Data-types

Functions

extractSelectedTurns :: NPlies -> Result x y positionHash criterionValue weightedMean -> (DynamicMoveData x y positionHash, [Turn x y], NMoves)

• Remove any turns made before starting the search.
• N.B.: abandons the fitness of the game.

negaMax

Arguments

:: (Enum x, Enum y, Eq criterionValue, Num weightedMean, Ord weightedMean, Ord positionHash, Ord x, Ord y)

=> SearchDepth

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

-> SearchState x y positionHash criterionValue weightedMean

-> Reader (Result x y positionHash criterionValue weightedMean)

Implements a depth-first search (implemented as nega-max), with alpha-beta pruning.