Changes

Jump to: navigation, search

James Mundstock

3,055 bytes added, 16:31, 22 October 2019
Created page with "'''Home * People * James Mundstock''' '''E. James Mundstock''',<br/> an American computer scientist and early chess programmer. In the early 70s, while aff..."
'''[[Main Page|Home]] * [[People]] * James Mundstock'''

'''E. James Mundstock''',<br/>
an American computer scientist and early chess programmer.
In the early 70s, while affiliated with [https://en.wikipedia.org/wiki/University_of_Minnesota University of Minnesota] and its computer center under directorship of [[Mathematician#MLStein|Marvin L. Stein]] <ref>[https://conservancy.umn.edu/bitstream/handle/11299/157360/UCC_Jun_1970.pdf?sequence=1&isAllowed=y UCC_Jun_1970.pdf]</ref>,
James Mundstock was co-author of the ''MNF'' (Minnesota Fortran) [[Fortran]] compiler for the [[CDC 6600]] mainframe computer <ref>[https://en.wikipedia.org/wiki/Control_Data_Corporation#CDC_6600:_defining_supercomputing CDC 6600: Defining Supercomputing - Wikipedia]</ref>.

=Chess Programmer=
Along with [[Gary Boos]], James Mundstock developed the chess programs [[Mr. Turk]] and [[Iron Fish]].
Mr Turk did not use [[Alpha-Beta|alpha-beta]], but a search based on a ''Multipurpose, Theorem-Proving Heuristic Program'' as described by [[James R. Slagle]] and [[Philip Bursky]] in 1968 <ref>[[James R. Slagle]], [[Philip Bursky]] ('''1968'''). ''Experiments With a Multipurpose, Theorem-Proving Heuristic Program''. [[ACM#Journal|Journal of the ACM]], Vol. 15, No. 1</ref>, and competed at [[ACM 1971]].
Iron Fish played the [[ACM 1975]].

=Ostrich Effect=
Quote by [[Gary Boos|Gary J. Boos]] on [[Mr. Turk]] from [[Ben Mittman|Ben Mittman's]] 1971 Panel <ref>[[Ben Mittman]] ('''1971'''). ''[http://www.computerhistory.org/chess/full_record.php?iid=doc-431614f6d1ee8 Computer Chess Programs (Panel)]''. hosted by [[The Computer History Museum]]</ref> <ref>[https://en.wikipedia.org/wiki/Ostrich_effect Ostrich effect from Wikipedia]</ref>:
[[James Mundstock|Mundstock]] noticed an article by [[James R. Slagle|Slagle]] and [[Philip Bursky|Bursky]] in the [[ACM#Journal|Journal of the ACM]], that pointed toward an algorithm that seemed better than [[Alpha-Beta|alpha-beta]] pruning. Based upon this article, and guided by Mundstock, I wrote a lookahead routine whose main theme is that the best line is analyzed until it is shown that it is no longer the best line.

This process eliminates many common problems that accompany a fixed depth search, one of which is the '''[[Horizon Effect|Ostrich Effect]]''' which existed in even [[Northwestern University|Northwestern University's]] [[Chess (Program)|Chess 3.0]]. Tests showed that in a small set of positions, ''Mr. Turk'' could find the main variation on the first try. We believe that the basic theme of our lookahead routine is better than alpha-beta pruning. ...

=Publications=
<ref>[https://dblp.org/pers/hd/m/Mundstock:E=_James dblp: E. James Mundstock]</ref>
* [[Mathematician#MLStein|Marvin L. Stein]], [[James Mundstock]] ('''1970'''). ''[https://ieeexplore.ieee.org/document/1671645 Sorting Implicit Outputs in Digital Simulation]''. [[IEEE#TOC|IEEE Transactions on Computers]], Vol. C-19, No. 9

=References=
<references />
'''[[Engines|Up one level]]'''
[[Category:Chess Programmer|Mundstock]]

Navigation menu