Author: guy haworth
Date: 06:36:07 02/14/00
Go up one level in this thread
Lars Rasmussen mentioned this problem to me the other day. He has obviously been thinking about this for some time but does not have an algorithm. Therefore, you have not missed the obvious. A similar problem is to devise an algorithm that spots (and eliminates from consideration) 'time wasting' White moves in an endgame study that allow Black to return to a previous position. It may be possible to do this 'within limits' but a general algorithm guaranteeing to remove all time-wasting moves seems to imply an open-ended amount of computing. Guy
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.