Author: Johannes Buchner
Date: 12:44:39 10/10/99
Hi everyone !
I'm a German student and I'm currently working on a chess programm. I was
thinking about the best (i.e most efficient) way to implement move ordering.
As far as I know, there are several ways to do so, e.g. you can try to give a
score to each move at the time it is generated, e.g a bonus for a recapture
etc., but I think that's not very efficient because you have to start sorting
your moves according to these scores afterwards, that means looking for the one
with the highest score by comparing it to all the others. It seems to take a
considerable amount of time to do so, or am I missing something here ?
I'm sure there are much more sophisticated ways to achieve a good move ordering,
how have you solved this problem ?
Thaks for your help !
Johannes Buchner
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.