Whites Only

A Go-based chess application processes a partially recorded PGN file where only White’s moves are provided. The program reconstructs game state using a third-party chess library and derives a decryption key from the full move history, which is then used to unlock embedded data inside the binary.

Your task is to analyze the execution flow, understand how the move sequence is transformed into a cryptographic key, and determine how the missing game state affects the final output. Solving the challenge requires combining binary analysis with chess state reconstruction and constrained move validation to recover the intended result.

Flag format:   flag{********_****_****}