Author: Steve Maughan
Date: 08:06:27 05/29/00
Go up one level in this thread
Tom, Couple of questions from the paper to make sure I understand this: "1. The eldest son is analysed, regardless of the position of the other processors;" I assume this means the "best move stored in the Hash Table"? What if there isn't a best move stored in the table eg another thread has just started analysing the position? "2. the other sons which are not currently analysed by other processors are analysed;" i.e. all other nodes that are not being analysed by a thread? "3. then analysis of the positions which are not totally evaluated (i.e. the corresponding entry in the transposition table is not set for the analysis depth) is done." then all nodes that are being searched by another thread but haven't been fully searched. So what happens when a cutoff occurs and there are other threads searching the same position? Do you send a message to them or just leave them to continue? This algorithm sounds interesting due to it's simplicity. I think I understand it but I'm still not 100% sure. Regards, Steve Maughan PS Are we going to see TRSPCP (Tom's Relatively Simple Parallel Chess Program) :-) ?
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.