Don wrote:bob wrote:Kempelen wrote:More ideas: The tree searched is like a triangle. What about if we based reductions deph based on how far are we from the left side (that is, the pv). More far more reduction....
That is the L in LMR in fact, although I have tried this as well. So far, nothing significant has happened with the idea of reducing "later" moves more.
It works for me. As I said before, I reduce by 1 until I'm later in the list then I reduce by 2. So each move gets 0, 1 or 2 reductions.
Been trying this off and on for the last 3 years. Been calling it
Accelerated LMR in my notes. Generally, it doesn't combine well with
other ideas. I've finally found some constraints that make it only 20
Elo weaker than not using it. I suspect there is some merit with the
proper constraints thus I periodically go back to it.
Currently, it plays sort of wild. I don't use it due to how badly it
occasionally losses.
The issue with LMR is that it sees alternate good lines late. The value
of LMR is that it goes deeper on the PV quicker. So, you have two
choices: improve the weakness or the strength of LMR. I've been
working on both together and seperately. Its a hard nut to crack.
So, far I have mods that are slightly weaker than the baseline
algorithm.