Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Dr. Hsu @ Microsoft

Author: Bruce Moreland

Date: 12:21:11 10/16/99

Go up one level in this thread


On October 16, 1999 at 11:29:11, walter irvin wrote:

>first i'm going to admit that i know as much about multi processing as i do
>about brain surgery .but it just seems to me that if a person had say 4 cpu's a
>way to attack the problem COULD be as follows .
>1.first divide the moves if there are 20 then each gets 5 ect
>2.after each cpu gets to say 5 ply take the high score and go with it .disconect
>the other 3 cpu's transfer them up the tree to 6 ply do the same thing over and
>over to get real deep ??????
>
>maybe if you could get deep enough , you could turn tactics into strategy just
>by sheer depth ???????

It is more complicated than this.  The moves don't take the same amount of time
to search, some of them take a long time.  And this isn't just a hypothetical
case, it will happen in every search.  In a perfect world idle processors would
go help out on searches that are taking a long time.

bruce




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.