Author: Henry Hongdoyo
Date: 19:49:29 10/12/04
1) I try to make 8-10 ply for my chess program. Now My program can only reach 6 ply(fast). 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) Forward Pruning(Null move, Futility pruning) Transposition Table Quiescence Search Iterative Deepening Mtdf/Negascout (optional) Lazy Exit do u have a good idea to speed up my chess program ? (i dont use bitboard or Ox88) 2) is somebody in there know about FEN String ? or u know any site that can give me lesson how FEN string presented position in chess ? Because i'm confuse to analyze that. 3) I have to many collision in TT when i try to search(mtdf) in more than 6 ply ( >1000 in quiescence). To handle Collision, i use array temporary and keep all collision in there. What do u think ? it is normal or not ? i use hash table size word*8, zobrist key to handle index key, and operation 'mod' to get the real key (ZobristKey mod HashSize). Thank's for your attention and help
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.