Author: Andrew Williams
Date: 14:27:37 05/08/02
Go up one level in this thread
On May 08, 2002 at 17:09:56, Steffen Basting wrote: >Hi again! >I thought of practical programming tips... ;-) >Interfacing my engine will be done as soon as it is worth being published. > >Steffen Oops. Sorry. The best place to start, IMO, is to improve move-ordering. How do you decide in which order to search the moves at a given ply? One simple scheme is to generate a Most Valuable Victim / Least Valuable Attacker score. Take the value of the capturing piece away from the value of the captured piece when you generate a capturing move. Order your search of moves by this score. If you've already got MVV/LVA, consider going on to a static exchange evaluator (SEE). Here, looking at just one square, you work out what will be the result of capturing on that square. Essentially, a SEE does an alpha-beta search for all moves that attack a particular square. Andrew
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.