Donald Michie

Home * People * Donald Michie



Donald Michie, (November 11, 1923 – July 7, 2007  ) was a British researcher and pioneer in artificial intelligence and game theory. During World War II, Michie worked with Alan Turing at Bletchley Park, with Jack Good and Shaun Wylie et al. in the section Newmanry headed by Max Newman, contributing to crack the German Lorenz cipher. In 1947-48, along with Wylie, Michie designed Machiavelli, a rival of Turing's Turochamp program.

Michie was head of the University of Edinburgh's Department of Machine Intelligence from 1965 until 1985, when he left to found the Turing Institute in Glasgow. Michie researched on game theory and computer games and chess. He was a close friend of David Levy and involved in the famous Levy Bet with John McCarthy, which occurred during an AI-workshop in Edinburgh, where Michie affirmed McCarthy to take the challenge by David Levy and even want to share the bet on McCarthy's site.

=Photos= Jean Hayes Michie and Donald Michie, Edinburgh 1984

Donald Michie receiving his honorary degree from Stirling University in 2003 =Machine Learning= Michie began his first experiments in machine learning in 1960. His tic-tac-toe machine MENACE (Machine Educable Noughts And Crosses Engine) demonstrated the basic principle of a self-reinforcing learning mechanism. MENACE employed Michie's conceptually simple general-purpose learning algorithm BOXES    which could also discover robust control strategies for the pole balancing problem , but was soon employed industrially to evolve strategies for automatic control, such as controlling a steel mill.

Self build MENACE by James Bridle in the traditions of Heath Robinson and Charles Babbage

=The Need for Search= In King and Rook Against King: Historical Background and a Problem on the Infinite Board at the first Advances in Computer Chess conference, Donald Michie shows two positions, that are identical except one pawn, to demonstrate the need for search. =Chess Endgames= Quote by Maarten van Emden in I remember Donald Michie :

In 1980 I spent another summer in Edinburgh as a guest of Donald Michie. Since the low point of 1975, thanks to assiduous and inventive joint pursuit of funding possibilities by Donald and Jean, the Machine Intelligence Research Unit was alive with work focused on chess endgames. There were students, including Tim Niblett and Alen Shapiro. Danny Kopec was there, perhaps formally as a student, but de facto as the resident chess consultant. Ivan Bratko visited frequently. Alen was the administrator of the dream computing environment of that time: a small PDP-11 running Unix. ...

Donald Michie demonstrated the Human Window phenomenon with chess end games. He proposed a form of describing end-game knowledge that he called “advice” and described a formal language, Advice Language One, for expressing such advice. The language could be translated into a form that guided a computer to play the end-game at the level of skill of a chess expert. Soei Tan, Ivan Bratko and Danny Kopec were chess experts who used this framework to implement specific end games.

Once again, I did not get it. I could not help acting in my then usual role of Prolog evangelist and wanted to demonstrate that the beauty of Prolog was that it rendered superfluous things like Advice Language One. Accordingly I wrote a Prolog program that played an end game using Advice in DM’s sense. DM generously allowed me my say in a paper in the Tenth Machine Intelligence workshop. It’s a nice paper, but it does not get it.

=Solving Chess?= Quote by Kathleen Spracklen on Donald Michie and their experiments, excerpt from Oral History of Kathe and Dan Spracklen :

One of the most thrilling times of my entire life was the month that Dr. Donald Michie spent with us in San Diego. And he, of course, is - was head of the computer science department at Oxford, I believe, for decades. He was on the original team with Turing that broke the Enigma code. And already he was quite an elderly gentleman when he came to work with us but that wasn't stopping him from having a very full schedule as the head of the I think it was the Turing Institute in Glasgow that headed up. Quite, totally an amazing human being.

Delightful and totally amazing. And he had this concept that he wanted to try out that he thought might possibly solve computer chess. And we spent a month exploring it. It was the idea of reaching a steady state. The idea was that you would establish a number of parameters of positional analysis and your program would score, independently score vast arrays of positions using this set of known parameters. And then the program would basically perform a cluster analysis and so you'd do it on a number of positions and on game after game after game of Grand Master Chess. You submitted we just we used hundreds of thousands of positions.

