pygambit.gambit.InfosetIndexedVector#

class pygambit.gambit.InfosetIndexedVector#

A read-only mapping from an information set or event to a computed value, one entry per information set or event.

Since information sets don’t reliably have unique persistent labels, this is indexed by a Selector (an H-built expression) resolving to a single node belonging to the information set – resolved to the History of the information set’s canonical member before lookup, so any member node is an equally valid key – rather than by a label, unlike HistoryIndexedVector.

Each subclass holds entries of one kind only, and overrides _label_kind so that a failed lookup reports the kind it actually contains.

Added in version 17.0.0.

Methods