I have a tree data structure to represent a chess game or rather a chess repertoire. A tree starts with a root and subsequent moves which all describe a given board position. A position can be serialized as a string(FEN notation). A move can be byte encoded or as a string detailing the source and destination square. There can be multiple moves in a given position meaning there is more than one variation on how to continue.