Difference between revisions of "James Gillogly"
GerdIsenberg (talk | contribs) m |
GerdIsenberg (talk | contribs) |
||
| Line 21: | Line 21: | ||
=Forum Posts= | =Forum Posts= | ||
| − | * [ | + | * [https://groups.google.com/d/msg/rec.games.chess.computer/DFjVHlufRa0/Lw2Ale1MaZwJ Computer Chess Hall of Fame -Revised Edition] by [[James Gillogly|Jim Gillogly]], [[Computer Chess Forums|rgcc]], April 14, 1997 |
=External Links= | =External Links= | ||
Revision as of 00:54, 2 January 2019
Home * People * James Gillogly
| James John (Jim) Gillogly, an American computer scientist and cryptographer from RAND Corporation. He graduated from Carnegie Mellon University in 1978, receiving a Ph.D. in computer science. His thesis Performance Analysis of the Technology Program was advised by Allen Newell [1]. James Gillogly was the primary author of the The Technology Chess Program, which was the predecessor of all modern chess programs, using a Shannon Type A Strategy. In 1970, Tech was written in BLISS, a system programming language developed at Carnegie Mellon, and in 1977 ported to C. Gillogly further authored the Fortran chess player dubbed MAX [2], and along with Samuel Fuller and John Gaschnig, analyzed the alpha-beta algorithm [3]. |
 |
| James Gillogly [4] |
Selected Publications
- James Gillogly (1970). MAX : A FORTRAN Chess Player. RAND paper
- James Gillogly (1971). The Technology Chess Program. Carnegie Mellon University, CS-71-109, pdf
- James Gillogly (1972). The Technology Chess Program. Artificial Intelligence, Vol. 3, pp. 145-163, reprinted (1988) in Computer Chess Compendium
- Samuel Fuller, John Gaschnig, James Gillogly (1973). An Analysis of the Alpha-Beta Pruning Algorithm. Technical Report, Carnegie Mellon University, pdf
- James Gillogly (1978). Performance Analysis of the Technology Chess Program. Ph.D. Thesis. Tech. Report CMU-CS-78-189, Carnegie Mellon University, CMU-CS-77 pdf
- James Gillogly (1989). Transposition Table Collisions. Workshop on New Directions in Game-Tree Search
- James Gillogly (1989). New Directions in Game-Tree Search - First Workshop Session. ICCA Journal, Vol. 12, No. 2 » Workshop on New Directions in Game-Tree Search
Forum Posts
- Computer Chess Hall of Fame -Revised Edition by Jim Gillogly, rgcc, April 14, 1997
External Links
- James Gillogly from Wikipedia
- The Mathematics Genealogy Project - James Gillogly
- The AI Genealogy Project :: James Gillogly
- James Gillogly's ICGA Tournaments
- Crack the Ciphers - Decoding Nazi Secrets by Jim Gillogly, Nova
References
- ↑ James Gillogly (1978). Performance Analysis of the Technology Chess Program. Ph.D. Thesis. Tech. Report CMU-CS-78-189, Carnegie Mellon University, CMU-CS-77 pdf
- ↑ James Gillogly (1970). MAX : A FORTRAN Chess Player. RAND paper
- ↑ Samuel Fuller, John Gaschnig, James Gillogly (1973). An Analysis of the Alpha-Beta Pruning Algorithm. Technical Report, Carnegie Mellon University
- ↑ Participants - Kryptos from NOVA Science NOW
- ↑ Articles by Gillogly at rand.org, 1970–2004
- ↑ ICGA Reference Database (pdf)
