Author: Uri Blass
Date: 03:24:33 08/05/02
Go up one level in this thread
On August 05, 2002 at 05:18:06, Georg v. Zimmermann wrote: >Nice article, thx for sharing ! > > >On August 04, 2002 at 17:26:21, Terry McCracken wrote: > >>In an Ancient Game, Computing's Future >>By KATIE HAFNER >> >> >>Part of the challenge has to do with processing speed. The typical chess program >>can evaluate about 300,000 positions per second, and Deep Blue was able to >>evaluate some 200 million positions per second. By midgame, most Go programs can >>evaluate only a couple of dozen positions each second, said Anders Kierulf, who >>wrote a program called SmartGo. > >Well that is not because Go is difficult, but because most Go programmers seem >to try to use the Botvinnik "method". IMHO this will never work. What is the botvinik "method" I know no chess program who tried to use that method. I remember that I read about his ideas but the problem is that there was no clear definition of his ideas. 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.