Author: Vincent Lejeune
Date: 03:04:38 06/25/03
Go up one level in this thread
On June 25, 2003 at 05:48:16, Uri Blass wrote: >On June 25, 2003 at 05:25:28, Russell Reagan wrote: > >>On June 25, 2003 at 05:16:17, Uri Blass wrote: >> >>>20 is possible with no castling right. >>> >>>Here is my try. >>> >>>[Event "Edited game"] >>>[Site "F3K9V7"] >>>[Date "2003.06.25"] >>>[Round "-"] >>>[White "-"] >>>[Black "-"] >>>[Result "*"] >>> >>>1. Nc3 b5 2. Nxb5 Nf6 3. Nxa7 Ne4 4. Nxc8 Nc3 5. Nxe7 Nb1 6. Rxb1 g6 7. >>>Nxg6 h5 8. Nxf8 h4 9. Nxd7 h3 10. Nxh3 c5 11. Nxc5 Ra4 12. Nxa4 f5 13. Rg1 >>>f4 14. Nxf4 Rh3 15. Nxh3 Na6 16. Rh1 Nb4 17. Ng1 Nd5 18. Ra1 Nc3 19. Nxc3 >>>Qd7 20. Nb1 Qd8 >>>* >>> >>>Uri >> >>Very nice Uri! You always seem to do very well at these kinds of puzzles. > >Interesting to know what is the result of programs that are designed to solve >these puzzles. > >I read that there is a program that can compose games when it gets the final >position. > >Unfortunately I do not remember it's name. It's probably Natch : http://natch.free.fr/Natch.html > >I remember that the idea is to evaluate distance between every 2 positions >a program can by searching choose the move that lead to the smallest distance >every time until it finally get the final position. > >The distance may be some estimate for the number of moves that are needed when >in a lot of the cases it may be infinite so the move can be pruned. > >Uri
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.