BORIS IS KING

Boris and chess problems

It is when we makes Boris work on chess problems, that we can more easily understand his "reflexion" method (based on the brute force) as well as the limits which are associated to this method when associate with a weak processor. Indeed, even in the easy cases or obvious problems (like those of this page), if the chess-board is filled with a lot of pieces or if there are few pieces but that they are very mobile (ex: Queen, Rock, bishop) it must stupidly calculate all the moves of every one of those.

Thus, even the most obvious solutions are often out of its range, unless resorting to a very huge "reflexion" time... I deliberately chose simple problems which are solved in a maximum of 3 half-moves (3 half-moves that we call MAT in 2 moves*) if not, the response time is really too long. Soon I will add examples where Boris can take more than 4 hours to find the solution of a MAT in 5 half-moves (that we call MAT in 3 moves *)...

For all the problems, the time registered on line 1st move indicates the number of minutes or hour that taken Boris to identify ALL the moves sequence carrying out to the CHECHMATE. At this time, Boris really identified a situation without any exit. When the blanking display of Boris stops, it’s indicating that he identified a CHECHMATE (for or against him) because he cannot see any more possible calculation. However, I have nevertheless make Boris calculate every white and black following answer.

That makes it possible to see the difference in time between calculations according to the number of remaining moves. You will be able to note that Boris does not keep in memory his principal line of play. Consequently, when it identified a CHECHMATE and you have played your answer, it must start again its calculation starting from the new position... This way of making shows another limit of its global playing level.

Problem 1

[dynamic version]

(Soon I will add other problems)

Problem 2

[dynamic version]