Author: leonid
Date: 14:35:03 05/04/01
Go up one level in this thread
On May 04, 2001 at 17:03:14, Paul wrote: >On May 04, 2001 at 16:48:44, leonid wrote: > >> >>>>In that case a solution is this following mate in 9: >> >> >>After responding, I went to see actually printed position once again. Before I >>only remembered that it is solvable by 9 moves, but it was by memory. I composed >>few closed positions before reaching the "heavy one". Light was one of them. >> >>This position is 9 moves deep. I solved it by perfect (brute force) search. So, >>you found minimum number of moves. >> >>Salut, >>Leonid. > >And the difficult one of today? In how many moves, selective & brutti frutti? :) Paul, actually if your program solved "easy" one there are very much chances that it will take easely the second "heavy" as well. It will take only much longer. If "light" position took 8 seconds then "heavy" took 7 min 08 sec. Before by mistake I said to one man 10 min. 42. I glanced over wrong number. I don't know exactly the number for "heavy" but I suspect that it is 13 moves. I went in it by brute search as far, as 10 moves. It took already 2 hours and 7 min. For 11 it should take up to 12 or 18 hours. I am not sure that I will do so. Probably Heiner can. Under the question mark is only 11 and 12 moves. In 13 moves we have mate for certain. If you will have patience, try to solve by 13 moves. Usually we have identical responses on selective search. Coincidence was visible twice for the last few positions. For now, frankly, you impress me. Salut, Leonid. >I've still got Pretz chewing on it in the background, but so far ... nothing! > >It's best move now is Qexd7+ ... will have to change my move ordering for the >next one I'm afraid, this is taking way too long. > >Groetjes, >Paul
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.