I'd combine the concept of non-linear advancement, with the idea of walls, starting age, and the idea of "permanent x-rank". I know really smart people who have played go for 20 years, have had tons of pro lessons, but can't advance beyond SDK. Could their improvement curve by asymptotic, limited at SDK? Could all our curves be asymptotic? And could we all be on separate curves with different limits?
Furthermore, I'd suggest that starting age impacts the limit, giving the resounding answer of "No!" to all those twenty-somethings asking about their pro ambitions.
And please note that I described the perma-SDK's as really smart. I am confident that IQ is not the only factor in our personal limits.
I suspect that most L19'ers have asymptotic limits in the high-dan levels, so don't take this concept personally. But my painful belief is, we are all limited, to some extent, to a certain strength beyond which we will never advance.
Okay then, shoot me down. Or tell me what your asymptote is, and why.
schawipp wrote:I always have the feeling that climbing up the ranks is somewhat similar as climbing up a graph with a logarithmic axis, since improving the rank is equivalent to reducing the relativ error level. In EGF rating the winning chance for 1 kyu difference without handycap is about 71%.
With the simple assumption that the total number of mistakes decides the game and with an assumed average total number of moves of 250, a brute-force Monte Carlo experiment shows that at an average mistake level of 50% (I do not know, which kyu level this represents, I assume somewhere around 15k), one rank difference means to make only about 93% of the mistakes as the weaker player, i. e. a 7% reduction. At only 10% mistake level (around 13-14 stones better, let's assume somewhere in the range of 2k), the mistake reduction factor is even a bit stronger (76%, i. e. 24% average reduction in mistake probability per move) to maintain the same winning chance of 71% per grade.
With the numerical example, to get from around 15k to 14k you need to reduce the number of mistakes in a 250 move game (i. e. 125 moves per plaer) from 63 to 58, which seems quite achievable. To get from 2k to 1k you need to reduce the number of mistakes from 12 to 9, this seems much more tough.
Given that numerical examples, I tried to plot your rank history vs. number of played games on a logarithmic axis and make a high-accuracy () extrapolation till shodan rank.
Thus, if you maintain your training speed, you will need about 10^6 games to get to shodan.
IMHO this shows, that for getting to or beyond shodan, external input from stronger players is mandatory, which alters your view on the game and training strategy substancially and thus would break the logarithmic law to some extent.