Author: leonid
Date: 16:47:12 08/17/00
Go up one level in this thread
On August 17, 2000 at 18:01:27, Vincent Diepeveen wrote: >On August 17, 2000 at 06:41:50, leonid wrote: > >>On August 16, 2000 at 17:35:44, Jari Huikari wrote: >> >>>On August 16, 2000 at 17:23:33, Dann Corbit wrote: >>> >>>>Took 2 seconds to solve the hardest two. The other took one second. The >>>>machine was not a very fast one. On one of the fast machines, it would probably >>>>do a lot better. >>> >>>Was the program searching especially for mates? How much time would need >>>to find the moves, if these positions were in normal game? >>> >>> Jari >> >>Less that 0.055 of one second on 400Mhz. Search by selective reach 8 moves (16 >>plys) deep. >> >>Leonid. > >Are we talking about a genius here which searches FULLWIDTH? I am not sure what you want to say. If you could explain, it will be helpful. If somehow you are doubtful about numbers you can try everything on your own. Numbers that I give are exact. Leonid.
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.