Safe Haskell | None |
---|---|
Language | Haskell2010 |
AUTHOR
- Dr. Alistair Ward
DESCRIPTION
- Quantifies a game, & therefore the sequence of moves applied.
- The fitness & its breakdown into constituent criterion-values, are also recorded.
Synopsis
- type OpenInterval x y = (Maybe (QuantifiedGame x y), Maybe (QuantifiedGame x y))
- data QuantifiedGame x y
- unboundedInterval :: OpenInterval x y
- compareFitness :: QuantifiedGame x y -> QuantifiedGame x y -> Ordering
- getFitness :: QuantifiedGame x y -> WeightedMean
- fromGame :: (Enum x, Enum y, Fractional pieceSquareValue, Ord x, Ord y, Real pieceSquareValue, Show x, Show y) => Maybe pieceSquareValue -> Game x y -> Reader pieceSquareValue x y (QuantifiedGame x y)
- getLastTurn :: QuantifiedGame x y -> Turn x y
- getLatestTurns :: NPlies -> QuantifiedGame x y -> [Turn x y]
- negateFitness :: QuantifiedGame x y -> QuantifiedGame x y
- negateInterval :: OpenInterval x y -> OpenInterval x y
Types
Type-synonyms
type OpenInterval x y = (Maybe (QuantifiedGame x y), Maybe (QuantifiedGame x y)) Source #
- The open interval in which to search for better solutions.
- N.B.:
Nothing
is interpreted as unbounded.
Data-types
data QuantifiedGame x y Source #
The selected game & the criteria against which it was quantified.
Instances
(Enum x, Enum y, Ord x, Ord y) => Eq (QuantifiedGame x y) Source # | |
Defined in BishBosh.Evaluation.QuantifiedGame (==) :: QuantifiedGame x y -> QuantifiedGame x y -> Bool # (/=) :: QuantifiedGame x y -> QuantifiedGame x y -> Bool # | |
(Enum x, Enum y, Ord x, Ord y, Show x, Show y) => Show (QuantifiedGame x y) Source # | |
Defined in BishBosh.Evaluation.QuantifiedGame showsPrec :: Int -> QuantifiedGame x y -> ShowS # show :: QuantifiedGame x y -> String # showList :: [QuantifiedGame x y] -> ShowS # | |
NFData (QuantifiedGame x y) Source # | |
Defined in BishBosh.Evaluation.QuantifiedGame rnf :: QuantifiedGame x y -> () # | |
Null (QuantifiedGame x y) Source # | |
Defined in BishBosh.Evaluation.QuantifiedGame isNull :: QuantifiedGame x y -> Bool Source # | |
(Enum x, Enum y) => ShowNotationFloat (QuantifiedGame x y) Source # | |
Defined in BishBosh.Evaluation.QuantifiedGame showsNotationFloat :: MoveNotation -> (Double -> ShowS) -> QuantifiedGame x y -> ShowS Source # |
Constants
unboundedInterval :: OpenInterval x y Source #
Constant.
Functions
compareFitness :: QuantifiedGame x y -> QuantifiedGame x y -> Ordering Source #
Compares fitness.
Accessors
getFitness :: QuantifiedGame x y -> WeightedMean Source #
Accessor.
Constructors
:: (Enum x, Enum y, Fractional pieceSquareValue, Ord x, Ord y, Real pieceSquareValue, Show x, Show y) | |
=> Maybe pieceSquareValue | The value for the specified game. |
-> Game x y | The current state of the game. |
-> Reader pieceSquareValue x y (QuantifiedGame x y) |
Constructor.
Accessors
getLastTurn :: QuantifiedGame x y -> Turn x y Source #
Retrieve the turn used to generate the selected game.
:: NPlies | The number of plies to drop from the start of the chronological sequence. |
-> QuantifiedGame x y | |
-> [Turn x y] |
Drop the specified number of plies from the start of the chronological sequence, leaving the most recent.
Mutators
negateFitness :: QuantifiedGame x y -> QuantifiedGame x y Source #
Represent the fitness of the game resulting from a future move by the opponent, from the perspective of the current player.
negateInterval :: OpenInterval x y -> OpenInterval x y Source #
Reflect the interval about zero.