Monty Newborn

According to our database, Monty Newborn authored at least 62 papers between 1967 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Mad Monty Chess.

Monty Newborn

J. Int. Comput. Games Assoc., 2021

2020

The laughing is over.

Monty Newborn

J. Int. Comput. Games Assoc., 2020

An analysis of games played in world computer chess championships over the years.

Monty Newborn

J. Int. Comput. Games Assoc., 2020

Pitting computers against each other ... in chess.

Monroe M. Newborn

Commun. ACM, 2020

2014

Computer Chess Endgame Play with Pawns: Then and Now.

Monty Newborn, Robert M. Hyatt

J. Int. Comput. Games Assoc., 2014

2004

Octopus: Combining Learning and Parallel Search.

Monty Newborn, Zongyan Wang

J. Autom. Reason., 2004

2003

Competitive Semantic Tree Theorem Prover with Resolutions.

Choon Kyu Kim, Monty Newborn

Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface,10th European PVM/MPI Users' Group Meeting, Venice, Italy, September 29, 2003

Deep Blue - an artificial intelligence milestone.

Monty Newborn

Springer, ISBN: 978-0-387-95461-5, 2003

2001

Automated theorem proving - theory and practice.

Monty Newborn

Springer, ISBN: 978-0-387-95075-4, 2001

2000

Deep Blue's contribution to AI.

Monty Newborn

Ann. Math. Artif. Intell., 2000

1998

Heuristics Used by HERBY for Semantic Tree Theorem Proving.

Qingxun Yu, Mohammed Almulla, Monroe M. Newborn

Ann. Math. Artif. Intell., 1998

1997

Kasparov Versus Deep Blue.

Monty Newborn

J. Int. Comput. Games Assoc., 1997

Crafty Goes Deep.

Robert M. Hyatt, Monty Newborn

J. Int. Comput. Games Assoc., 1997

Kasparov versus Deep Blue - computer chess comes of age.

Monty Newborn

Springer, ISBN: 978-0-387-94820-1, 1997

1996

The practicality of generating semantic trees for proofs of unsatisfiability.

Mohammed Almulla, Monroe M. Newborn

Int. J. Comput. Math., 1996

1995

The ACM Computer-Chess Challenge.

Monty Newborn

J. Int. Comput. Games Assoc., 1995

The ACM Computer-Chess Workshop. Recent Advances in Computer Chess.

Monty Newborn

J. Int. Comput. Games Assoc., 1995

A Eulogy for Mikhail Moiseivich Botvinnik.

Monty Newborn

J. Int. Comput. Games Assoc., 1995

The Participants of the 8th World Computer-Chess Championship.

David N. L. Levy, Tony Marsland, Monty Newborn

J. Int. Comput. Games Assoc., 1995

1994

The 24th ACM International Computer-Chess Championship.

Monty Newborn

J. Int. Comput. Games Assoc., 1994

The ACM'S 24th International Computer-Chess Championship.

Monty Newborn

J. Int. Comput. Games Assoc., 1994

1993

Limited Computation.

Ray Lopez, Monty Newborn

J. Int. Comput. Games Assoc., 1993

1992

The 22nd Annual ACM International Computer Chess Championship.

Danny Kopec, Monty Newborn, Mike Valvo

Commun. ACM, 1992

An Upper Bound on the Time Complexity of Iterative-Deepening-A.

Brian G. Patrick, Mohammed Almulla, Monroe M. Newborn

Ann. Math. Artif. Intell., 1992

1991

The 21st ACM North American Computer Chess Championship.

Monty Newborn, Danny Kopec

Commun. ACM, 1991

1990

How Computers Play Chess.

David N. L. Levy, Monty Newborn

J. Int. Comput. Games Assoc., 1990

The 20th Annual ACM North American Computer Chess Championship.

Monty Newborn

Commun. ACM, 1990

1989

Results of the Nineteenth ACM North American Computer Chess Championship.

Monty Newborn, Danny Kopec

Commun. ACM, 1989

Computer Chess: Ten Years of Significant Progress.

Monroe M. Newborn

Adv. Comput., 1989

1988

Unsynchronized Iteratively Deepening Parallel Alpha-Beta Search.

Monroe M. Newborn

IEEE Trans. Pattern Anal. Mach. Intell., 1988

Results of ACM's Eighteenth Computer Chess Championship.

Monty Newborn, Danny Kopec

Commun. ACM, 1988

1987

The 18th ACM's North American Computer-Chess Championship.

Monroe M. Newborn

J. Int. Comput. Games Assoc., 1987

1986

The 1986 ACM/IEEE Conference.

Monty Newborn

J. Int. Comput. Games Assoc., 1986

Looking Back and Ahead.

