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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-Source Feature Fusion and Neural Embedding for Predicting Chess Puzzle Difficulty

Haitao Xiao, Xin Wen, Le Chen, Dexin Yu et al.
1 citations
Annals of Computer Science and Information Systems
Artificial Intelligence in Games
0.89
article

Multi-Source Feature Fusion and Neural Embedding for Predicting Chess Puzzle Difficulty

Haitao Xiao, Xin Wen, Le Chen, Dexin Yu, Kun Fu
article en
1 citations

Abstract

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.

Annals of Computer Science and Information SystemsVol. 43
China Mobile (China) (CN)
Openalex Percentile: Top 22%
Artificial Intelligence in Games
0.89
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.