AbstractAbstractaddAbstractaddCreate a new variation that can be played instead of the current move.
OptionalisLongVariation: booleanfalse by default.
AbstractclearRemove all the NAGs from the current node or variation.
AbstractclearRemove all the key-value tag pairs from the the current node or variation.
AbstractNode.tags for more details on tags.
AbstractcommentGet the text comment (if any) associated to the current node or variation.
Set the text comment associated to the current node or variation.
If undefined, the existing value (if any) is erased.
OptionalisLongComment: booleanfalse by default.
AbstractfenFEN representation of the chess position after the current move.
The fifty-move clock and full-move number are set according to the underlying game in the string returned by this method.
AbstractfiftyNumber of half-moves since the last pawn move or capture, after the current move.
AbstractfigurineSAN-like representation of the move
associated to the current node (or '--' for a null-move).
Here, chess pieces are represented with their respective unicode character, instead of the first letter of their English name.
AbstractfilterRemove from the the current node or variation the NAGs
for which the given filter evaluates to false (and keep those for which it evaluates to true).
AbstractfilterRemove from the the current node or variation the key-value tag pairs for which the given filter evaluates to false
(and keep those for which it evaluates to true).
AbstractNode.tags for more details on tags.
AbstractfollowingIdentifier of the Node that arise after playing distance moves starting from the current Node or Variation.
REMARK: the ID returned by this method may not correspond to an existing Node if the underlying variation is not long enough. Still, in that case, the returned ID is always properly formed, and could correspond to a valid node later if the variation is extended.
If distance is 0, this method returns the same result as AbstractNode.id.
Must be a positive integer.
AbstractfullFull-move number. It starts at 1 (by default), and is incremented after each black move.
AbstracthasCheck whether the current node or variation has the given NAG or not.
AbstractidAbstractisWhether the text comment associated to the current node or variation is long or short.
false if no comment is defined.
AbstractmoveColor of the player who plays the current move.
AbstractnagsAbstractnextAbstractnotationSAN representation of the move
associated to the current node (or '--' for a null-move).
AbstractparentAbstractplayCreate a new node representing the given move, and append it to the current node or variation.
If there are some pre-existing subsequent nodes, they are all erased.
SAN representation of the move, or '--' for a null-move.
The newly created Node.
exception.InvalidNotation if the move notation cannot be parsed, or if the parsed move would correspond to an illegal move.
AbstractpositionChess position obtained after the current move.
AbstractpositionChess position before the current move.
AbstractpreviousAbstractpromoteReplace the move on the current node (and the following ones, if any) by the moves of the variation corresponding to the given index, and create a new variation with the move on the current node and its successors.
WARNING: the promoted variation must NOT be empty (otherwise an exception is thrown).
Index of the variation to promote (must be such that 0 <= variationIndex < thisNode.variations().length).
AbstractremoveAbstractremoveAbstractremoveErase all the moves before the one on the current Node: after that, Node.parentVariation returns the main variation of the parent Game, and the current node is the first node of this variation.
This method modifies the initial position and initial full-move number of the parent Game.
AbstractremoveRemove the variation corresponding to the given index.
Index of the variation to remove (must be such that 0 <= variationIndex < thisNode.variations().length).
AbstractswapChange the order of the variations by swapping the two variations corresponding to the given indexes.
Index of one variation to swap (must be such that 0 <= variationIndex1 < thisNode.variations().length).
Index of the other variation to swap (must be such that 0 <= variationIndex2 < thisNode.variations().length).
AbstracttagGet the value associated to the given tag key on the current node or variation.
AbstractNode.tags for more details on tags.
Set the value associated to the given tag key on the current node or variation.
If undefined, the existing value (if any) is erased.
AbstractNode.tags for more details on tags.
AbstracttagsReturn the keys of the tags associated to the current node or variation.
The tag mechanism is a key-value associative container allowing to store some arbitrary data
on each node or variation. In PGN, the tags are represented as [%tagKey tagValue] strings
appended to text comments.
The tag keys must be non-empty, and can contain only alphanumeric or underscore characters.
array sorted in increasing order.
AbstractvariationsAlternative variations that can be followed instead of the current move.
Represent one move in the tree structure formed by a chess game with multiple variations.