| 翻訳と辞書 |
| Kotok-McCarthy ： ウィキペディア英語版 |
Kotok-McCarthy
Kotok-McCarthy also known as ''(A Chess Playing Program for the IBM 7090 Computer )'' was the first computer program to play chess convincingly. It is also remembered because it played in and lost the first chess match between two computer programs.
==Development==
Between 1959 and 1962, classmates Elwyn Berlekamp, Alan Kotok, Michael Lieberman, Charles Niessen and Robert A. Wagner wrote the program while students of John McCarthy at the Massachusetts Institute of Technology.
Building on Alex Bernstein's landmark 1957 program〔''Mastering the Game: A History of Computer Chess'', 〕 created at IBM and on IBM 704 routines by McCarthy and Paul W. Abrahams, they added alpha-beta pruning to minmax at McCarthy's suggestion to improve the plausible move generator. They wrote in Fortran and FAP on scavenged computer time. After MIT received a 7090 from IBM, a single move took five to twenty minutes. By 1962 when they graduated, the program had completed fragments of four games at a level "comparable to an amateur with about 100 games experience". Kotok, at about age 20, published their work in MIT Artificial Intelligence Memo 41 and his bachelor's thesis.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Kotok-McCarthy」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|