Home * People * Monroe Newborn

		Monroe M. (Monty) Newborn, a Canadian computer scientist, and emeritus professor at McGill University [1] in Montreal, Quebec, Canada. Monty was early computer chess programmer and primary author of the chess program Ostrich, and the pawn endgame program Peasant [2]. In 1970 Monty Newborn and Ben Mittman initiated, constituted and organized the ACM North American Computer Chess Championship, and together with Ben Mittman and David Levy the World Computer Chess Championship in 1974. Newborn was co-founder of the ICCA in 1977, and served as its president from 1983 until 1986. He has written extensively on computer chess [3].
Monty Newborn [4]

Photos

Chess pioneers in Sacher Hotel Vienna, Austria 1980: Ben Mittman, Monty Newborn, Tony Marsland, Dave Slate, David Levy, Claude Shannon, Ken Thompson, Betty Shannon, Tom Truscott [5]
Don Beal, Ken Thompson, Monty Newborn, and Mikhail Botvinnik at the WCCC 1983 in New York City [6]

Biography

Brief Biography of Monty Newborn ^[7]:

Monty Newborn received his Ph. D. in Electrical Engineering from The Ohio State University in 1967. He was an assistant professor and then associate professor at Columbia University in the Department of Electrical Engineering and Computer Science from 1967-1975. In 1975, he joined the School of Computer Science at McGill University and has been with the School since then, serving as its director from 1976-1983. He has been an ACM Fellow since 1994.

His research focuses on search problems in artificial intelligence where two areas are of particular interest: chess-playing programs and automated theorem-proving programs. He has published seven books on these subjects and a number of research papers as well. He served as chairman of the ACM Computer Chess Committee from 1981 until 1997. In that capacity he organized the first Kasparov versus Deep Blue match (known as the ACM Chess Challenge) in 1996. The following year he served as head of the officials at the second Kasparov versus Deep Blue match won by Deep Blue. Through the 1970s and 1980s, his chess program Ostrich competed in five world championships, coming close to winning in 1974.

Quote from Canadian Chess ^[8]

• Computer Science Professor, McGill University
• Programmer (originally with George Arnold) of Ostrich (also Ostrich 80, Ostrich 81), a computer chess program which competed in the ACM U.S. Computer Championships (1972-74), ACM North American Computer Championships (1975, 1977-87) and World Computer Championships (1974, 1977, 1980, 1983, 1986)
• 2nd place ACM U.S. Computer Championship 1973 for Ostrich
• Organized first ACM U.S. Computer Championship 1970, as well as many succeeding championships
• President, International Computer Chess Association 1983-86
• Applied results obtained from research on search algorithms in the field of computer chess to the field of internet searching
• Canadian Chess Hall of Fame 2001

A win in the following last round game would have given Ostrich a tie for first place in the 1st World Computer Championship. Unfortunately, the program missed the winning move, 35. Rxh6+, as finding it required a search depth of 19-ply, which was beyond its capabilities. It also missed another winning move, 39. Bf5, which required an 11-ply search.

[Event "1st World Computer Chess Championship"]
[Site "Stockholm, Sweden"]
[Date "1974.08.08"]
[Round "4"]
[White "Ostrich"]
[Black "Kaissa"]
[Result "0-1"]
 
1. Nf3 e6 2. d4 Nf6 3. Bg5 d5 4. e3 Be7 5. Nc3 Bb4 6. Bxf6 Bxc3+ 7. bxc3 Qxf6
8. Bd3 c5 9. O-O O-O 10. Qd2 Nc6 11. dxc5 Qe7 12. c4 dxc4 13. Bxc4 Qxc5 14.
Qd3 Rd8 15. Qe4 b5 16. Bd3 f5 17. Qh4 e5 18. e4 f4 19. Rfe1 Bb7 20. Ng5 h6 21.
Ne6 Qb6 22. Nxd8 Rxd8 23. a4 b4 24. Bc4+ Kh8 25. Rad1 Nd4 26. Rc1 Bc6 27. c3
bxc3 28. Rxc3 Bxa4 29. Qe7 Nc6 30. Qf7 Qc5 31. Rd3 Nd4 32. Bd5 Bb5 33. Rh3
Ne2+ 34. Kh1 Qxf2 35. Rd1 Qb6 36. Rb1 Rc8 37. Be6 Rd8 38. Qg6 Qb7 39. Qf5 Qc7
40. Rh4 Nd4 41. Qh3 Nxe6 42. Qxe6 Bd3 43. Rg1 Bc4 44. Qf5 Be2 45. Ra1 a5 46.
Qg6 a4 47. Re1 Bc4 48. Ra1 a3 49. Rb1 Qd6 50. Qxd6 Rxd6 51. Rh3 a2 52. Rc1 Rd4
53. Rhc3 Rxe4 54. Ra1 Rd4 55. Rxc4 Rxc4 56. g3 f3 57. h3 Rc2 58. Rd1 Rd2 59.
Rc1 e4 60. g4 e3 61. Kg1 e2 62. Kf2 Rd1 63. Rc8+ Kh7 64. Kxf3 e1=Q 65. Rc2
Rd3+ 66. Kf4 g5+ 67. Kf5 Rf3# 0-1

