Author: Dustin Moore
Date: 14:35:21 11/26/03
Go up one level in this thread
>You surely mean "... how many decillion decillions of Terabytes it would take >... ". What if you only recorded the results where a 30 ply search returned a result that was significantly different than what a 13 ply search would reveal? This would be a real test of static evaluation functions. The world's best static evaluation function would create the smallest uber-tablebase. This would be a great way to study static evaluation functions too. Unlease a genetic classifying algorithm or a heuristic search engine on the tablebase and use it to improve the static evaluation.
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.