Author: Christophe Theron
Date: 19:54:20 12/26/99
Go up one level in this thread
On December 26, 1999 at 17:10:43, Frederic Friedel wrote:
>On December 26, 1999 at 14:14:28, Christophe Theron wrote:
>
>>After all this problem is only 9 or 10 plies deep. Many programs should be able
>>to solve it very quickly.
>>
>>For example Fritz and Rebel-Tiger can go to ply depth 10 in only several
>>seconds.
>>
>>Maybe I could add a line in my program to test, in case of checkmate, if the
>>last move was NxR, so I would quickly get the solution.
>>
>>Maybe there are even several solutions to this problem.
>>
>>Oops... I realize it would maybe not work. Probably the solution lays in a part
>>of the tree that is pruned early by alphabeta.
>
>No, go ahead try. You have to make a kind of helpmate engine (no alpha beta) and
>search for the specified condition.
Mmh...
In fact I was just trying to find an excuse to not do it... :)
And if a computer program finds the solution, it is less fun I think.
Christophe
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.