Author: Michael Neish
Date: 03:08:51 11/17/05
Hi, I haven't posted here in a long while. I've been running my eyes over the source code for Fruit 2.1, and as a result have a couple of questions which I'd much appreciate if anyone could answer. Firstly, is this the code that has been estimated to play at an Elo of around 2700? If so, at first glance the code looks rather compact compared to that of other programs, so what's the secret? What I mean is, is there anything that the code is doing that's significantly different from what others are doing, e.g. extensions implemented in a new way, a more effective evaluation function, and so on? Thanks in advance. Best regards, Mike.
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.