Author: Vincent Diepeveen
Date: 02:20:03 04/18/01
Go up one level in this thread
On April 17, 2001 at 15:40:58, Uri Blass wrote: >Suppose program X is playing against kramnik. > >I think that it may be a good idea to generate a program that generates a tree >and sends all the positions in the tree to people who want to help the computer >in the match(I will call it the main program). > >The people give program X to analyze the position and return score and depth to >the main program. > >The main program is using all the information about scores and depthes to decide >about the best move. So a beginner rated 600 is very happy about a certain move, and as a real patzer he returns infinite score for his move. Guess what move is going to get played... ...you create a lot of weak links by this Uri! >Yace or Gandalf can be used for this task because they are not preprocessors. >Most programs need to be changed in order to be used in this way and there >should be an option to analyze position A when the root position is known as >position B. > >I think that in this way 1000 pIII800's can be clearly better than an SMP >machine. >Am I right? Noop. Unless you mean an SMP machine with 1000 processors :) >Uri
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.