Multi-Source Feature Fusion and Neural Embedding for Predicting Chess Puzzle Difficulty
Estimating the difficulty of chess puzzles provides a rich testbed for studying human-computer interaction and adaptive learning.Building on recent advances and the FedCSIS 2025 Challenge, we address the task of predicting chess puzzle difficulty ratings using a multi-source representation approach.Our approach integrates pre-trained neural embeddings of board states, solution move sequences, and engine-derived success probabilities.These heterogeneous features are fused via dedicated embedding and projection layers, followed by a multilayer perceptron regressor.Post-processing calibration and model ensemble further enhance robustness and generalization.Experiments on the FedCSIS 2025 dataset demonstrate that our method effectively leverages both structural and empirical information, achieving strong predictive performance.Our approach achieved fifth place on the final official leaderboard, highlighting the effectiveness of combining neural representations with domainspecific probabilistic features for robust chess puzzle difficulty prediction.
Authors
- Haitao Xiao (ORCID: https://orcid.org/0000-0001-5951-4426)
- Xin Wen (ORCID: https://orcid.org/0000-0003-1374-2129)
- Le Chen (ORCID: https://orcid.org/0000-0003-3644-4589)
- Dexin Yu (ORCID: https://orcid.org/0000-0003-4597-4629)
- Kun Fu (ORCID: https://orcid.org/0000-0002-0450-6469)
Institutions
- China Mobile (China) (CN)
Publication Details
- Journal
- Annals of Computer Science and Information Systems
- Published
- 2025-10-15
- DOI
- https://doi.org/10.15439/2025f2456
- Citations
- 1
- Primary Topic
- Artificial Intelligence in Games
- Type
- article
- Field-Weighted Citation Impact
- 0.89