Monroe (Monty) Newborn

Monty Newborn homepage, McGill University. Copyright 2010 by Monty NewbornComputer 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.

Ostrich - Kaissa

World Computer Championship, Stockholm, Sweden, Round 4, 1974.08.08

Monty Newborn chose this game, played against the World Champion and defending North American Champion, as the best game of Ostrich's career:

Belle - Ostrich

ACM North American Computer Championship, Dallas, TX, USA, Round 1, 1982.10.24

A last hurrah for the bird, as it crushed the future Deep Blue program:

Chiptest - Ostrich

ACM North American Computer Championship, Dallas, TX, USA, Round 2, 1986.11.03

 

Source: Kasparov versus Deep Blue (computer chess comes of age) by Monty Newborn, 1997.

Copyright 2011. David Cohen.

Back to Biographies