Author: Bruce Moreland
Date: 09:36:40 09/24/01
Go up one level in this thread
On September 24, 2001 at 05:13:13, Adrian Smith wrote: >What methods and ways can you turn a simple searching chess program into a more >competitive program? > >Thanks 1) Piece square tables. 2) Null-move forward pruning. 3) Pawn structure eval. 4) Hash tables. 5) King safety eval. 6) A means of limiting quiescence search. 7) Some sensible extensions like check, recaptures, single response. 8) Some sensible pruning like futility cutoffs. 9) Some second order evaluation of pieces, so you know when one is good or bad. 10) Move ordering improvements such as killers, history, etc. 11) General performance improvements. 12) Passed pawn evaluation. I tried to order the above list, but I didn't do a very good job. bruce
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.