see

[AlvaroBegue]

Hi all.
With all this talk about SEE........
I dont have it in my program, so can someone explain what to do with it once you have calculated it ?
How would it improve my program, what are the gains.


Laurie (LTchess)

I only use it in two places:
(1) In quiescence search I skip captures with SEE < 0
(2) In the regular alpha-beta search, I use it for move ordering, which goes like this:
* Hash move
* Captures with SEE > 0, ordered by MVV/LVA
* Captures with SEE == 0, ordered by MVV/LVA
* Killers
* Non-captures, ordered by history heuristic
* Captures with SEE < 0, ordered by MVV/LVA

The way I implement (2) is to generate all captures, sort them by MVV/LVA and when you are about to explore a capture, compute its SEE, then move it to a different list for later processing if SEE <= 0.

[lauriet]

Sounds like a lot of processing for a little gain ???
Has anybody got data on if it effective in increasing ELO ?

[AlvaroBegue]

Sounds like a lot of processing for a little gain ???
Has anybody got data on if it effective in increasing ELO ?

In my notes I have the results of trying to remove the pruning of SEE<0 moves from quiescence search: -40 Elo (391-597-818)

[abulmo2]

Sounds like a lot of processing for a little gain ???
Has anybody got data on if it effective in increasing ELO ?

In my notes I have the results of trying to remove the pruning of SEE<0 moves from quiescence search: -40 Elo (391-597-818)

In Amoeba, I use see to prune moves in quiescence search, to sort them and even to prune some bad moves during search. Removing all of them costs Amoeba 70 +/- 10 Elo.

[tttony]

Take a look this: http://www.talkchess.com/forum/viewtopi ... _view=flat