It's also worth noting that unique string != board state. Proof: Both black and white could move the left rook pawn as their first move and right rook pawn as

It's also worth noting that unique string != board state. Proof: Both black and white could move the left rook pawn as their first move and right rook pawn as the second move. Now reset the board and do right rook first and left rook second. Same board state, different game string. In practice unique board states is a strict subset of number of moves but given how far off I was on my first assessment ... I wonder if we're talking about another < 2% hit. All of this is dependent on an actual engine that can process the notation. There's apparently lots of options for pgn. I'd also like to develop a heatmap based on statistical analysis. I'd imagine this would not only be way less than equally distributed but there'd be no way to slice the data to make it appear equally distributed