Author: Robert Hyatt
Date: 07:10:12 10/27/05
Go up one level in this thread
On October 27, 2005 at 04:39:22, Uri Blass wrote: >suppose that I give you 100 random positions from games. > >How much do you need to calculate fruit2.1's static evaluation of all positions >with no computer help. > >Uri That's pretty pointless. A bubble-sort is simple compared to a heapsort. Yet how long would it take _you_ to bubble-sort 1 million entries? Or even 100? I could think of other ways to measure "simplicity" (since it is a relative term). lines of code. number of unique eval terms number of instructions executed to do a single evaluation. etc...
This page took 0.01 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.