Author: Frank Schneider
Date: 08:47:05 04/12/01
Go up one level in this thread
On April 12, 2001 at 08:33:04, leonid wrote: >Hi! > >If you like to solve one not long and easy mate, here you have one: > >[D]r1n1kn1r/bP1bqpP1/NB1nq1BN/Qq2n1qQ/1N4N1/2Q2Q2/3RR3/3K4 w - - > >Please indicate your result. Gromit 3.8.2 on a Celeron 500 announces mate in 7 after Nc7+ after 38sec. (iteration 5). > >If you use your own program (written by you) and you have made special effort >for making its mate solving part more efficent, it will be very nice if you will >say how it was written. Normal extensions: checks, only evasions, ... Frank > What general approach is in your program logic for >solving the mate, if it is not a state secret. How often you came back to this >part of your program in order to change something in it. Don't be affraid to put >some extra words in description of your writting process. At least for me it >will be interesting. > >Thanks you very much! >Leonid.
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.