Author: Georg v. Zimmermann
Date: 04:52:37 02/16/02
Go up one level in this thread
Hi, I read a lot of papers on Go programming yesterday. Whenever the Go programmers compare chess programming to Go to explain why Go programming is so hard they started making funny (not necessairly all wrong) statements. Here are examples: B. Bouzy T. Cazenave page 5 08/06/01 " Moreover, experiments in Chess have established a correlation between tree search depth, and the level of the resulting program. " 1997/2000, Arnoud van der Loeff , TurboGo " Chess programs rely heavily on "brute force", meaning that they will simply calculate every possible move sequence there is until they reach a certain depth. Since Go has many more legal moves, this is simply not possible. " :-) Georg
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.