LMR question

Programming Topics (Computer Chess) and technical aspects as test techniques, book building, program tuning etc

Moderator: Andres Valverde

LMR question

Postby Uri Blass » 13 Jul 2006, 07:54

Do you reduce late root moves in LMR

If I understand Glaurung's source correctly Glaurung does not reduce late root moves and I wonder if it was tried and found counter productive.


It is clear that there is not a lot to gain by reducing late root moves
because most of the time for root moves is used for the first moves but I wonder if there is a reason to be not consistent.

Note that I also not reduce root moves simply because I did not think about it and I have different functions for root moves and for normal alphabeta.

Uri
User avatar
Uri Blass
 
Posts: 727
Joined: 09 Oct 2004, 05:59
Location: Tel-Aviv

Re: LMR question

Postby bob » 13 Jul 2006, 16:08

I can do it easily. Testing was inconclusive for me, so I simply put it on the "to-do" list to resolve later... I am probably a bit more restrictive than Tord also, in that I don't do LMR until after I have tried all move ordering tricks including killer moves (2) and another 4 history moves as well. I plan on testing without that restriction also..
User avatar
bob
 
Posts: 156
Joined: 10 May 2006, 17:59

Re: LMR question

Postby Tord Romstad » 14 Jul 2006, 23:03

Uri Blass wrote:Do you reduce late root moves in LMR

If I understand Glaurung's source correctly Glaurung does not reduce late root moves and I wonder if it was tried and found counter productive.


Almost. It was tried briefly, with unconclusive results.

It is clear that there is not a lot to gain by reducing late root moves because most of the time for root moves is used for the first moves but I wonder if there is a reason to be not consistent.


Perhaps it isn't a very good reason, but this is how I think:

When we choose to reduce some move because it looks unpromising, we always take a risk. It is possible that the move will look bad in the reduced depth search, but would score well in a deeper search. This risk is always there, but it isn't equally important at all nodes. At most nodes in the search tree, an incorrect search decision is unlikely to propagate up to the root. At the root node, however, an incorrect pruning or reduction decision is guaranteed to produce an incorrect score and best move, more or less by definition. It therefore makes sense to be more conservative at the root than at internal nodes.

For similar reasons, it is natural to avoid reductions at PV nodes, where the score is much more likely to propagate up to the root than at non-PV nodes. In principle, I want to do this, but to my frustration Glaurung plays clearly worse when I disable LMR at PV nodes. I wish I understood why. Most other authors report the opposite.

Tord
User avatar
Tord Romstad
 
Posts: 639
Joined: 09 Oct 2004, 12:49
Location: Oslo, Norway

Re: LMR question

Postby Pedro Castro » 15 Jul 2006, 12:25

I have reductions at PV nodes.

DanaSah plays well. I can simply check the difference with any test of positions, It solves any position well, overalls if it is tactical.
Best wishes,

Pedro Castro
User avatar
Pedro Castro
 
Posts: 180
Joined: 28 Jan 2005, 01:09
Location: Pays Basque (Spain)


Return to Programming and Technical Discussions

Who is online

Users browsing this forum: No registered users and 23 guests