A question about SPRT
Posted: Sun Dec 25, 2016 6:02 am
I'm looking at the implementation of SPRT posted here https://chessprogramming.wikispaces.com ... stics#toc7
I through that the number of games needed would be related to the bounds of the test, elo0 and elo1. So if we ran a test using the bounds [0,3], we would be trying to prove that the new version was at least 3 elo better than the second version. The same idea for the using the bounds of say, [0,5]. Now I thought that since it seems like it would be easier to prove a 3 elo gain than a 5 elo gain, the test using [0,3] should take fewer games. However, in practice this appears wrong. Additionally, looking at that implementation, my assumption is also wrong mathematically.
So my question is, where am I going wrong?
Is this implementation flawed?
Do I missunderstand the meaning of elo0 and elo1?
Thanks
Andrew
I through that the number of games needed would be related to the bounds of the test, elo0 and elo1. So if we ran a test using the bounds [0,3], we would be trying to prove that the new version was at least 3 elo better than the second version. The same idea for the using the bounds of say, [0,5]. Now I thought that since it seems like it would be easier to prove a 3 elo gain than a 5 elo gain, the test using [0,3] should take fewer games. However, in practice this appears wrong. Additionally, looking at that implementation, my assumption is also wrong mathematically.
So my question is, where am I going wrong?
Is this implementation flawed?
Do I missunderstand the meaning of elo0 and elo1?
Thanks
Andrew