Safe Haskell	None
Language	Haskell2010

BishBosh.Attribute.Rank

Contents

Type-classes
Types
- Type-synonyms
- Data-types
Constants
Functions
- Constructor

Description

AUTHOR: Dr. Alistair Ward
DESCRIPTION: Defines the data-type which represents the rank of a chess-piece; cf. a row of the board.

Synopsis

Type-classes

class Promotable a where Source #

An interface to which data which can represent Pawn-promotion, can implement.

Minimal complete definition

getMaybePromotionRank

Methods

getMaybePromotionRank :: a -> Maybe Rank Source #

Instances

Promotable MoveType Source #
Methods getMaybePromotionRank :: MoveType -> Maybe Rank Source #
Promotable (ICCFNumeric x y) Source #
Methods getMaybePromotionRank :: ICCFNumeric x y -> Maybe Rank Source #
Promotable (Coordinate x y) Source #
Methods getMaybePromotionRank :: Coordinate x y -> Maybe Rank Source #
Promotable (Smith x y) Source #
Methods getMaybePromotionRank :: Smith x y -> Maybe Rank Source #

Types

Type-synonyms

type EvaluateRank rankValue = Rank -> rankValue Source #

The type of a function which returns a Rank's value.

type ByRank = Array Rank Source #

A boxed array indexed by rank, of arbitrary values.

Data-types

data Rank Source #

That part of the difference between chess-pieces which is independent of their logical colour.

Constructors

Pawn
Rook
Knight
Bishop
Queen
King

Instances

Bounded Rank Source #
Methods minBound :: Rank # maxBound :: Rank #
Enum Rank Source #
Methods succ :: Rank -> Rank # pred :: Rank -> Rank # toEnum :: Int -> Rank # fromEnum :: Rank -> Int # enumFrom :: Rank -> [Rank] # enumFromThen :: Rank -> Rank -> [Rank] # enumFromTo :: Rank -> Rank -> [Rank] # enumFromThenTo :: Rank -> Rank -> Rank -> [Rank] #
Eq Rank Source #
Methods (==) :: Rank -> Rank -> Bool # (/=) :: Rank -> Rank -> Bool #
Ord Rank Source #
Methods compare :: Rank -> Rank -> Ordering # (<) :: Rank -> Rank -> Bool # (<=) :: Rank -> Rank -> Bool # (>) :: Rank -> Rank -> Bool # (>=) :: Rank -> Rank -> Bool # max :: Rank -> Rank -> Rank # min :: Rank -> Rank -> Rank #
Read Rank Source #
Methods readsPrec :: Int -> ReadS Rank # readList :: ReadS [Rank] # readPrec :: ReadPrec Rank # readListPrec :: ReadPrec [Rank] #
Show Rank Source #
Methods showsPrec :: Int -> Rank -> ShowS # show :: Rank -> String # showList :: [Rank] -> ShowS #
Ix Rank Source #
Methods range :: (Rank, Rank) -> [Rank] # index :: (Rank, Rank) -> Rank -> Int # unsafeIndex :: (Rank, Rank) -> Rank -> Int inRange :: (Rank, Rank) -> Rank -> Bool # rangeSize :: (Rank, Rank) -> Int # unsafeRangeSize :: (Rank, Rank) -> Int
NFData Rank Source #
Methods rnf :: Rank -> () #
XmlPickler Rank Source #
Methods xpickle :: PU Rank #

Constants

tag :: String Source #

Used to qualify XML.

flank :: [Rank] Source #

The distinct ranks of the constant ordered range of those pieces of which each side has two.

promotionProspects :: [Rank] Source #

The constant list of distinct rank to which a Pawn may legally be promoted; though there's no point in promotion to other than Queen or Knight.

defaultPromotionRank :: Rank Source #

Constant rank to which a Pawn is, in the absence of instruction, promoted.

plodders :: [Rank] Source #

The subset of ranks which can only move in single steps.

fixedAttackRange :: [Rank] Source #

The subset of ranks which attack over a fixed range.

individuallySufficientMaterial :: [Rank] Source #

The subset of ranks which (unsupported) are sufficient to force checkmate.

pieces :: [Rank] Source #

A subset of ranks, which excludes Pawn .

nobility :: [Rank] Source #

The ranks of the constant ordered back row of pieces, including duplicates.