Author: Adriano Bedeschi de Souza
Date: 12:04:35 06/17/02
Go up one level in this thread
On June 17, 2002 at 14:46:03, Dann Corbit wrote: >On June 17, 2002 at 14:31:51, Adriano Bedeschi de Souza wrote: > >>On June 17, 2002 at 13:17:32, Sune Fischer wrote: >> >>>On June 16, 2002 at 22:42:02, Adriano Bedeschi de Souza wrote: >>> >>>>I need help! >>>> >>>>I am writing a chess engine and i have some doubts. >>>>My main doubt is about speed, i have coded all the program based in Bitboards, >>>>they r working properly but the speed is a lot bad! It makes less than 2000 >>>>nodes per second !!!! >>>> >>>>note: i am using alpha-beta search, transposition table and iterated >>>>deepening... >>>> >>>>Adriano Bedeschi de Souza >>>>adriano.bedeschi@poli.usp.br >>>>uin 58144572 >>> >>>Well off the top of my head: >>>How are you generating the bitboards? >>>How are you counting the nodes? >>>Do you dynamicly allocate anything during search? >>>Do you "pass by value"? >>> >>>-S. >> >> >>=) >>I pass by reference >>I am counting the nodes properly =) no doubt >>I dont use dynamic allocation >>My bitboard generation is based in http://www.galahadnet.com/chess/chessprg/ >> >>and before u ask, i am no using a 286 =) >>(its a k6-2 450) > >That model should be plenty fast. >Are you compiling in release mode? >What compiler are you using? > >I should expect your generation rate to be 100x what it is right now, at least. Corbit, I use GCC (with DevCpp) The problem isnt the compiler, i used it with TSCP and it worked very well (good bench) I am using float's in the evaluation function, i will change it and test again but can it be the only reason? I dont think so...
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.