Author: Russell Reagan
Date: 13:47:19 02/13/04
Go up one level in this thread
On February 13, 2004 at 16:15:04, Peter McKenzie wrote: >The main difficulty in programming Go is that there is no known fast evaluation >function that is anywhere near as reliable as even the simplest chess evaluation >function. Life & death is the main problem here, and the current approach is to >put lots of local search into the evaluation function. Do you mean that one main strategy in evaluation is detecting life and death, and that this is not sufficient? Or do you mean that you try to detect life and death, but it is difficult to do? Also, thanks for your playing advice :)
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.