Author: Uri Blass
Date: 10:52:14 08/28/05
Go up one level in this thread
On August 28, 2005 at 13:20:32, F. Huber wrote: >On August 28, 2005 at 13:05:36, Mike Byrne wrote: > >>CCC arhives indicated no pc program was able to solve this in the late 90's. In >>2002, Ruffian was reported to solve fairly quickly. >> >>Crafty Classic 2005 >>Black(1): [d]1r4r1/3q1npk/2b1pbnp/Rp1p4/1N1P3P/2PQ1pP1/1K3B2/5B1R w - - 0 1 >> >> 14 26:48 Mat15 1. Qxg6+ Kxg6 2. Bd3+ Kh5 3. g4+ Kxg4 >> 4. Rg1+ Kh3 5. Bf1+ Kh2 6. Bg3+ Kxg1 >> 7. Ra1 Ra8 8. Rb1 Ra1 9. Kxa1 Ra8+ >> 10. Kb2 Ra1 11. Kxa1 Qa7+ 12. Kb2 Qa1+ >> 13. Kxa1 f2 14. Bh3+ f1=Q 15. Rxf1# >> (s=2) > >And ChestUCI 2005 in 9 sec (on a slow Celeron/400)! ;-) Unfair comparison. When you already give it conditions for special mate of course it has an advantage. It is the same as comparison between 2 humans in the speed of solving some problem when one of them got a hint that helped him to solve the problem faster. The chess playing programs even do not know that they need to search for mate when chest not only knows that it needs to search for mate but also know about some restrictions in the search. I guess that chest may be able to prove forced mate even faster if it is modified to get more restrictions about the moves. For example tell it that white must choose the moves at the bottom of this post when the only freedom of white to choose different moves is if black does not follow the pv and I am sure that it may prove a forced mate faster. 1. Qxg6+ Kxg6 2. Bd3+ Kh5 3. g4+ Kxg4 4. Rg1+ Kh3 5. Bf1+ Kh2 6. Bg3+ Kxg1 7. Ra1 Ra8 8. Rb1 Ra1 9. Kxa1 Ra8+ 10. Kb2 Ra1 11. Kxa1 Qa7+ 12. Kb2 Qa1+ 13. Kxa1 f2 14. Bh3+ f1=Q 15. Rxf1# 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.