See also

• The History of Computer Chess - an AI Perspective - Video

Selected Publications

1973 ...

• Ben Mittman, Monty Newborn (1973). Results of the fourth annual U.S. computer chess tournament. ACM SIGART Bulletin, No. 42 » ACM 1973

1975 ...

• Monroe Newborn (1975). Computer Chess. Academic Press, New York, N.Y. ISBN 0-125-17250-8.
  Chapter I. Introduction
  Chapter II. The History and Basic Ideas of Computer Chess
  Chapter III. The Kotok-McCarthy Chess Program versus the ITEP Chess Program
  Chapter IV. The Greenblatt Chess Program
  Chapter V. The First United States Computer Chess Championship
  Chapter VI. The Second United States Computer Chess Championship
  Chapter VII. The Third United States Computer Chess Championship
  Chapter VIII. Kaissa
  Chapter IX. The Fourth United States Computer Chess Championship
  Chapter X. Ostrich: A Description of a Chess-Playing Program
  Appendix I. The First World Computer Chess Championship
• Monty Newborn (1977). David vs. 12 Goliaths. The Best of Creative Computing Volume 2, edited by David Ahl, hosted by AtariArchives.org » ACM 1975
• Monty Newborn (1977). Summary of the ACM Sixth U.S. Computer Chess Championship. The Best of Creative Computing Volume 2, edited by David Ahl, hosted by AtariArchives.org » ACM 1975
• Monroe Newborn (1977). PEASANT: An endgame program for kings and pawns. Chess Skill in Man and Machine (Ed. Peter W. Frey), pp. 119-130
• Selim Akl, Monroe Newborn (1977). The Principal Continuation and the Killer Heuristic. 1977 ACM Annual Conference Proceedings, pp. 466-473. ACM, Seattle, WA.
• Monroe Newborn (1978). Computer Chess: Recent Progress and Further Expectations. International Conference on Parallel Processing (ed. J. Moneta). North-Holland, Amsterdam, The Netherlands. ISBN 0-444-85192-5.
• Monroe Newborn (1979). Recent Progress in Computer Chess. Advances in Computers, Vol. 18, pp. 59-117. Academic Press, New York, N.Y. Reprinted (1988) in Computer Games I (ed. David Levy), pp. 226-324, Springer
• Monroe Newborn (1979). Ostrich IV meets the Black Knight. Personal Computing, Vol. 3, No. 10, pp. 74 » ACM 1978, Ostrich, Black Knight

1980 ...

• Ben Mittman, Monroe Newborn (1980). Computer chess at ACM 79: the tournament and the man vs. man and machine match. Communications of the ACM, Vol. 23, Issue 1, pdf from The Computer History Museum
• David Levy, Ben Mittman, Monroe Newborn (1980). 3rd World Computer Chess Championship. ICCA Newsletter, Vol. 3, No. 3 » WCCC 1980
• Tony Marsland, Monty Newborn (1981). A brighter future for Soviet computer chess? ICCA Newsletter, Vol. 4, No. 1, pdf
• Ben Mittman, Tony Marsland, Monroe Newborn, Kathe Spracklen, Ken Thompson (1981). Computer chess: Master level play in 1981? ACM 81: Proceedings of the ACM '81 conference
• David Levy, Monroe Newborn (1981). More Chess and Computers, The Microcomputer Revolution, The Challenge Match. Computer Science Press, Inc., Potomac, Maryland. ISBN 0-914894-07-2
• Monroe Newborn (1982). OSTRICH/P - a parallel search chess program, SOCS-82.3, McGill University, School of Computer Science, Montreal.
• David Levy, Monroe Newborn (1982, 1983). All About Chess and Computers. Springer, amazon, 2nd edition
• Monroe Newborn (1984). The Fourth World Microcomputer Chess Championship. ICCA Journal, Vol. 7, No. 4 » WMCCC 1984

1985 ...

