Safe Haskell	None
Language	Haskell2010

BishBosh.State.Position

Contents

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

Types

Data-types

The state of the game, without regard to how it arrived there.

Instances details

Eq Position Source #
Instance details Defined in BishBosh.State.Position Methods (==) :: Position -> Position -> Bool # (/=) :: Position -> Position -> Bool #
Ord Position Source #
Instance details Defined in BishBosh.State.Position Methods compare :: Position -> Position -> Ordering # (<) :: Position -> Position -> Bool # (<=) :: Position -> Position -> Bool # (>) :: Position -> Position -> Bool # (>=) :: Position -> Position -> Bool # max :: Position -> Position -> Position # min :: Position -> Position -> Position #
NFData Position Source #
Instance details Defined in BishBosh.State.Position Methods rnf :: Position -> () #
ReflectableOnX Position Source #
Instance details Defined in BishBosh.State.Position Methods reflectOnX :: Position -> Position Source #
Hashable Position Source #
Instance details Defined in BishBosh.State.Position Methods listRandoms :: Zobrist positionHash -> Position -> [positionHash] Source #

Arguments

:: LogicalColour	The logical colour of the next player to move.
-> MaybePieceByCoordinates
-> CastleableRooksByLogicalColour
-> Maybe Turn	The last turn made.
-> Position

Constructor.