| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
BishBosh.Search.Search
Description
AUTHOR- Dr. Alistair Ward
DESCRIPTION- Searches for the optimal move from those currently available.
Synopsis
- data Result positionHash
- showsSeparator :: ShowS
- search :: Ord positionHash => NPlies -> SearchState positionHash -> Reader (Result positionHash)
Types
Data-types
data Result positionHash Source #
The type returned by search.
Instances
| NFData (Result positionHash) Source # | |
Defined in BishBosh.Search.Search | |
| ShowNotationFloat (Result positionHash) Source # | |
Defined in BishBosh.Search.Search Methods showsNotationFloat :: MoveNotation -> (Double -> ShowS) -> Result positionHash -> ShowS Source # | |
Constants
showsSeparator :: ShowS Source #
Used to format output.
Functions
Arguments
| :: Ord positionHash | |
| => NPlies | How deep down the tree to search. |
| -> SearchState positionHash | |
| -> Reader (Result positionHash) |
Initiates the recursive function negaMax, then unpacks the results.