A Stacking-Based Ensemble Approach for Predicting Chess Puzzle Difficulty
FedCSIS 2025 competition is to predict the difficulty of chess puzzles, we present a structured multi-stage regression pipeline developed for the FedCSIS 2025 Challenge.The approach consists of three stages: (i) four Elo-banded base models trained on separate rating ranges to capture localized difficulty semantics and mitigate bias in imbalanced datasets; (ii) a feature-level stacking ensemble combining base predictions with structural attributes, such as success probabilities, failure distributions, and solution length, to enhance cross-band generalization; and (iii) a lightweight post-hoc residual correction to reduce systematic prediction biases.Additionally, an uncertaintyaware mask-based evaluation is introduced to identify the 10% most challenging puzzles for extended scoring.Our method achieved competitive results, ranking 7th in the final leaderboard, while maintaining low computational cost.These findings demonstrate that lightweight, interpretable models, when combined with structural reasoning and uncertainty estimation, can rival more complex deep-learning approaches.This study highlights the potential of structured machine learning pipelines for scalable, human-centric chess puzzle analytics.
Authors
- Ethan Liu
- C. Liu (ORCID: https://orcid.org/0009-0008-7832-0895)
- Alan Liang
- Kai You Wang (ORCID: https://orcid.org/0000-0002-6170-4744)
Institutions
- University of Southern California (US)
- Rose–Hulman Institute of Technology (US)
- California Southern University (US)
- California University of Pennsylvania (US)
- Fujian Petrochemical Group (China) (CN)
Publication Details
- Journal
- Annals of Computer Science and Information Systems
- Published
- 2025-10-15
- DOI
- https://doi.org/10.15439/2025f1698
- Citations
- 1
- Primary Topic
- Sports Analytics and Performance
- Type
- article
- Field-Weighted Citation Impact
- 4.98