Code: Select all
e := (e1+e2)/2
v := make([]int32, len(v1))
Code: Select all
for i := range v {
v[i] = (v1[i]+v2[i])/2
}
Code: Select all
e := (e1+e2)/2
Moderators: bob, hgm, Harvey Williamson
Code: Select all
e := (e1+e2)/2
v := make([]int32, len(v1))
Code: Select all
for i := range v {
v[i] = (v1[i]+v2[i])/2
}
Code: Select all
e := (e1+e2)/2
Thanks, highly appreciated.brtzsnr wrote:You cannot unfortunately divide an array by 2. You need to create a new one:
And then fill it in with the correct valuesCode: Select all
e := (e1+e2)/2 v := make([]int32, len(v1))
Computing the estimation for the new set like this is a bit bogus, but it's not really used except for logging so it should be fine.Code: Select all
for i := range v { v[i] = (v1[i]+v2[i])/2 }
Code: Select all
e := (e1+e2)/2
Cool. Can you post two graphs: one with the improvement and one without the improvement so we can compare?Joerg Oster wrote:I will let it run for a while and post the graph later.
Woooowbrtzsnr wrote:Cool. Can you post two graphs: one with the improvement and one without the improvement so we can compare?Joerg Oster wrote:I will let it run for a while and post the graph later.
Also, I pushed a change which I think you'll like: you can now set the number of cpus to use. In the example (update) if you pass --cpus 12 it will attempt to use 12 threads for evaluation. It doesn't scale linearly so you want to use a number higher than the actual number of cores available.
OK, both testruns are finished.brtzsnr wrote:Cool. Can you post two graphs: one with the improvement and one without the improvement so we can compare?Joerg Oster wrote:I will let it run for a while and post the graph later.
Code: Select all
stddev = math.Sqrt(stddev)
Code: Select all
go get -u bitbucket.org/zurichess/txt/...