Safe Haskell | None |
---|---|
Language | Haskell2010 |
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, Num weightedMean, Ord weightedMean, Ord positionHash, Ord x, Ord y) => SearchDepth -> SearchState x y positionHash criterionValue weightedMean -> Reader (Result x y positionHash criterionValue weightedMean)
- calculateBranchingFactor :: Floating branchingFactor => Result x y positionHash criterionValue weightedMean -> branchingFactor
Types
Data-types
data Result x y positionHash criterionValue weightedMean Source #
The type returned by search
.
Instances
NFData weightedMean => NFData (Result x y positionHash criterionValue weightedMean) Source # | |
Defined in BishBosh.Search.Search | |
(Enum x, Enum y, Real criterionValue, Real weightedMean) => ShowNotationFloat (Result x y positionHash criterionValue weightedMean) Source # | |
Defined in BishBosh.Search.Search showsNotationFloat :: MoveNotation -> (Double -> ShowS) -> Result x y positionHash criterionValue weightedMean -> ShowS Source # |
Constants
showsSeparator :: ShowS Source #
Used to format output.
Functions
:: (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 Source #
Calculate the geometric-mean of the number of moves evaluated at each node.