Monday, December 25, 2017

Invisible moves part 2

Once I got the questions of an exam in advance from a classmate at the university. His cousin followed the same studies at another university. Besides one of those courses was teached by the same professor. As his exams for that course were a couple of days earlier than ours, we were able to study carefully the questions he got. Later it became clear that the professor didn't take this scenario into account as we got exactly the same questions of the cousin. Of course we all scored extremely high at the exam.

This is also valid for chess. Things which we saw earlier, will be recognized and solved much easier. This effect we clearly see at tactic-servers. Although some solvers have very moderate otb-ratings, they manage to obtain very high online tactic-ratings. Chess.com-member 2012VAChamp is the leader today with a stunning rating of 6482 elo (best Belg at chess.com Superdog-II has only 2900). 2012VAChamp explains at his profile that he has memorized all +3000 elo excercies. He estimates that there are about 500-1000.

For me this is the most important reason to not solve more than 5 each day. As non-paying member you are anyway not allowed to solve more than 5 but I could bypass this limit by using my FM-title and request the diamant-status. Besides I see that Warre De Waele has just requested this status as his tournament-victory in Le Touquet (see e.g. holidays part 3) put the foundation of the new FM-title. Nonetheless despite maximum 5 exercises each day, I notice some I have solved once before. The one below I managed recently to solve in only a couple of seconds as it was already the second time presented to me. I was able to recognize the position instantly and only the mouse-clicks took a couple of seconds.

Some people indicate that they solve the same exercises 20 or more times. This has nothing to do anymore with practicing tactics but rather shows how eager they are to get an extremely high tactic-rating. Vanity is still a very wide-spread human weakness and at the same time a source of schadenfreude. It is why the English program Keeping Up Appearances was extremely popular in the 90's.

Once those people are sitting at the board then not much is left of their tactical wizardry. Then simple exercises are unsolvable. Without the memorization they are helpless. Their online tactic-ratings would be very different if the server would process only fresh positions. Unfortunately this won't happen soon as you need a huge database to keep track of all the records of all members (today this is only done for the 25 most recent solved exercises).

The megadatabase seems to me a better tool to define the difficulty of a specific position not only more accurately but also at a much larger scale. In my previous article invisible moves I already indicated this can be done only for opening-positions. This time I want to add that we should only focus at positions not played at the professional-level as mistakes are immediately detected and corrected.

Especially the first round of open tournaments very often generate some interesting stuff to study. Besides the miniatures where the stronger player swiftly punishes the mistakes of the weaker player, we also detect games in which the win occurs less smoothly. That was definitely the case in my first round of the last Open Leuven against Mats Bakker.

Afterwards I found 8 games in the megadatabase with the same position after white's 7th move. In none of them the right move was played while 1 time it was even missed by a grandmaster of Azerbaijan: Azer Mirzoev see game. Further online I also missed it already twice but I very rarely study blitz-games see the (non-)sense of blitz.

This position breaks my previous personal record as most invisible move in my career. In my article scholar's mate I wrote about how popular books about tricks and traps are. So I think it could be a good idea once to collect the most invisible moves from the megadatabase and bundle this into a book. Likely this will be a very original piece of work for which surely some interest will exist.

Brabo

No comments:

Post a Comment