Bug hunting

Discussion of chess software programming and technical issues.

Moderator: Ras

jhellis3
Posts: 548
Joined: Sat Aug 17, 2013 12:36 am

Re: Bug hunting

Post by jhellis3 »

For memory problems is good also valgrind.
2nd this.
Patrice Duhamel
Posts: 194
Joined: Sat May 25, 2013 11:17 am
Location: France
Full name: Patrice Duhamel

Re: Bug hunting

Post by Patrice Duhamel »

jtwright wrote: Mon Jan 10, 2022 9:39 pm It's possible the inconsistency is caused by a bug but it could be something benign like the above as well. If you're trying to figure out the specific cause you should try to control for as many of these features in your experiments as you can.
I will look more closely to the games, and try to understand what happens.

If it's not a bug and the problem is only the evaluation function, maybe I should disable all the pruning + reductions when I try to tune the evaluation ?
Anything that can go wrong will go wrong.
User avatar
Ronald
Posts: 161
Joined: Tue Jan 23, 2018 10:18 am
Location: Rotterdam
Full name: Ronald Friederich

Re: Bug hunting

Post by Ronald »

You could also work the other way around, i.e start with a minimalistic evaluation function and try to optimize/debug you search first. You could implement the PeSTO or any other PST evaluation so you can determine the base level with that (you might need to tweak some search parameters to match the PST values). rofChade 1.0 was a PST only version and the search parameters are still nearly the same (I believe only LMR is more aggressive). I guess rofChade's full evaluation function added around 300 elo to the PST only version, you might use that to compare it with the difference of your own evaluation function to get more feeling for where you might win the most elo, search or eval
Patrice Duhamel
Posts: 194
Joined: Sat May 25, 2013 11:17 am
Location: France
Full name: Patrice Duhamel

Re: Bug hunting

Post by Patrice Duhamel »

Ronald wrote: Thu Jan 13, 2022 8:37 pm You could also work the other way around, i.e start with a minimalistic evaluation function and try to optimize/debug you search first. You could implement the PeSTO or any other PST evaluation so you can determine the base level with that (you might need to tweak some search parameters to match the PST values). rofChade 1.0 was a PST only version and the search parameters are still nearly the same (I believe only LMR is more aggressive). I guess rofChade's full evaluation function added around 300 elo to the PST only version, you might use that to compare it with the difference of your own evaluation function to get more feeling for where you might win the most elo, search or eval
Yes, it's an interesting idea.
Anything that can go wrong will go wrong.