Ken Thompson: Moscow adventures (2)

by Frederic Friedel
1/5/2020 – In the early 1980s, FREDERIC FRIEDEL spent a week in Moscow with Unix pioneer Ken Thompson, who was supposed to demonstrate his computer chess world champion machine Belle to the Soviet Chess Federation, and to former World Champion Mikhail Botvinnik, who was developing a rival strategy in chess programming. He takes us on a trip down memory lane. Read part 1.

Master Class Vol.10: Mikhail Botvinnik Master Class Vol.10: Mikhail Botvinnik

Our experts show, using the games of Botvinnik, how to employ specific openings successfully, which model strategies are present in specific structures, how to find tactical solutions and rules for how to bring endings to a successful conclusion


Part 2

In 1982, the Soviet Chess Federation and legendary chess world champion Mikhail Botvinnik invited Ken Thompson, the creator of the world champion computer "Belle", to demonstrate this hardware chess machine in Moscow. An invitation was also extended to him by the former World Champion Mikhail Botvinnik. As a friend of both Ken and Botvinnik I too was invited, and embarked on an adventurous trip-of-a-lifetime. (Continued from Part 1...)

Sleight of hand

The lunch included Botvinnik's programming team, and in the afternoon we at last got to discuss their efforts to implement a highly selective search, using criteria defined by the great world champion, to drastically reduce the number of positions a chess program had to generate and evaluate before it made a very strong move. They could not show us the computer or their program, but spent a fair bit of time explaining how it could find the famous bishop sacrifice that their mentor had played against the former World Champion José Raúl Capablanca in the Avro Tournament in 1938.


You can replay the whole game (it's the second example). The bishop sacrifice, Ba3!!, occurs on White's 30th move. The replayer has a fan icon below the board which you can use to start a chess engine, which even runs on an Android phone, where it plays the bishop sacrifice in less than a second.

Botvinnik's Intelligent Programming team explained very eloquently how their algorithms found the bishop sac for purely positional reasons in a couple of minutes. It sounded very convincing — it was clear that they had provided this explanation to experts many times before. 


At this stage Ken asked them about a position he had given Belle. It is from a 1913 game in Paris, when the future World Champion Alexander Alekhine sacrificed his queen, and announced a mate in ten. He played 22.Qh5+!! and won after 22…Nxh5 23.fxe6+ etc., leading to mate. "Belle cannot find this move in reasonable time," Ken said.

Immediately the intelligent-method team started to apply their algorithms on the position, using paper and pencil to do so. Botvinnik looked on with pride. But his approving smile froze when he noticed that I had removed the white pawn on h2. As one of the strongest chess players of all time he realized that without that pawn it was not a mate, and 22.Qh5+ was a terrible mistake that in fact lost the game. Still, it did not disturb his computer team: after considerable calculation and enthusiastic discussion they came to the conclusion: "Our program will find 22.Qh5+!!, definitely, in under two minutes." It was the "dynamics" in the position that allowed it to do so. Our conclusion (not shared with them): if these guys had a computer and a program at all, they were mainly trying to tune it to find the famous Botvinnik-Capablanca bishop sacrifice.

You can listen to Ken describe his involvement in chess, building chess machines, and the trip to Moscow in the above May 2019 interview with Brian Kernighan. It gives you an impression of what Ken is is like, even today – the things he has done and the way he narrates episodes from his life. It will also tell you why I went to stay in his home, first in New Jersey and then California, around twenty times during the last forty years.

Dinner at Vladimir's

During our stay in Moscow we also visited a rival computer team, led by Vladimir Alazarov, a mathematician and computer scientist (shown on the left in this picture), and Mikhail Donskoy (on the right), computer scientist and system programmer. Ken’s in the middle in this photo taken a couple of years later by Prof. Monroe Newborn.

These scientists had written KAISSA, a traditional brute force program that won the first Computer Chess World Championship in 1974.

One evening we were invited to dinner at Vladimir Alazarov’s home. The lunch at Botvinnik’s dacha had warned us of what we could expect. We were shown around the Alazarov flat. In the dining room there was a sumptuous buffet on the table, and when they showed us the kitchen Ken instructed me to stay behind and look for any additional food they could be hiding. I checked carefully and assured him there was nothing else. So we could really tuck in with the buffet. But when we were finished Vladimir and his wife opened a concealed oven door in the kitchen and pulled out — big roasts, steaming potatoes, vegetables and salads. Ken said I had failed him badly.

One more tale about the Alazarov visit. After we had barely survived the meal Vladimir said: “Now we drink vodka!” This was a signal for all the ladies to get up and leave the room. Vladimir got three bottles and three glasses and set them on the table. He opened one bottle, poured a shot into a glass and drank it — like tasting wine before you serve it to your guests. But then he poured a second glass, and drank it too. “Can I have some?” I asked, and he replied “Yes, drink!”, gesturing at my bottle. That was when I realized that the three bottles were intended for the three of us, one bottle each. “No, I can’t drink that much,” I said, and poured myself a shot from his bottle. Ken did likewise. That evening he and I drank two small shots each — in the meantime Vladimir finished the rest of his bottle, opened mine and drank half of it. It was strong vodka, tasting a bit like lighter fuel, and the two shots made me feel quite dizzy. But Russians, I have discovered, have different livers and can take ten time more than me. Vladimir remained perfectly steady and lucid all evening, while I was already slurring my consonants after the two glasses.

There is one final tale from Moscow, but it is not related to chess. If you are interested you can read the rest of the story here on my biographical blog.

Master Class Vol.10: Mikhail Botvinnik

Our experts show, using the games of Botvinnik, how to employ specific openings successfully, which model strategies are present in specific structures, how to find tactical solutions and rules for how to bring endings to a successful conclusion



Editor-in-Chief emeritus of the ChessBase News page. Studied Philosophy and Linguistics at the University of Hamburg and Oxford, graduating with a thesis on speech act theory and moral language. He started a university career but switched to science journalism, producing documentaries for German TV. In 1986 he co-founded ChessBase.


Rules for reader comments


Not registered yet? Register