Author: macaroni
Date: 05:54:42 06/27/03
Go up one level in this thread
On June 27, 2003 at 05:19:41, Andrew Williams wrote: >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 > >When you say "biggest capture, smallest attacker", how do you calculate that? >You should use different scales for these two numbers. For example: > >100, 300, 300, 500, 900 for the CAPTURED piece > 1, 3, 3, 5 9 for the ATTACKER > > >Andrew Yes, i'm using more or less that, but good to know thats the way to go :)
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.