Study of the Proper NNUE Dataset
This addresses a key bottleneck in chess engine development for competitive players, though it is incremental as it builds on existing NNUE methods.
The paper tackled the problem of creating high-quality datasets for NNUE training in chess engines by proposing an algorithm to generate and filter 'quiet' positions, resulting in significant improvements in engine performance.
NNUE (Efficiently Updatable Neural Networks) has revolutionized chess engine development, with nearly all top engines adopting NNUE models to maintain competitive performance. A key challenge in NNUE training is the creation of high-quality datasets, particularly in complex domains like chess, where tactical and strategic evaluations are essential. However, methods for constructing effective datasets remain poorly understood and under-documented. In this paper, we propose an algorithm for generating and filtering datasets composed of "quiet" positions that are stable and free from tactical volatility. Our approach provides a clear methodology for dataset creation, which can be replicated and generalized across various evaluation functions. Testing demonstrates significant improvements in engine performance, confirming the effectiveness of our method.