Author: Paul Clarke
Date: 02:40:23 10/13/04
Go up one level in this thread
On October 12, 2004 at 22:49:29, Henry Hongdoyo wrote: >1) >I try to make 8-10 ply for my chess program. >Now My program can only reach 6 ply(fast). How fast do you get to 6 ply in a typical position? How many nodes do you search? On what hardware? >I use all algorithm that i think important. >But it can't reach 8 ply fast. Why ? >I Use: >Move Ordering(killer move, history heuristic, > TT,Piece Square technique,MVV/LVA) In what order? I think the usual is hash table move, gaining captures sorted by MVV/LVA or SEE, killers, then other moves sorted by history and/or piece square. >Forward Pruning(Null move, Futility pruning) >Transposition Table >Quiescence Search Do you use MVV/LVA to sort the captures in quiesence search too? >Iterative Deepening >Mtdf/Negascout (optional) >Lazy Exit
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.