Author: Peter Schäfer
Date: 00:58:33 01/26/04
Go up one level in this thread
On January 25, 2004 at 16:34:26, Bob Durrett wrote: > >Rather than post one taken out of one of my books, lets just ask the general >question. It would seem that award-winning composed problems [and studies] >would be really tough for computers to solve just as they are for humans. > >Is that true? Solving composed problems is mainly a question of pure tactical computation. Position evaluation and many pruning techniques are virtually useless. There are dedicated problem solvers like alybadix or popeye, that will do better than game playing engines. Endgame studies are different: if an engine plays the endgame well, it can also handle studies. By the way, award-winning problems are not necessarily harder to solve; they are usually judged by their aesthetical values.
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.