Monty Newborn

J. Int. Comput. Games Assoc., 1986

1985

A Hypothesis concerning the Strength of Chess Programs.

Monroe M. Newborn

J. Int. Comput. Games Assoc., 1985

The Forthcoming Triennial Meeting.

Monroe M. Newborn

J. Int. Comput. Games Assoc., 1985

A parallel search chess program.

Monroe M. Newborn

Proceedings of the 1985 ACM annual conference on The range of computing: mid-80's perspective: mid-80's perspective, 1985

1984

News, Information, Tournaments and Reports.

Monroe M. Newborn

J. Int. Comput. Games Assoc., 1984

Dues, Membership and the Next World Championship.

Monroe M. Newborn

J. Int. Comput. Games Assoc., 1984

1983

Ringing out the old, ringing in the new.

Monty Newborn

J. Int. Comput. Games Assoc., 1983

1981

A brighter future for Soviet computer chess?

Tony Marsland, Monty Newborn

J. Int. Comput. Games Assoc., 1981

Computer chess: Master level play in 1981?

Ben Mittman, Tony Marsland, Monroe M. Newborn, Kathe Spracklen, Ken Thompson

Proceedings of the ACM 1981 Annual Conference, Los Angeles, CA, USA, November 9-11, 1981., 1981

1980

JCIT hosts Israel's first major computer chess tournament.

Monroe M. Newborn

SIGART Newsl., 1980

Optimal crossing-free Hamiltonian circuit drawings of K_n.

Monroe M. Newborn, William O. J. Moser

J. Comb. Theory, Ser. B, 1980

1979

Recent Progress in Computer Chess.

Monroe M. Newborn

Adv. Comput., 1979

1978

Computer Chess: Recent Progress and Future Expectations.

Monroe M. Newborn

Proceedings of the Information Technology '78: Proceedings of the 3rd Jerusalem Conference on Information Technology (JCIT3), 1978

1977

The Efficiency of the Alpha-Beta Search on Trees with Branch-Dependent Terminal Node Scores.

Monroe M. Newborn

Artif. Intell., 1977

The principal continuation and the killer heuristic.

Selim G. Akl, Monroe M. Newborn

Proceedings of the 1977 annual conference, 1977

1976

General interest (Paper Session).

Frederick E. Petry, Alan W. Biermann, Monroe M. Newborn, Helmut Kerner, Werner Beyerle, Kathleen M. Shockley, Daniel P. Friedman

Proceedings of the 1976 Annual Conference, Houston, Texas, USA, October 20-22, 1976, 1976

Reconsideration of a theorem on admissible ordered search algorithms.

Monroe M. Newborn

Proceedings of the 1976 Annual Conference, Houston, Texas, USA, October 20-22, 1976, 1976

SIGTPC (Panel Session).

Monroe M. Newborn

Proceedings of the 1976 Annual Conference, Houston, Texas, USA, October 20-22, 1976, 1976

1973

A Study of Trigger Machines.

Hsieh T. Hao, Monroe M. Newborn

IEEE Trans. Computers, 1973

Results of the fourth annual U.S. computer chess tournament.

Ben Mittman, Monty Newborn

SIGART Newsl., 1973

1972

Universal Modules for Bounded Signal Fan-Out Synchronous Sequential Circuits.

Monroe M. Newborn, Thomas F. Arnold

IEEE Trans. Computers, 1972

The Simplification of Sequential Machines with Input Restrictions.

Joonki Kim, Monroe M. Newborn

IEEE Trans. Computers, 1972

1970

R70-19 Frequency of Decomposability Among Machines with a Large Number of States.

Monroe M. Newborn

IEEE Trans. Computers, 1970

Iteratively Realized Sequential Circuits.

Thomas F. Arnold, Chung-Jen Tan, Monroe M. Newborn

IEEE Trans. Computers, 1970

1969

Iteratively Realized Sequential Circuits: Further Considerations

Thomas F. Arnold, Monroe M. Newborn

Proceedings of the 10th Annual Symposium on Switching and Automata Theory, 1969

1968

A Synthesis Technique for Binary Input-Binary Output Synchronous Sequential Moore Machines.

Monroe M. Newborn

IEEE Trans. Computers, 1968

Maximal Memory Binary Input-Binary Output Finite-Memory Sequential Machines.

Monroe M. Newborn

IEEE Trans. Computers, 1968

Uniform modular realization of sequential machines.

Edward P. Hsieh, Chung-Jen Tan, Monroe M. Newborn

Proceedings of the 23rd ACM national conference, 1968

1967

Note on Binary Input-Binary Output Finite-Memory Sequential Machines.

Monroe M. Newborn

IEEE Trans. Electron. Comput., 1967