pygambit.gambit.Game.get_strategy_unreachable#

Game.get_strategy_unreachable() list[History]#

Returns the Histories of the nodes that are not reachable by any pure strategy profile.

A node is considered reachable if there exists at least one pure strategy profile where the resulting path of play passes through it. In games with absent-mindedness, some nodes may be unreachable because any path to them requires conflicting choices at the same information set.

Added in version 17.0.0.

Raises:

UndefinedOperationError – If the game does not have a tree representation.