BPCF 2019 - XIV Београдски фестивал проблемског шаха 2019.

Branislav Djurašević

GradUal Endgame Solving Show (GUESS) 2019

dynamic endgame show: solving move by move

Belgrade, 24th May

Inventor & Director: Branislav Djurašević

On a demonstration chessboard, monitor, or screen, the solver sees the initial position of a study. After a couple of minutes or so (the time is set differently for each move), the solver has to write down his move, which is either correct or incorrect. The solver may choose not to write a move, in which case he must enter any word — we suggest the word “guess”(the acronym of the solving system name).

The judge (with his assistants, if possible) checks to see if the move (correct, incorrect, or the word “guess”) is written every time, so that no solution could be entered at a later time. After every half-move, the judge plays out the correct move from the main variation on the board, or the correct move appears on the monitor or screen. This applies equally to the white's and black's moves. It means that the current position is always solved.

The time allocated for each move varies, and will be longer for key positions and shorter for moves that should require less thinking. The correct solution for either a white's or a black's move brings a certain amount of points (between +1— ordinary move and +4 — brilliant or hidden move), while an incorrect solution brings -0.5. With this relatively small amount of punitive points, solvers are encouraged to write down their moves rather than skip them.

The judge has the right not to award a score to certain moves, mainly if he considers them too ordinary. At the end, the judge sums up the points, or the participants do that among themselves (like in a Machine Gun solving competition).

In the case of an equal number of points, the advantage in the final ranking will be given to those who have solved more key moves with the highest points (the study highlights). The second criterion is that the advantage in the final ranking will be given to the solvers who have correctly solved the earliest moves, sequentially, starting from the first move of the white.

Steffen Nielsen

Original for StrateGems 2019

white Qa7 Kg1 Rh4 Sb3 black Qc3 Pg3e6 Kd1 Bc8 Rb8



1.Rh4-d4+! {[1]} Kd1-e2 {[1]} 2.Rd4-e4+ {[3]} Ke2-f3 {[1]
} 3.Qa7-g7 ! {[3]} Qc3-c5 + {[1]} 4.Re4-d4 {[2]} Qc5-f5 !{[2]
} 5.Sb3-d2 + {[2]} Kf3-e3 {[1]} 6.Sd2-f1 + {[3]} Qf5*f1 + {[2]
} 7.Kg1*f1 Rb8-b1 + {[1]} 8.Kf1-g2 Bc8-b7 + {[1]
} 9.Kg2-h3 {[1]} Rb1-h1 + {[1]} 10.Kh3-g4 {[1]} Bb7-f3 + {[1]
} 11.Kg4-g5 Rh1-h5 + {[1]>} 12.Kg5-g6 {[1]} g3-g2 {[1]
} 13.Qg7-a7 ! {[3]} Rh5-a5 {[3]} 14.Qa7-b6 ! {[3]} Ra5-b5 {[2]
} 15.Rd4-d3 + {[2]} Ke3*d3 16.Qb6*b5 + {[1]

6x3 = 18, 6x2 = 12, 15x1 = 15
TOTAL = 45 points

Final Results

Rank Name Ctry Pts
1 Dragan Stojnić flag 37
2 Dmitry Pletnev flag 35
3 Dinu-Ioan Nicula flag 34.5
4 Marcos Roland flag 31.5
5 Мarjan Kovačević flag 29
5 Ilija Serafimović flag 29
7 Miodrag Radomirović flag 27.5
8 Zoran Sibinović flag 24
9 Djurica Serafimović flag 12

GUESS Competition


Guess the third white move

Best SRB solvers

Solvers are looking for the best move

© Matplus 2017 - 2022
Site author: Borislav Gadjanski