Author: leonid
Date: 08:14:45 09/08/00
Hi! Please solve two mate containing positions. First is almost from the book. Just changed it a little bit to make it search for mate three moves deeper. rnb3kr/pp3pp1/7p/3q3N/3pN3/Q7/PPP2KPP/R1B1R3 w I don't know how much this position could take if solved by brute force. When I found that 6 moves took already on my program 2 min 15 sec., looked for mate in 7 only by selective search. 2rkr3/n1ppp1n1/2q1q3/NN1N1NN1/2NRN3/8/2R1R3/3K4 w This fantasy position I tried to do as accessible for every program as possible. Looked for number of nodes in the ply to be never more that 100. In this position (also created today) I don't know exact number of minimum moves that could lead to the mate. I know only that it is between 7 and 8. Was too long for me to see this by brute force. 6 moves revision took already 48 min (AMD 400Mhz). Mate is solved only by selective search 8 moves deep in 0.1 sec. Please, indicate as much about all your main parameters as you can. Try not forget your program name, hash size, selective or brute force search, speed of your computer and so like. Will be especially interested to know what impact on your search make your hash table. I don't have hash in my program to try. When I solved one position recently on Rebel 10, difference was spectacular. For 6 moves search, almost 6 fold. Rebel's hash was 28 M. With other comercial programs I can't see this that clearly. They almost never permit to put hash size to zero. Thanks, 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.