TalkChess.com

I like to test at 60/60 time controls. 60 minutes on the clock, 60 seconds per move added. That turns into 4-6 hours per game. or 6-8 games per day. 30 days isn't enough games to determine if version X is better than version X-1 at that speed. It takes more than a hundred games or two with two oppo...

Even if you take an infinite number of positions it would still be meaningless if you did not measure tactical strength. Because you would select the move ordering systematically to reduce more moves by LMR, by putting poor, but non-reducible moves (like bad captures) in front, just to put interest...

Don't underestimate my abilities here :) There is no need to act stupid even if it is possible... Captures are a very special and easy to detect cases. What you say is in general applicable to every move ordering test, LMR on or off. There are other pruning methods. If you look above you will see h...

I like to test at 60/60 time controls. 60 minutes on the clock, 60 seconds per move added. That turns into 4-6 hours per game. or 6-8 games per day. 30 days isn't enough games to determine if version X is better than version X-1 at that speed. It takes more than a hundred games or two with two oppo...

I like to test at 60/60 time controls. 60 minutes on the clock, 60 seconds per move added. That turns into 4-6 hours per game. or 6-8 games per day. 30 days isn't enough games to determine if version X is better than version X-1 at that speed. It takes more than a hundred games or two with two oppon...

I don't get why you turn LMR off during move ordering tests. Why not turn off killers or hash tables? They are all both dependent of the move ordering and will also change the move ordering. If there is a combined effect from LMR and different move ordering methods you want to catch that right? /Pe...

You can't do it all in parallel. You have to use some sort of "tree" to reduce it down to a single answer. Which is a tree of depth 6 for 64 squares... Each square could find its own answer easily, but then they have to "get together" and figure out which is the "best answer" and that adds sequenti...

You can't do it all in parallel. You have to use some sort of "tree" to reduce it down to a single answer. Which is a tree of depth 6 for 64 squares... Each square could find its own answer easily, but then they have to "get together" and figure out which is the "best answer" and that adds sequenti...

There are probably some interactions with LMR since changing the ordering changes the history values and such which changes the pruning in odd ways. Yes. For this reason, I think it is best to disable LMR while doing move ordering tests. Tord It's a catch-22. Since LMR is used normally, removing it...

That would stretch the clock cycle time for _everything" since the clock cycle time has to be long enough for the most complex circuit in the thing to settle. MVV/LVA requires two minor cycles in a hardware implementation. First cycle is find the most valuable attacked piece (victim), second cycle ...