Candidates Final: A Preview of the Gelfand-Grischuk Match
Thursday, May 19, 2011 at 2:29AM
Dennis Monokroussos in Candidates 2011, Gelfand, Grischuk

Boris Gelfand and Alexander Grischuk start their match in just a few hours. It's a best-of-six game match this time around (not counting the rapid and blitz tiebreaks, if necessary), and I hope that whatever the result, Grischuk either loses or wins a game before the tiebreaks this time around. It strikes me as slightly absurd that he could win the entire Candidates event without winning a single classical game. Of course, it's also true that no one beat him that way either, and to get this far he had to make it past the top two seeds by rating.

Anyway, let's have a look at their past record. They've played each other 45 times by my count, and in classical they've broken even: +4 -4 =11. Most of the more recent decisive games have been in Grischuk's favor, though the very last classical win was Gelfand's, in the Russian Team Championship in April of 2010. In rapid and blitz, fuggedaboutit. In rapid, Grischuk leads 4-0 in wins, with eight draws. In rapid blindfold, Grischuk has a win and two draws. Finally, in blitz, Grischuk leads +4 -2 =4, though here too Gelfand can at least console himself with having won their last blitz game.*

So with Grischuk's better track record against Gelfand, better physical condition and at least equally strong nerves, I expect him to win the match unless Gelfand has some great idea when he's White that finally breaks Grischuk down. Otherwise, I expect more of the same anti-chess: hold with Black, barely try with White, and then win in rapid or blitz. I'm rooting for Gelfand, but I can't rationally pick against Grischuk at this point.

 

* I realize that those totals only make it to 44, but I'm too sleepy to go through the database again to see what I missed or miscounted. Maybe some kind soul will put the appropriate correction in the comments?

Article originally appeared on The Chess Mind (http://www.thechessmind.net/).
See website for complete article licensing information.