• Danny Kopec, Monroe Newborn (1985). ACM's Fifteenth North American Computer Chess Championship. Communications of the ACM, Vol. 28, No. 7, reprinted in The Sixteenth ACM North American Computer Chess Championship, Denver Colorado, October 13-15, 1985, pdf from The Computer History Museum
• Monroe Newborn (1985). A Hypothesis Concerning the Strength of Chess Programs. ICCA Journal, Vol. 8, No. 4
• Monroe Newborn (1985). A Parallel Search Chess Program. Proceedings of the ACM Annual Conference, pp. 272-277. Denver, Co.
• Danny Kopec, Monroe Newborn, Winston Yu (1986). Experiments in Chess Cognition. Advances in Computer Chess 4
• Danny Kopec, Monty Newborn (1986). Belle and Mephisto Dallas Capture Computer Chess Title at the FJCC. reprinted in The ACM's Eighteenth North American Computer Chess Championship from The Computer History Museum, pdf
• Monty Newborn, Danny Kopec (1988). Results of ACM's Eighteenth Computer Chess Championship. Communications of the ACM, Vol. 31, No. 8, pdf
• Monroe Newborn (1988). Unsynchronized Iterative Deepening Parallel Alpha-Beta Search. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI, Vol. 10, No. 5, pp. 687-694. ISSN 0162-8828.
• Monroe Newborn (1989). A Theorem Proving Program that Looks Like a Chess Program. Workshop on New Directions in Game-Tree Search
• Monty Newborn, Danny Kopec (1989). Results of The Nineteenth ACM North American Computer Chess Championship. Communications of the ACM, Vol. 32, No. 10, pdf, reprinted in The Twentieth ACM North American Computer Chess Championship from The Computer History Museum, pdf » ACM 1988

1990 ...

• Monroe Newborn, Danny Kopec (1990). The Twentieth ACM North American Computer Chess Championship, in The 21st Annual ACM North American Computer Chess Championship from The Computer History Museum, pdf
• Monroe Newborn, David Levy (1991). How Computers Play Chess. W.H. Freeman & Co
• Danny Kopec, Monroe Newborn, Michael Valvo (1992). The 22d Annual ACM International Chess Championship, in The 23rd ACM International Computer Chess Championship from The Computer History Museum, pdf
• Monty Newborn, Danny Kopec (1991). The 21st ACM North American Computer Chess Championship. Communications of the ACM, Vol. 34, No. 11, online » ACM 1990
• Danny Kopec, Monroe Newborn, Michael Valvo (1994). The 23rd ACM NACCC in Indianapolis. The 24th ACM International Computer Chess Championship from The Computer History Museum, pdf » ACM 1993
• Monroe Newborn (1994). The 24th ACM International Computer-Chess Championship. ICCA Journal, Vol. 17, No. 3 » ACM 1994

1995 ...

• Monroe Newborn (1995). A Eulogy for Mikhail Moiseivich Botvinnik. ICCA Journal, Vol. 18, No. 2 » Mikhail Botvinnik
• Monroe Newborn (1997). Kasparov versus Deep Blue: Computer Chess Comes of Age. Springer
• Robert Hyatt, Monroe Newborn (1997). CRAFTY Goes Deep. ICCA Journal, Vol. 20, No. 2 » Crafty

2000 ...

• Monty Newborn (2000). Automated Theorem Proving: Theory and Practice. Springer, amazon

2005 ...

• David Levy, Monty Newborn (2009). How Computers Play Chess. Ishi Press, amazon

2010 ...

• Monty Newborn (2011). Beyond Deep Blue: Chess in the Stratosphere. Springer, ISBN-13: 978-0857293404, amazon ^[9]
  
• Monroe Newborn, Robert Hyatt (2014). Computer Chess Endgame Play with Pawns: Then and Now. ICGA Journal, Vol. 37, No. 4 » Peasant, Crafty

External Links

• Monty Newborn, Professor School of Computer Science, McGill University
• Monroe Newborn's ICGA Tournaments
• Monty Newborn from Wikipedia
• The Mathematics Genealogy Project - Monty Newborn
• Newborn Monroe | The Chess Federation of Canada - La Fédération Canadienne des Échecs
• Theo and Octopus at CASC-J3 (pdf) by Monty Newborn
• Oral History of Monty Newborn (pdf) © 2005 The Computer History Museum
• Images by Monty Newborn from the The Computer History Museum

References

1. ^ Monty Newborn - McGill School of Computer Science
2. ^ Monroe Newborn (1977). PEASANT: An endgame program for kings and pawns. Chess Skill in Man and Machine (Ed. Peter W. Frey), pp. 119-130
3. ^ Books by Monroe Newborn from Bookstores.com
4. ^ Monty Newborn Professor School of Computer Science, McGill University
5. ^ Chess pioneers in Sacher Hotel Vienna, Austria, Gift of Benjamin Mittman, The Computer History Museum
6. ^ Photo Gift of Monroe Newborn from The Computer History Museum
7. ^ Monty Newborn, Professor School of Computer Science, McGill University
8. ^ Canadian Chess - Monroe (Monty) Newborn
9. ^ New CC book: Beyond Deep Blue by Steven Edwards, CCC, November 11, 2011

What links here?

Up one level