Safe Haskell	None
Language	Haskell2010

BishBosh.Search.Search

Contents

Description

AUTHOR: Dr. Alistair Ward
DESCRIPTION: Searches for the optimal move from those currently available.

Synopsis

data Result x y positionHash criterionValue weightedMean
showsSeparator :: ShowS
search :: (Enum x, Enum y, Eq criterionValue, Ord positionHash, Ord x, Ord y, Real weightedMean, Show x, Show y) => SearchDepth -> SearchState x y positionHash criterionValue weightedMean -> Reader (Result x y positionHash criterionValue weightedMean)

Types

Data-types

data Result x y positionHash criterionValue weightedMean Source #

The type returned by search.

Instances details

NFData weightedMean => NFData (Result x y positionHash criterionValue weightedMean) Source #
Instance details Defined in BishBosh.Search.Search Methods rnf :: Result x y positionHash criterionValue weightedMean -> () #
(Enum x, Enum y, Real criterionValue, Real weightedMean) => ShowNotationFloat (Result x y positionHash criterionValue weightedMean) Source #
Instance details Defined in BishBosh.Search.Search Methods showsNotationFloat :: MoveNotation -> (Double -> ShowS) -> Result x y positionHash criterionValue weightedMean -> ShowS Source #

Used to format output.

Arguments

:: (Enum x, Enum y, Eq criterionValue, Ord positionHash, Ord x, Ord y, Real weightedMean, Show x, Show 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.