BishBosh.ContextualNotation.QualifiedMoveForest

AUTHOR

Dr. Alistair Ward

DESCRIPTION

Builds a rose-tree from a PGN Database, each node of which contains a move qualified by a move-type, & possibly also the ultimate result & the game's identifier.

Types

Type-synonyms

type Name = String

Each game has a name.

type OnymousResult = (Name, Result)

The name of a game, & it's result.

Data-types

data QualifiedMoveForest

• A representation of a PGN-database, where initial moves shared between games are merged into the trunk of a tree from which they each branch.
• Many games will share standard opening moves, & a tree-structure (cf. a list) uses this to increase space-time efficiency.
• Since there are many different initial moves, the structure is a flat-topped forest rather than a single apex tree.

Instances

Eq QualifiedMoveForest

Defined in BishBosh.ContextualNotation.QualifiedMoveForest

Methods

(==) :: QualifiedMoveForest -> QualifiedMoveForest -> Bool

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

Show QualifiedMoveForest

Defined in BishBosh.ContextualNotation.QualifiedMoveForest

Methods

showsPrec :: Int -> QualifiedMoveForest -> ShowS

show :: QualifiedMoveForest -> String

showList :: [QualifiedMoveForest] -> ShowS

Empty QualifiedMoveForest

Defined in BishBosh.ContextualNotation.QualifiedMoveForest

Methods

empty :: QualifiedMoveForest

Null QualifiedMoveForest

Defined in BishBosh.ContextualNotation.QualifiedMoveForest

Methods

isNull :: QualifiedMoveForest -> Bool

ShowNotation QualifiedMoveForest

Defined in BishBosh.ContextualNotation.QualifiedMoveForest

Methods

showsNotation :: MoveNotation -> QualifiedMoveForest -> ShowS

Functions

showsNames

Arguments

:: Maybe NGames

The optional maximum number of names to show.

-> [Name]

-> ShowS

Shows an optional capped list of the names of archived games.

findMinimumPieces :: QualifiedMoveForest -> NPieces

• Find the minimum total number of pieces in any of the recorded games, in order to determining whether a sample game is too small to converge on anything in the tree.
• CAVEAT: no attempt is made to partition this total by logical colour, because there's no clear concept of the minimum amongst the pairs discovered at each leaf-node.
• N.B.: one call also measure other monotonically changing quantities (number of Pawns, number of Castleable Rooks, least advanced Pawn), but this is cheap.

count :: QualifiedMoveForest -> (NGames, NPositions)

Count the number of games & distinct positions.

Constructors

fromPGNDatabase :: PGNDatabase -> QualifiedMoveForest

Constructor.

toGameTree :: QualifiedMoveForest -> GameTree

• Convert the specified qualified-move forest to a game-tree.
• N.B.: to construct a tree from the specified forest, the default initial game is included at the apex.

Mutators

mergePGNDatabase :: PGNDatabase -> QualifiedMoveForest -> QualifiedMoveForest

Include the specified PGN-database into the forest, thus allowing more than one PGNDatabase to be read.