BishBosh.Search.Search

AUTHOR

Dr. Alistair Ward

DESCRIPTION

Searches for the optimal move from those currently available.

Types

Data-types

data Result x y positionHash criterionValue weightedMean

The type returned by search.

Instances

NFData weightedMean => NFData (Result x y positionHash criterionValue weightedMean)

Methods

rnf :: Result x y positionHash criterionValue weightedMean -> ()

(Enum x, Enum y, Real criterionValue, Real weightedMean) => ShowNotationFloat (Result x y positionHash criterionValue weightedMean)

Methods

showsNotationFloat :: MoveNotation -> (Double -> ShowS) -> Result x y positionHash criterionValue weightedMean -> ShowS

Constants

showsSeparator :: ShowS

Used to format output.

Functions

search

Arguments

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

=> SearchDepth

How deep down the tree to search.

-> SearchState x y positionHash criterionValue weightedMean

-> Reader (Result x y positionHash criterionValue weightedMean)

Initiates the recursive function negaMax, then unpacks the results.

calculateBranchingFactor :: Floating branchingFactor => Result x y positionHash criterionValue weightedMean -> branchingFactor

Calculate the geometric-mean of the number of moves evaluated at each node.