Safe Haskell | None |
---|---|
Language | Haskell2010 |
AUTHOR
- Dr. Alistair Ward
DESCRIPTION
- Searches for the optimal move from those currently available.
Types
Data-types
data Result x y positionHash Source #
The type returned by search
.
Instances
NFData (Result x y positionHash) Source # | |
Defined in BishBosh.Search.Search | |
(Enum x, Enum y) => ShowNotationFloat (Result x y positionHash) Source # | |
Defined in BishBosh.Search.Search showsNotationFloat :: MoveNotation -> (Double -> ShowS) -> Result x y positionHash -> ShowS Source # |
Constants
showsSeparator :: ShowS Source #
Used to format output.
Functions
:: (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.