Safe Haskell | None |
---|---|
Language | Haskell2010 |
AUTHOR
- Dr. Alistair Ward
DESCRIPTION
- Defines the state of the game, without regard to how it arrived there; https://www.chessprogramming.org/Chess_Position.
- Games with the same position may be considered to have converged, since they now have equal opportunity.
- N.B.: pieces are fungible, i.e. they lack identity, so the location of identical pieces may be exchanged, without altering the position.
Synopsis
- data Position
- mkPosition :: LogicalColour -> MaybePieceByCoordinates -> CastleableRooksByLogicalColour -> Maybe Turn -> Position
Types
Data-types
The state of the game, without regard to how it arrived there.
Instances
Eq Position Source # | |
Ord Position Source # | |
Defined in BishBosh.State.Position | |
NFData Position Source # | |
Defined in BishBosh.State.Position | |
ReflectableOnX Position Source # | |
Defined in BishBosh.State.Position reflectOnX :: Position -> Position Source # | |
Hashable Position Source # | |
Defined in BishBosh.State.Position listRandoms :: Position -> Zobrist positionHash -> [positionHash] Source # |
Functions
Constructors
:: LogicalColour | The logical colour of the next player to move. |
-> MaybePieceByCoordinates | |
-> CastleableRooksByLogicalColour | |
-> Maybe Turn | The last turn made. |
-> Position |
Constructor.