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
showsSeparator :: ShowS
search :: (Enum x, Enum y, Ord positionHash, Ord x, Ord y, Show x, Show y) => NPlies -> SearchState x y positionHash -> Reader (Result x y positionHash)

Types

Data-types

data Result x y positionHash Source #

The type returned by search.

Instances details

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

Used to format output.

Arguments

:: (Enum x, Enum y, Ord positionHash, Ord x, Ord y, Show x, Show y)
=> NPlies	How deep down the tree to search.
-> SearchState x y positionHash
-> Reader (Result x y positionHash)

Initiates the recursive function negaMax, then unpacks the results.