Author: Sune Fischer
Date: 06:56:32 09/03/03
Go up one level in this thread
On September 03, 2003 at 09:06:39, Gian-Carlo Pascutto wrote: >On September 03, 2003 at 09:02:28, Matthew Hull wrote: > >>But for chess, each piece of the search process will be on it's own processor >>and all the data it needs to do the search will be copied once at the start of >>it's "assignment", then it's off to the races. The only time he needs to use >>non-local memory is at the start (copy) and the end (report results). >> >>Yes? > >Nope :) > >You need to constantly check for abort-fail-high and abort-adjust-alpha >conditions on the other processors. Why can't the parent thread set these flags on the child(ren) threads instead? >I think most implementations will need >to constantly check/update what moves are left to process as well. No comment, havent gotten this far yet... :) -S. >-- >GCP
This page took 0.02 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.