Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: The problem I will never forget in my lifetime!!

Author: blass uri

Date: 03:13:35 02/16/00

Go up one level in this thread


On February 16, 2000 at 04:56:00, Andreas Stabel wrote:

>On February 16, 2000 at 01:37:13, Rajendran Ramachandran wrote:
>
>>Hi!
>>
>>
>>Position: 8;8;5K2;8;8;8;4Q3;7k white to play and mate in a maximum of twelve
>>moves without touching white's king.
>>
>>To avoid any ambiguity about position, let me explain that there are ONLY three
>>pieces on the board!
>>
>>White King  on f6
>>White Queen on e2
>>Black King  on h1
>>
>>
>>The only condition is White's king is untouchable.....meaning that you are not
>>allowed to move it! You are allowed to take help from any chess program except
>>Hiarcs.
>>
>>I am sure you will enjoy this and show this to your friends as well! Above all
>>it is very hard to forget this as it is so simple to understand and remember but
>>difficult to solve!
>>
>>I have not created this one but if my memory serves me right, this problem was
>>created by a computer of stone age!!!
>>
>>Thanks.
>>
>>raj
>
>I seem to have found a solution with max. 9 moves:
>1. Qf3 Kh2 2. Qf1 Kg3 3. Qe2
>   3... Kh4 4. Qg2 Kh5 5. Qg5#
>   3... Kh3 4. Qf2 Kg4 5. Qe3
>      5... Kh5 6. Qg3 Kh6 7. Qg6#
>      5... Kh4 6. Qg5+ Kh3 7. Qg1 Kh4 8. Qg2 Kh5 9. Qg5#
>   3... Kf4 4. Qd3 Kg4 5. Qe3
>      5... Kh5 6. Qg3 Kh6 7. Qg6#
>      5... Kh4 6. Qg5+ Kh3 7. Qg1 Kh4 8. Qg2 Kh5 9. Qg5#
>
>Regards
>Andreas Stabel

You ignore the possibility 1.Qf3 Kg1

This position is not hard to solve.
You only have to analyze all the possible positions of white queen and black
king and find all the mate in 1 positions, all the mate in 2 positions...

This is the way computers generate tablebases but in this case the size of the
tablebases is small enough so humans with enough time can solve it

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.