BishBosh.Attribute.Rank

AUTHOR

Dr. Alistair Ward

DESCRIPTION

Defines the data-type which represents the rank of a chess-piece.

CAVEAT

This term is also commonly used to refer to a row of the board.

Type-classes

class Promotable a where

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

Methods

getMaybePromotionRank :: a -> Maybe Rank

Instances

Promotable MoveType

Defined in BishBosh.Attribute.MoveType

Methods

getMaybePromotionRank :: MoveType -> Maybe Rank

Promotable (ICCFNumeric x y)

Defined in BishBosh.Notation.ICCFNumeric

Methods

getMaybePromotionRank :: ICCFNumeric x y -> Maybe Rank

Promotable (Coordinate x y)

Defined in BishBosh.Notation.Coordinate

Methods

getMaybePromotionRank :: Coordinate x y -> Maybe Rank

Promotable (Smith x y)

Defined in BishBosh.Notation.Smith

Methods

getMaybePromotionRank :: Smith x y -> Maybe Rank

Types

Type-synonyms

type EvaluateRank rankValue = Rank -> rankValue

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

type ByRank = Array Rank

A boxed array indexed by rank, of arbitrary values.

Data-types

data Rank

The component of a chess-piece which is independent of its colour.

Constructors

Pawn

Rook

Knight

Bishop

Queen

King

Instances

Bounded Rank

Defined in BishBosh.Attribute.Rank

Methods

minBound :: Rank

maxBound :: Rank

Enum Rank

Defined in BishBosh.Attribute.Rank

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

Defined in BishBosh.Attribute.Rank

Methods

(==) :: Rank -> Rank -> Bool

(/=) :: Rank -> Rank -> Bool

Ord Rank

Defined in BishBosh.Attribute.Rank

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

Defined in BishBosh.Attribute.Rank

Methods

readsPrec :: Int -> ReadS Rank

readList :: ReadS [Rank]

readPrec :: ReadPrec Rank

readListPrec :: ReadPrec [Rank]

Show Rank

Defined in BishBosh.Attribute.Rank

Methods

showsPrec :: Int -> Rank -> ShowS

show :: Rank -> String

showList :: [Rank] -> ShowS

Ix Rank

Defined in BishBosh.Attribute.Rank

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

Defined in BishBosh.Attribute.Rank

Methods

rnf :: Rank -> ()

XmlPickler Rank

Defined in BishBosh.Attribute.Rank

Methods

xpickle :: PU Rank

Constants

tag :: String

Used to qualify XML.

flank :: [Rank]

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

promotionProspects :: [Rank]

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

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

plodders :: [Rank]

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

fixedAttackRange :: [Rank]

The subset of ranks which attack over a fixed range.

individuallySufficientMaterial :: [Rank]

The subset of ranks which lacking support, are sufficient to force checkmate.

pieces :: [Rank]

The distinct ranks of the pieces from which the back row is composed, i.e. everything except Pawns.

nobility :: [Rank]

The ordered ranks of the pieces from which the back row is composed, including duplicates.

range :: [Rank]

The constant ascending list of all ranks.

expendable :: [Rank]

Those ranks which can be taken.

nDistinctRanks :: NRanks

The constant number of distinct ranks.

Functions

compareByLVA :: Ord rankValue => EvaluateRank rankValue -> Rank -> Rank -> Ordering

• Given two alternative capture moves, this function compares the rank-value of the aggressors.
• N.B.: a King is always considered most valuable, regardless of the evaluation-function supplied.

Constructor

listArrayByRank :: IArray a e => [e] -> a Rank e

An array-constructor.