Author: Uri Blass
Date: 02:36:25 03/26/03
Go up one level in this thread
On March 26, 2003 at 04:49:19, Jouni Uski wrote: >With current hardware and excellent programs almost all test positions posted >here are solved by some programs - and in many cases stunningly fast even if >original poster says something like "impossible" or "very difficult". >My question: is it still possible to find test positions which no program is >able >to solve in lets say 60 minutes?! Let's forget Nolot positions and collect at >least >30 new "unsolvable by 2003" positions. > >Jouni Of course there are positions that no program can solve in an hour. The question is what do you mean when you say unsolvable by 2003. If the positions can be taken from previous years then I think that there should be no problem to find them. You can take studies and I suspect that it is possible that no chess playing program is able to solve one of my studies in an hour and you will have no problem to find 30 problems composed by humans when no program can solve them in an hour. Uri
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.