And then what it did was it took the evaluation that known chess theories said this position is worth this much. So we had an external evaluation because it came out of known Master Chess games. And then we had all of these parameters that our program was capable of evaluating and then you used this data to tune your weighing of the parameters. And you could also tune the weighting for different stages of the game. So at the opening, you could use a certain weight, mid-game, you could use a certain weight, in the midst of your king being attacked, could use a set of weights, when you're pressing an attack, you could use a set of weights, when they're past pawns on the board, you know, there were several different stages of the game that could have different weightings. And we used a program called Knowledge Seeker that helped you to determine these relative weightings. And so after a month of training the program, what you basically did was you take your total set of positions and you would use something like 80% of them as a training set and then the last 20 as the test set. And you'd find out, well, how did the program do in evaluating these positions it had never seen based on these that it had seen. And it did just a breathtaking job of determining the correct worth of the positions. And so we were so excited. We were going to turn it loose on its first play a game of chess. We were going to use this as the positional evaluator.

Yeah. It was, like, oh, it was breathtaking. And we watched the program play chess. It was- you could gasp for breath. No computer program ever played a game of chess like that. It looked like an incredibly promising seven-year-old. We lost the game in just a few moves but it lost it brilliantly. It got its queen out there, it maneuvered its knight, it launched a king side attack, it sacrificed its queen. Well, of course it sacrificed its queen. Do you realize, in every single Grand Master game of chess, when you sacrifice your queen, it's phenomenally brilliant. You are winning the game. So if you can find a way to get your queen out there and sacrifice her, well, you've won.

=AI as Sport= Quote by John McCarthy from AI as Sport  :

Besides AI work aimed at tournament play, particular aspects of the game have illuminated the intellectual mechanisms involved. Barbara Liskov demonstrated that what chess books teach about how to win certain endgames is not a program but more like a predicate comparing two positions to see if one is an improvement on the other. Such qualitative comparisons are an important feature of human intelligence and are needed for AI. Donald Michie, Ivan Bratko, Alen Shapiro, David Wilkins, and others have also used chess as a Drosophila to study intelligence. Newborn ignores this work, because it is not oriented to tournament play.

=See also=
 * From Codebreaking to Computing - Video from The Computer History Museum
 * Machiavelli

=Selected Publications=

1945

 * Jack Good, Donald Michie, Geoffrey Timms (1945). General Report on Tunny from The Turing Archive for the History of Computing

1960 ...

 * Donald Michie (1961). Trial and Error. Penguin Science Survey
 * John Maynard Smith, Donald Michie (1961). Machines that play games. New Scientist, 12, 367-9. google books
 * Jim Doran, Donald Michie (1966). Experiments with the Graph Traverser Program. Proceedings of the Royal Society, Series A, Vol. 294, No. 1437
 * Donald Michie (1966). Game Playing and Game Learning Automata. Advances in Programming and Non-Numerical Computation, Leslie Fox (ed.), pp. 183-200. Oxford, Pergamon. » Includes Appendix: Rules of SOMAC by John Maynard Smith, introduces Expectiminimax tree
 * Donald Michie, Roger A. Chambers (1968). Boxes: An experiment on adaptive control. In E. Dale and D. Michie, editors, Machine Intelligence 2, Edinburgh: Oliver & Boyd, pp. 137-152, pdf

1970 ...

 * Donald Michie (1974). On Machine Intelligence. Edinburgh: University Press, ISBN 10: 085224262X, ISBN 13: 9780852242629, abebooks.com, alibris.com, biblio.com
 * Donald Michie (1976). AL1: a package for generating strategies from tables. ACM SIGART Bulletin, Issue 59
 * Donald Michie (1976). An Advice-Taking System for Computer Chess. Computer Bulletin, Ser. 2, Vol. 10, pp. 12-14. ISSN 0010-4531.
 * Donald Michie (1977). King and Rook Against King: Historical Background and a Problem on the Infinite Board. Advances in Computer Chess 1
 * Donald Michie, Ivan Bratko (1978). Advice Table Representations of Chess End-Game Knowledge. Proceedings 3rd AISB/GI Conference, pp. 194-200.
 * Ivan Bratko, Danny Kopec, Donald Michie (1978). Pattern-Based Representation of Chess Endgame Knowledge. The Computer Journal, Vol. 21, No. 2, pp. 149-153. available as pdf reprint
 * Donald Michie (1979). The Computer Attacks Moravec Problem. Personal Computing, Vol. 3, No. 10, pp. 73

