Solved by 95 users: ...
Time limit = 3
Chess. We have free figures on the board. White: King, Queen. Black: King.
White King is on c3 and should not move.
Black King is trying to survive as long as possible.
Given White Queen and Black King positions you should find minimal
number of moves until checkmate.
In the first line the posision of White Queen is given.
In the second the position of Black King.
The situation in input is correct, i.e. all figures have different positions and
and whites could not kill Black King next move.
6 September 2003
<PREV | Problem set | Search related messages | NEXT>