Author: leonid
Date: 05:41:20 10/02/01
[D]kq4BK/pq4QQ/2qq1P2/1NnqBnN1/3PpP2/2P2r2/RQ4qr/RQ4bb w - - I have said that this position is for "Champions" only having in mind that some people will try to solve it by brute force. Brute force is the only way to know minimal nomber of moves that lead to mate. But it could be not all the time easy. When I tried this position on two professional program, I was impressed. On Celeron 600Mhz, and with 1M of hash, one expected to solve position in around 4000 years. Other, with no hash, after around 11000000000 years of thinking expected to recognize shortest mate. Please indicate your result. 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.