Author: Russell Reagan
Date: 00:12:49 12/05/01
If I run any top chess program, eventually the program doesn't get any new best move. Is this because the next ply is simply taking too long, or is it because the engine isn't designed to do searches for long periods of time (like days or weeks)? In other words, is it possible to write a program that is better suited for searching to deeper depths if it were given, say, 1 year to search for the best move? Or are current algorithms about as good as we're going to get in long term analysis? Another way of phrasing this would be: Is there any difference between a program designed to analyze completed games over long periods of time and a program that plays chess at a shorter time interval?
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.