25,161
edits
Changes
Created page with "'''Home * People * James Gillogly''' FILE:bio-gillogly.jpg|border|right|thumb|link=http://www.pbs.org/wgbh/nova/sciencenow/3411/bios.html| James Gillogly..."
'''[[Main Page|Home]] * [[People]] * James Gillogly'''
[[FILE:bio-gillogly.jpg|border|right|thumb|link=http://www.pbs.org/wgbh/nova/sciencenow/3411/bios.html| James Gillogly <ref>[http://www.pbs.org/wgbh/nova/sciencenow/3411/bios.html Participants - Kryptos] from [http://www.pbs.org/wgbh/nova/sciencenow/ NOVA Science NOW]</ref> ]]
'''James John (Jim) Gillogly''',<br/>
an American computer scientist and [https://en.wikipedia.org/wiki/Cryptography cryptographer] from [https://en.wikipedia.org/wiki/RAND 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]] <ref>[[James Gillogly]] ('''1978'''). ''Performance Analysis of the Technology Chess Program''. Ph.D. Thesis. Tech. Report CMU-CS-78-189, [[Carnegie Mellon University]], [http://reports-archive.adm.cs.cmu.edu/anon/anon/usr/ftp/scan/CMU-CS-77-gillogly.pdf CMU-CS-77 pdf]</ref>.
=Tech=
James Gillogly was the primary author of the [[Tech|The Technology Chess Program]], which was the predecessor of all modern chess programs, using a [[Claude Shannon|Shannon]] [[Type A Strategy]]. In 1970, Tech was written in [https://en.wikipedia.org/wiki/BLISS BLISS], a system programming language developed at Carnegie Mellon, and in 1977 ported to [[C]]. Gillogly further authored the [[Fortran]] chess player dubbed [[MAX (Gillogly)|MAX]] <ref>James Gillogly ('''1970'''). ''[http://www.rand.org/pubs/papers/P4428/ MAX : A FORTRAN Chess Player]''. [http://www.rand.org/ RAND] paper</ref>, and along with [[Samuel Fuller]] and [[John Gaschnig]], analyzed the [[Alpha-Beta|alpha-beta]] algorithm <ref>[[Samuel Fuller]], [[John Gaschnig]], [[James Gillogly]] ('''1973'''). ''An Analysis of the Alpha-Beta Pruning Algorithm.'' Technical Report, [[Carnegie Mellon University]]</ref>.
=Selected Publications=
<ref>[http://www.rand.org/pubs/authors/g/gillogly_james_j.html Articles by Gillogly at rand.org, 1970–2004]</ref> <ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref>
* [[James Gillogly]] ('''1970'''). ''[http://www.rand.org/pubs/papers/P4428/ MAX : A FORTRAN Chess Player]''. [https://en.wikipedia.org/wiki/RAND RAND] paper
* [[James Gillogly]] ('''1971'''). ''[http://oai.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=html&identifier=AD0736043 The Technology Chess Program]''. [[Carnegie Mellon University]], CS-71-109, [http://repository.cmu.edu/cgi/viewcontent.cgi?article=2974&context=compsci pdf]
* [[James Gillogly]] ('''1972'''). ''[http://www.sciencedirect.com/science/article/pii/0004370272900458 The Technology Chess Program]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 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]], [http://shelf2.library.cmu.edu/Tech/17700646.pdf pdf]
* [[James Gillogly]] ('''1978'''). ''Performance Analysis of the Technology Chess Program''. Ph.D. Thesis. Tech. Report CMU-CS-78-189, [[Carnegie Mellon University]], [http://reports-archive.adm.cs.cmu.edu/anon/anon/usr/ftp/scan/CMU-CS-77-gillogly.pdf CMU-CS-77 pdf]
* [[James Gillogly]] ('''1989'''). ''Transposition Table Collisions''. [[WCCC 1989#Workshop|Workshop on New Directions in Game-Tree Search]]
* [[James Gillogly]] ('''1989'''). ''New Directions in Game-Tree Search - First Workshop Session''. [[ICGA Journal#12_2|ICCA Journal, Vol. 12, No. 2]] » [[WCCC 1989#Workshop|Workshop on New Directions in Game-Tree Search]]
=Forum Posts=
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/0c58d51e5b9f45ad# Computer Chess Hall of Fame - Revised Edition], [[Computer Chess Forums|rgcc]], post 10 and 23 by Jim Gillogly, April 14, 1997
=External Links=
* [https://en.wikipedia.org/wiki/James_Gillogly James Gillogly from Wikipedia]
* [http://genealogy.math.ndsu.nodak.edu/id.php?id=50361 The Mathematics Genealogy Project - James Gillogly]
* [http://aigp.eecs.umich.edu/researcher/show/487 The AI Genealogy Project :: James Gillogly]
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=444 James Gillogly's ICGA Tournaments]
* [http://www.pbs.org/wgbh/nova/decoding/faceoff.html Crack the Ciphers - Decoding Nazi Secrets] by Jim Gillogly, [http://www.pbs.org/wgbh/nova/ Nova]
=References=
<references />
'''[[People|Up one level]]'''
[[FILE:bio-gillogly.jpg|border|right|thumb|link=http://www.pbs.org/wgbh/nova/sciencenow/3411/bios.html| James Gillogly <ref>[http://www.pbs.org/wgbh/nova/sciencenow/3411/bios.html Participants - Kryptos] from [http://www.pbs.org/wgbh/nova/sciencenow/ NOVA Science NOW]</ref> ]]
'''James John (Jim) Gillogly''',<br/>
an American computer scientist and [https://en.wikipedia.org/wiki/Cryptography cryptographer] from [https://en.wikipedia.org/wiki/RAND 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]] <ref>[[James Gillogly]] ('''1978'''). ''Performance Analysis of the Technology Chess Program''. Ph.D. Thesis. Tech. Report CMU-CS-78-189, [[Carnegie Mellon University]], [http://reports-archive.adm.cs.cmu.edu/anon/anon/usr/ftp/scan/CMU-CS-77-gillogly.pdf CMU-CS-77 pdf]</ref>.
=Tech=
James Gillogly was the primary author of the [[Tech|The Technology Chess Program]], which was the predecessor of all modern chess programs, using a [[Claude Shannon|Shannon]] [[Type A Strategy]]. In 1970, Tech was written in [https://en.wikipedia.org/wiki/BLISS BLISS], a system programming language developed at Carnegie Mellon, and in 1977 ported to [[C]]. Gillogly further authored the [[Fortran]] chess player dubbed [[MAX (Gillogly)|MAX]] <ref>James Gillogly ('''1970'''). ''[http://www.rand.org/pubs/papers/P4428/ MAX : A FORTRAN Chess Player]''. [http://www.rand.org/ RAND] paper</ref>, and along with [[Samuel Fuller]] and [[John Gaschnig]], analyzed the [[Alpha-Beta|alpha-beta]] algorithm <ref>[[Samuel Fuller]], [[John Gaschnig]], [[James Gillogly]] ('''1973'''). ''An Analysis of the Alpha-Beta Pruning Algorithm.'' Technical Report, [[Carnegie Mellon University]]</ref>.
=Selected Publications=
<ref>[http://www.rand.org/pubs/authors/g/gillogly_james_j.html Articles by Gillogly at rand.org, 1970–2004]</ref> <ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref>
* [[James Gillogly]] ('''1970'''). ''[http://www.rand.org/pubs/papers/P4428/ MAX : A FORTRAN Chess Player]''. [https://en.wikipedia.org/wiki/RAND RAND] paper
* [[James Gillogly]] ('''1971'''). ''[http://oai.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=html&identifier=AD0736043 The Technology Chess Program]''. [[Carnegie Mellon University]], CS-71-109, [http://repository.cmu.edu/cgi/viewcontent.cgi?article=2974&context=compsci pdf]
* [[James Gillogly]] ('''1972'''). ''[http://www.sciencedirect.com/science/article/pii/0004370272900458 The Technology Chess Program]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 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]], [http://shelf2.library.cmu.edu/Tech/17700646.pdf pdf]
* [[James Gillogly]] ('''1978'''). ''Performance Analysis of the Technology Chess Program''. Ph.D. Thesis. Tech. Report CMU-CS-78-189, [[Carnegie Mellon University]], [http://reports-archive.adm.cs.cmu.edu/anon/anon/usr/ftp/scan/CMU-CS-77-gillogly.pdf CMU-CS-77 pdf]
* [[James Gillogly]] ('''1989'''). ''Transposition Table Collisions''. [[WCCC 1989#Workshop|Workshop on New Directions in Game-Tree Search]]
* [[James Gillogly]] ('''1989'''). ''New Directions in Game-Tree Search - First Workshop Session''. [[ICGA Journal#12_2|ICCA Journal, Vol. 12, No. 2]] » [[WCCC 1989#Workshop|Workshop on New Directions in Game-Tree Search]]
=Forum Posts=
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/0c58d51e5b9f45ad# Computer Chess Hall of Fame - Revised Edition], [[Computer Chess Forums|rgcc]], post 10 and 23 by Jim Gillogly, April 14, 1997
=External Links=
* [https://en.wikipedia.org/wiki/James_Gillogly James Gillogly from Wikipedia]
* [http://genealogy.math.ndsu.nodak.edu/id.php?id=50361 The Mathematics Genealogy Project - James Gillogly]
* [http://aigp.eecs.umich.edu/researcher/show/487 The AI Genealogy Project :: James Gillogly]
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=444 James Gillogly's ICGA Tournaments]
* [http://www.pbs.org/wgbh/nova/decoding/faceoff.html Crack the Ciphers - Decoding Nazi Secrets] by Jim Gillogly, [http://www.pbs.org/wgbh/nova/ Nova]
=References=
<references />
'''[[People|Up one level]]'''
