Author: Heiner Marxen
Date: 12:12:37 12/26/02
Go up one level in this thread
On December 26, 2002 at 10:54:46, Vladimir Medvedev wrote: >On December 25, 2002 at 23:23:48, Drexel,Michael wrote: > >>[D] Q2Q2Q1/1R6/3BR3/3k3N/2RB2Q1/5R2/Q2Q2Bp/3N3K w - - 0 1 >> > >Another problem: find the shortest move sequence from initial position to this >one :)) > >I think it is not very difficult, but I don't know is there is any software for >solving puzzles like this. Does anybody know? Yes, that can be very difficult. It is a special kind of retrograde analysis, called the "shortest proof game". See e.g. http://www.stanford.edu/~hwatheod/Retractor/ for a program. There are others, too. Cheers, Heiner
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.