TalkChess.com

I have no quarrel with either of you, merely pointing out facts. It's up to anyone to do what he wants.
as for politeness: I think it's polite not to use capital letters in sentences

maksimKorzh wrote: ↑

Wed Oct 28, 2020 3:42 pm

So why don't you support the newcomer???
He didn't just copy paste the code - he has WORKED THAT CODE OUT.
Why do you judge by node count and pv?

because it's a verbatim copy, I refuse to praise cloners, newcomers or not.
btw - did he work that code out the same way you worked NNUE out?

Guenther wrote: ↑

Wed Oct 28, 2020 2:35 pm

It looks more than derived too me.

same PV, same node count. there really is only one explanation

Indeed, I overlooked that, and you're right. Do you have numbers how often the repetition detection in QS actually does detect a repetition? Because I think it should be about 0. I not only detect draws by repetition by also draws by insufficient material and 50-rule draw. it will be >0, because I ...

Given that by far most nodes are QS nodes, and that you can have positions where you don't have irreversible moves for quite some time, I'm not sure whether it's not noticeable. Keep in mind that it's loop code, i.e. a lot of branching. Why spending effort on something that shouldn't be necessary? ...

but that's wrong. you should search the last 7 positions (or 6, depending on whether it comes before or after the reset)
you don't care about repetitions before last irreversible move.
also, you can only check each other position (you only check reps for side to move)

How about a Power Punch rating? Take the CCRL or any other testers elo rating. and divide it by the file size of the engine executable. Some relatively weak engines could demonstrate a lot of power for the size of the engine. It is also a demonstration of good programming. Power Punch = ELO / engin...

Because QS should deal with capture moves which would reset the draw counter anyway. Doing the move history check in QS looks like a waste of time. That should only be done in main search before and instead of iterating any deeper. So, in the move loop after making the current move, but before the ...

I already do this. (To make sure I'll test the function again to see if it works properly... but as far as I know, it does.) I do check for repetitions right AFTER the escape condition "if depth == 0", so it could indeed be that a move repeats the position, but because it's a leaf node it does QSea...

the solution is simple: just score the repetition as draw. all you have to do is look up the history (since the last irreversible move) to check for reps. of course you want to do this inside search, at the beginning of each node. here you should handle draws by repetition, 50 move rule draw (be car...