I achieve the best nodes/seconds while using ascending MVV-LVA in AlhbaBeta and descending MVV-LVA in QSearch.
Is this common?
--
Srdja
Qsearch and MVV-LVA
Moderators: hgm, Rebel, chrisw
-
- Posts: 2662
- Joined: Wed Mar 10, 2010 10:18 pm
- Location: Hamburg, Germany
- Full name: Srdja Matovic
-
- Posts: 20943
- Joined: Mon Feb 27, 2006 7:30 pm
- Location: Birmingham, AL
Re: Qsearch and MVV-LVA
Ascending/descending doesn't make any sense to me. Do you mean maybe MVV/LVA in one and LVV/MVA in the other???smatovic wrote:I achieve the best nodes/seconds while using ascending MVV-LVA in AlhbaBeta and descending MVV-LVA in QSearch.
Is this common?
--
Srdja
-
- Posts: 2662
- Joined: Wed Mar 10, 2010 10:18 pm
- Location: Hamburg, Germany
- Full name: Srdja Matovic
Re: Qsearch and MVV-LVA
Yes, thats what i mean.Do you mean maybe MVV/LVA in one and LVV/MVA in the other???
Thank you for correcting my wording.
-
- Posts: 1471
- Joined: Tue Mar 16, 2010 12:00 am
Re: Qsearch and MVV-LVA
Why is "nodes/second" a criterion for picking either choice?smatovic wrote:I achieve the best nodes/seconds while using ascending MVV-LVA in AlhbaBeta and descending MVV-LVA in QSearch.
Is this common?
--
Srdja
It's quite possible that the lowest nodes/sec value actually corresponds to the better solution.
Robert
-
- Posts: 2662
- Joined: Wed Mar 10, 2010 10:18 pm
- Location: Hamburg, Germany
- Full name: Srdja Matovic
Re: Qsearch and MVV-LVA
Maybe....my engine plays still Blitz on a search depth of 4 so a magnitude slower search algorithm is not applyable.Why is "nodes/second" a criterion for picking either choice?
It's quite possible that the lowest nodes/sec value actually corresponds to the better solution.
...i do not understand the background why the Qsearch behaves different than pure Alphabeta concerning the move ordering.
I observed the effect that using MVV-LVA instead of LVV-MVA in Qsearch leads to an tree-explosion.
So i want to ask if this is a common behavior or specific in my implementation (->bug).
-
- Posts: 27811
- Joined: Fri Mar 10, 2006 10:06 am
- Location: Amsterdam
- Full name: H G Muller
Re: Qsearch and MVV-LVA
The fastest nodes are those where you stand pat. No need to generate moves or do anything. So doing lots of futile moves (where the opponent makes you faillow by standing pat) speeds up nps. If you could cause a cutoff from current eval = alpha - 200 in QS by RxQ, where the Rook gets recaptured, that is not nearly as fast as capturing a Pawn and failing low on that. So you reduce the average time per node by first failing low on a number of Pawn captures, before trying the cut move that you could have tried immediately.
-
- Posts: 2662
- Joined: Wed Mar 10, 2010 10:18 pm
- Location: Hamburg, Germany
- Full name: Srdja Matovic
Re: Qsearch and MVV-LVA
thx, just found an older post from you about that:
http://www.talkchess.com/forum/viewtopi ... ht=lvv+mva
http://www.talkchess.com/forum/viewtopi ... ht=lvv+mva