Author: Janosch Zwerensky
Date: 13:22:22 02/13/04
Go up one level in this thread
Hi, >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. As a go programmer, do you think that building a go machine as in "doing the local life and death searches in hardware" would significantly improve things? Regards, Janosch
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.