Author: Kim Roper Jensen
Date: 06:06:02 08/12/01
I have made a little chess program with some very ordinary stuff, and would like to implement multiprocessing( i just recently bought a dual 1GHz with 2Gb of memory, its real cheap here in denmark it only costed approx $1000) But i wondered how do you guys implement it, i was thinking about having a pool of threads that the search could grab if there is some available, then it would be easy to test to see which amount of threads would be the most efficient and it could be adjusted easily. Or do you just have a finite amount of threads that you start at once ???? I just had some thoughts that maybe the amount of threads that would yield the best perfomance could change in the course of the game and it would be more efficient to adjust the poolsize of threads in the different stages of the game. and how about having each thread using its own hashtable ?? This maybe sound silly but the we shouldnt check all kinds of things( is there another thread locking the table at the location etc.) maybe the there would be some small speed benefit( I mean, I read that implementing hashtables only gives approx. 70 ratingpoints, so maybe it isnt so critical to use one big table) just some thoughts ............ (if it sounds really crazy, then it must be because its late and im tired :) )
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.