International Computer Games Association

Can We Infer Move Sequences in Go from Stone Arrangements?

The research investigates the feasibility of inferring the chronological move sequences of a Go game solely from the final arrangement of stones on the board.

• Researchers successfully reconstructed Go game sequences from final board states by treating the task as a likelihood maximization problem solved via simulated annealing.
• The model utilized a neural network trained on strong human player datasets to approximate move probabilities across 19x19 board configurations.
• While the model rarely produced exact matches to original game records, it frequently generated sequences that were more logically sound than the actual human-played moves.

Plagiarism in Game Programming Competitions

The International Computer Games Association maintains the integrity of competitive computer chess by enforcing strict standards of originality and attribution.