Author: Dann Corbit
Date: 13:46:22 01/18/00
Go up one level in this thread
On January 18, 2000 at 16:23:41, Jeremiah Penery wrote: >On January 18, 2000 at 14:45:56, Dann Corbit wrote: > >>It might be an interesting test to trace backwards from the solution to see >>exactly how deeply computers *can* find the solutions (or it may also reveal if >>there is a bug in them). > >Do you mean like this? > >--- >1) Go to the end of the provided analysis. Note the depth at which program 'x' >sees itself 'winning'. (This is not quite valid for #11, at least, in which >black can force a draw.) > >2) Back up one move at a time, until the program no longer likes the move given >in the analysis. > >3) Note the depth at which the program _does_ like the analysis move. Else, try >and find out why it doesn't. > >4) Proceed until the initial position is reached. Exactly. Only I don't think you will ever get to the initial position. The question is "How close can we get?" If we could get there, then we could just calculate from that position to start with.
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.