Computer Chess Club Archives

Search

Messages

Subject: Re: Alert! Bob Hyatt -- The World needs you!

Author: Francis Monkman

Date: 10:05:23 07/18/99

Go up one level in this thread

On July 18, 1999 at 12:56:35, Robert Hyatt wrote:

>The idea sounds attractive, until you realize that the game tree search is
>an exponential problem, not a linear one.....  That makes it _very_ difficult
>for such a task to be done on computers...

But why not treat the computers as nodes in a tree, with sub-delegation
software? (Just a thought -- but I built a working parallel audio synthesizer
out of multiple TMS99000s back in '84, so I've been 'thinking parallel' for a
while -- though not in chess. That's why I thought of you. Hope you don't mind)

Say the machines are in a pool. Starting from root, one machine picks the next n
(=number of legal moves) machines' addresses. Then they in turn pick 'em off the
stack, and so on. Crazy?

Francis

• Re: Alert! Bob Hyatt -- The World needs you! Vincent Diepeveen 06:53:36 07/19/99
  • Re: Alert! Bob Hyatt -- The World needs you! Robert Hyatt 07:53:44 07/19/99
    • Re: Alert! Bob Hyatt -- The World needs you! Vincent Diepeveen 13:04:31 07/19/99
      • Re: Alert! Bob Hyatt -- The World needs you! Robert Hyatt 15:27:48 07/19/99
        • Re: Alert! Bob Hyatt -- The World needs you! Vincent Diepeveen 03:36:58 07/20/99
• Re: Alert! Bob Hyatt -- The World needs you! Robert Hyatt 13:05:00 07/18/99
  • Re: Alert! Bob Hyatt -- The World needs you! Francis Monkman 16:31:23 07/18/99
    • Re: Alert! Bob Hyatt -- The World needs you! José de Jesús García Ruvalcaba 10:01:41 07/19/99
      • Thanks to all here, and another (easier) idea. Francis Monkman 07:44:37 07/20/99
        • Re: Thanks to all here, and another (easier) idea. Dann Corbit 10:20:43 07/20/99
• PS2 Francis Monkman 10:11:49 07/18/99

This page took 0.01 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.