Author: Thomas Gaksch
Date: 01:55:40 03/19/05
Go up one level in this thread
On March 19, 2005 at 04:37:16, Per Steneskog wrote: >Btw, when I started to read about chess programming I was taught that abs() was >a rather expensive operation. Of course my memory may play a trick on me, or >things may have changed. No one can tell without running tests. > >// Regards Per hi per, i implemented some new features in fruit just for fun. i never payed attention on how expensive the operations are. i think programming makes not much fun if you have to count every cpu cycle. my opinion is that a good chess program must have a very good selective search. it doesnt matter how much nodes per second the program is able to search. i think shredder is a very good example. it seems that shredder is not a very fast searcher but it has a unbelievable good selective search. bye thomas
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.