I built networks from datasets with 1 million positions, 2 million, etc up to 64 million and played a tournament. The searches were fixed depth of 9-ply to give the engines enough tactical ability to find mates. Results below. The '-N' on the end of the name is the number of millions.
Code: Select all
Rank Name Elo +/- nElo +/- Games Score Draw
1 ColossusChess5-64 239.47 6.51 308.44 6.22 12000 79.9% 19.0%
2 ColossusChess5-32 213.73 6.35 266.25 6.22 12000 77.4% 18.9%
3 ColossusChess5-16 154.39 6.00 181.97 6.22 12000 70.9% 19.1%
4 ColossusChess5-8 47.69 5.70 52.64 6.22 12000 56.8% 17.1%
5 ColossusChess5-4 -68.66 5.91 -74.11 6.22 12000 40.2% 12.6%
6 ColossusChess5-2 -235.40 7.34 -266.14 6.22 12000 20.5% 5.9%
7 ColossusChess5-1 -538.80 14.26 -841.62 6.22 12000 4.3% 2.2%
Finished match
The ELO gain between each position (bottom to top) is as follows...
303.4, 166.74, 116.35, 106.7, 59.34, 25.74
So clearly decreasing for each doubling in size. ChatGPT extrapolated +12.9 for 128 million and +6.4 for 256 million.
So for a simple network like Chess768 there are still some gains to be had with datasets into the hundreds of millions but approaching saturation where time might be better spent elsewhere. I would guess that networks with more complex architectures can keep giving meaningful gains well into the billions of positions.

