Author: Angrim
Date: 22:15:38 06/26/03
Go up one level in this thread
On June 26, 2003 at 22:45:17, macaroni wrote: >I recently wrote a computer chess program, using alpha-beta, null moving, and >quiescent search, in the main search function I use a history heuristic to sort >moves, and that seems to be doing just fine, I can't say the same for my q >search, the sorting procedure I use for that, is biggest capture, smallest >attacker. However, when I do a ply 5 search, i get 23,000 standard search nodes, >which seems acceptable to me, but I get 180,000 q nodes, which seems ridiculous. >Is this as bad as I think it is? is it expectded? should I just make my Eval, >MoveGen, MakePosition and UnmakePosition functions faster (if possible)? Also, >my program manages 75,380 nodes per second, is this high? someone once told me >that a high node/sec count is not always good. >Thanks everyone for move ordering, you badly need a hash table, so that you can track which move failed high the last time you saw the same position, and try it first the next time. I get 7 ply with a little less total nodes than that, and I do extensions for being in check, and no fancy pruning. as to the 75,380 nodes per second, that depends on what hardware you are using. If your hardware is faster than 300mhz then you are a bit slow. I am assuming a simple evaluation function since your program is so new. Angrim
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.