Improving TT replacement scheme

Discussion of chess software programming and technical issues.

Moderator: Ras

User avatar
algerbrex
Posts: 608
Joined: Sun May 30, 2021 5:03 am
Location: United States
Full name: Christian Dean

Re: Improving TT replacement scheme

Post by algerbrex »

Ras wrote: Thu Jun 30, 2022 8:13 am
algerbrex wrote: Thu Jun 30, 2022 3:55 amAh, gotchu. Yep, long-time control testing would definitely be best, but unfortunately, I don't have the hardware or time to support such extensive testing :)
Or you could test at shorter time controls, but with only 1MB of hash.
Very true, not sure why this didn't occur to me.
User avatar
Kotlov
Posts: 269
Joined: Fri Jul 10, 2015 9:23 pm
Location: Russia

Re: Improving TT replacement scheme

Post by Kotlov »

I experimented a lot with a replacement and made a general conclusion that even the most cunning replacement schemes are slightly different from the simplest scheme “write always”
Eugene Kotlov author Hedgehog 2.407 64-bit
User avatar
algerbrex
Posts: 608
Joined: Sun May 30, 2021 5:03 am
Location: United States
Full name: Christian Dean

Re: Improving TT replacement scheme

Post by algerbrex »

I actually went back and looked at the replacement code today and realized I had a bug where I was replacing the depth preferred entry first instead of replacing the always replace entry first. Basically had things backwards. Fixed the bug, ran another test, with a 1MB hash to put more pressure on the replacement scheme, and saw a 30 Elo gain in self-play.

Not sure if it's worth experimenting with 4 buckets or not, since two seems to work quite well now that I've ironed out the bugs.