Author: Uri Blass
Date: 02:30:59 10/27/05
Go up one level in this thread
On October 27, 2005 at 04:41:49, Alessandro Damiani wrote: >On October 27, 2005 at 04:39:22, Uri Blass wrote: > >>suppose that I give you 100 random positions from games. >> >>How much do you need to calculate fruit2.1's static evaluation of all positions >>with no computer help. >> >>Uri > >Is this the first step to distributed human search engines? :-) > >Alessandro I see that I forgot the word fime in the first post. I meant how much time do you need for calculating fruit's evaluation with no computer help. Note that I doubt if humans can complete even one ply search with fruit's evaluation at tournament time control without losing on time unless they play correspondence games(but maybe I am wrong and I know that some human can multiply big numbers very fast so maybe it is possible that some humans can do it. I think that talented humans can complete one ply search and play in tournaments like a computer but only with a simpler evaluation than fruit's evaluation. It will be interesting to know what rating can the best humans achieve against humans when they are forced to play like a computer with definitive algorithm (of course their oppoents should not know the algorithm because playing like a computer is enough disadvantage) When I said the best humans I do not mean to the best chess players but to the best players in tournament when every human is forced to play like a computer and if after the game it turned out that the player did a mistake in implementing the algorithm that he decided to use he gets a loss(of course good algorithm can say to play checkmate if it is possible and this part is easy for chess players so there is not going to be mistakes of missing mate in 1). 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.