1980 ...

 * Donald Michie (1980). Chess with Computers. Interdisciplinary Science Reviews. Vol. 5, No. 3, pp. 215-227. ISSN 0308-0188.
 * Ivan Bratko, Donald Michie (1980). An Advice Program For a Complex Chess Programming Task. Computer Journal, Vol. 23, No. 4, pp. 350-353.
 * Ivan Bratko, Donald Michie (1980). A Representation of Pattern-Knowledge in Chess Endgames. Advances in Computer Chess 2
 * Donald Michie (1981). A Theory of Evaluative Comments in Chess with a Note on Minimaxing. The Computer Journal, Vol. 24, No. 3, pp. 278-286. reprinted in Computer Chess Compendium
 * Jaap van den Herik (1981). Computer Chess Today and Tomorrow: An Interview with Donald Michie. Advances in Computer Chess 3, Computer Chess Digest Annual 1984
 * Donald Michie (1982). Chess with computers. Machine Intelligence and Related Topics. Gordon and Breach Science Publishers.
 * Donald Michie (1982). Information and Complexity in Chess. Advances in Computer Chess 3
 * Danny Kopec, Donald Michie (1983). Mismatch between machine representations and human concepts: dangers and remedies. FAST series No. 9 report. European Community, Brussels.
 * Donald Michie (1986). The superarticulacy phenomenon in the context of software manufacture. Proc. Roy. Soc. (A).
 * Donald Michie (1986). Towards a Knowledge Accelerator. Advances in Computer Chess 4
 * Alen Shapiro, Donald Michie (1986). A Self-commenting Facility for Inductively Synthesised Endgame Expertise. Advances in Computer Chess 4
 * Donald Michie, Ivan Bratko (1987). Ideas on Knowledge Synthesis Stemming from the KBBKN Endgame. ICCA Journal, Vol. 10, No. 1
 * Donald Michie, Ivan Bratko (1987). Ideas on Knowledge Synthesis - a Correction. ICCA Journal, Vol. 10, No. 2
 * Donald Michie (1989). Automating the Discovery of Structure in Time-Varying Data. Workshop on New Directions in Game-Tree Search
 * Donald Michie (1989). Brute Force in Chess and Science. ICCA Journal, Vol. 12, No. 3
 * Donald Michie, Michael Bain (1989). Machines That Learn and Machines That Teach. SCAI 1989
 * Donald Michie, Andrew Paterson, Jean Hayes Michie (1989). Learning by Teaching. SCAI 1989
 * Stephen Muggleton, Michael Bain, Jean Hayes Michie, Donald Michie (1989). An Experimental Comparison of Human and Machine Learning Formalisms. 6. ML 1989, pdf

1990 ...

 * Donald Michie (1990). Brute Force in Chess and Science. Computers, Chess, and Cognition
 * Donald Michie, Ivan Bratko (1991). Comments to Chunking for Experience. ICCA Journal, Vol. 14, No. 1
 * Stephen Muggleton, Donald Michie (1997). Machine Intelligibility and the Duality Principle. Software Agents and Soft Computing 1997
 * Jean Hayes Michie, Donald Michie (1998). Simulator-Mediated Acquisition of a Dynamic Control Skill. AI & Sociaty Vol. 12 No. 1

2000 ...

 * Pamela McCorduck (2004). Machines Who Think: A Personal Inquiry into the History and Prospects of Artificial Intelligence. A. K. Peters (25th anniversary edition)

=External Links=
 * Donald Michie from Wikipedia
 * The Mathematics Genealogy Project - Donald Michie
 * Curriculum Vitae - Professor Donald Michie
 * The Machine Intelligence series
 * Turing Trust - Historical Note by Donald Michie
 * Turing 1990 - Final Reminder From: Turing Conference
 * Artificial Intelligence - Recollections of the Pioneers

=References= Up one level