Author: stuart taylor
Date: 03:42:58 02/12/06
Go up one level in this thread
On February 11, 2006 at 19:17:00, Peter Eizenhammer wrote: >On February 11, 2006 at 18:38:02, stuart taylor wrote: > >>If there are positions which are too deep for it to find the best moves within >>reasonable times, will it remain like that for this upcoming official final >>release? >>S.Taylor > >Hi Stuart, >the answer is a clear yes, >there will be moves it cannot find in a reasonable time, >and additionally there will be moves it cannot find in even unreasonable time >;-) > >But you did not really expect the perfect solution of chess with rybka 1.2, did >you?! > >Peter Indeed I was interested in UNreasonable timings too! OK but would it then be much much better after another year, by the rate Vasik is going? (Or would it take waiting for computers to work X100 quicker? [Or even X10-X20, because that might be enough to fit in some time-consuming searches, but which are nevertheless very effective, but would slow things down too much at present cpu speeds] This question can be understood better by people more experienced in chess programming, probably) S.Taylor
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.