Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Move ordering

Author: Michael Henderson

Date: 17:57:06 08/05/04

Go up one level in this thread


On August 05, 2004 at 20:01:29, Cesar Contreras wrote:

>I'm trying to improve my move ordering, with a little success, principal due to
>correct my understanding and implementation MVA\LVV. I had not sucess with SEE.
>Anyway, i think my tree it's still too big.
>
>I need to know if i can do any more about it.
>
>currently i do:
>
>1.- Moves on transposition, ordered by evaluation (some one suggested me order
>by node count, why do you think?)
>2.- Killer moves.
>3.- History heuristics.
>4.- All promotion moves.
>5.- All capture moves.
>6.- All remaining non-capture-non-promotion moves.
>
>What i see on this list it's that the last "non-capture-non promotion moves",
>comes last, but i think it's to frecuently that the best move it's not a capture
>or promotion move.
>
>I'm thinking of make some Mix, first try the best promotion move, then the best
>capture move, and then the best non-capture-non-promotion move, then the next
>best promotion move, and so on.
>
>What do you think about it?

captures/promotions should go after hash table move, then killers (do not allow
captures/promotions in killers), then history for the rest of the moves



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.