25,161
edits
Changes
Created page with "'''Home * People * Michael Gherrity''' '''Michael (Mike) Gherrity''',<br/> an American computer scientist and AI-researcher from the [https://en.wikipedia.o..."
'''[[Main Page|Home]] * [[People]] * Michael Gherrity'''
'''Michael (Mike) Gherrity''',<br/>
an American computer scientist and AI-researcher from the [https://en.wikipedia.org/wiki/University_of_California,_San_Diego University of California, San Diego]. He defended his Ph.D. in 1993 - ''A Game Learning Machine'', elaborating on [[SAL]] ([[Search]] and [[Learning|Learn]]) <ref>[http://satirist.org/learn-game/systems/sal.html SAL] from [http://satirist.org/learn-game/ Machine Learning in Games] by [[Jay Scott]]</ref>, his [[General Game Playing]] program. While applying a [[Move Generation|move generator]], and losing if own king is captured as sole domain specific knowledge, it was the first chess program used [[Temporal Difference Learning]] <ref>[[Marco Block-Berlitz|Marco Block]], Maro Bader, [http://page.mi.fu-berlin.de/tapia/ Ernesto Tapia], Marte Ramírez, Ketill Gunnarsson, Erik Cuevas, Daniel Zaldivar, [[Raúl Rojas]] ('''2008'''). ''Using Reinforcement Learning in Chess Engines''. Concibe Science 2008, [http://www.micai.org/rcs/ Research in Computing Science]: Special Issue in Electronics and Biomedical Engineering, Computer Science and Informatics, Vol. 35, [http://page.mi.fu-berlin.de/block/concibe2008.pdf pdf], 1.1 Related Work</ref>. In a match of 4200 games against [[GNU Chess]] (One second per move), it started to play random moves within its two [[Ply|ply]] search plus [[Consistency Search]], a generalized [[Quiescence Search]] <ref>[[Don Beal]] ('''1989'''). ''Experiments with the Null Move.'' [[Advances in Computer Chess 5]], a revised version is published ('''1990''') under the title ''A Generalized Quiescence Search Algorithm''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 43, No. 1</ref>, but learned to play reasonable, but still weak chess. It archived eight draws, apparently due to a [[Repetitions|repetition]] detection bug in GNU Chess <ref> [[Michael Gherrity]] ('''1993'''). ''A Game Learning Machine''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_California,_San_Diego University of California, San Diego], advisor [[Mathematician#PKube|Paul Kube]], [http://www.gherrity.org/thesis.pdf pdf], [http://www.top-5000.nl/ps/A%20game%20learning%20machine.pdf pdf]</ref>.
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/g/Gherrity:Michael dblp: Michael Gherrity]</ref>
* [[Michael Gherrity]] ('''1989'''). ''[https://ieeexplore.ieee.org/document/118645 A Learning Algorithm for Analog, Fully Recurrent Neural Networks]''. [[IEEE|IEEE IJCNN 1989]]
* [https://scholar.google.com/citations?user=vqrY_hgAAAAJ&hl=en Richard K. Belew], [[Michael Gherrity]] ('''1989'''). ''Back Propagation for the Classifier System''. [https://dblp.uni-trier.de/db/conf/icga/icga1989.html ICGA 1989]
* <span id="thesis"></span>[[Michael Gherrity]] ('''1993'''). ''A Game Learning Machine''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_California,_San_Diego University of California, San Diego], advisor [[Mathematician#PKube|Paul Kube]], [http://www.gherrity.org/thesis.pdf pdf], [http://www.top-5000.nl/ps/A%20game%20learning%20machine.pdf pdf]
* [[Michael Gherrity]], [[Mathematician#PKube|Paul Kube]] ('''1993'''). ''Quiescent Search is Beneficial.'' Technical Report CS93-289, [https://en.wikipedia.org/wiki/University_of_California,_San_Diego University of California, San Diego]
=Forum Posts=
* [http://www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/games/doc/strategy.txt Subject: Re: Game Learning] by [[Michael Gherrity|Mike Gherrity]], [http://www.cs.cmu.edu/afs/cs/project/ai-repository/ai/ ai-repository], July 1, 1994 <ref>[[Barney Pell]] ('''1993'''). ''Strategy Generation and Evaluation for Meta-Game Playing''. Ph.D: thesis, [https://en.wikipedia.org/wiki/Trinity_College,_Cambridge Trinity College, Cambridge], [http://www.barneypell.com/papers/pell-thesis.pdf pdf]</ref>
* [https://groups.google.com/d/msg/rec.games.chess.computer/jZ5A9ShxzYU/vX50umDt5NsJ DB Tweaking Between Games] by [[Michael Gherrity|Mike Gherrity]], [[Computer Chess Forums|rgcc]], May 13, 1997 » [[Kasparov versus Deep Blue 1997]]
* [https://groups.google.com/d/msg/rec.games.chess.computer/SzZAbOQFOtU/erRKS26ISWMJ Learning necessary for chess champion?] by [[Michael Gherrity|Mike Gherrity]], [[Computer Chess Forums|rgcc]], May 16, 1997
=External Links=
* [http://www.gherrity.org/ Michael Gherrity Home]
* [http://satirist.org/learn-game/systems/sal.html SAL] from [http://satirist.org/learn-game/ Machine Learning in Games] by [[Jay Scott]]
* [http://genealogy.math.ndsu.nodak.edu/id.php?id=103352 The Mathematics Genealogy Project - Michael Gherrity]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Gherrity]]
[[Category:Programmer|Gherrity]]
'''Michael (Mike) Gherrity''',<br/>
an American computer scientist and AI-researcher from the [https://en.wikipedia.org/wiki/University_of_California,_San_Diego University of California, San Diego]. He defended his Ph.D. in 1993 - ''A Game Learning Machine'', elaborating on [[SAL]] ([[Search]] and [[Learning|Learn]]) <ref>[http://satirist.org/learn-game/systems/sal.html SAL] from [http://satirist.org/learn-game/ Machine Learning in Games] by [[Jay Scott]]</ref>, his [[General Game Playing]] program. While applying a [[Move Generation|move generator]], and losing if own king is captured as sole domain specific knowledge, it was the first chess program used [[Temporal Difference Learning]] <ref>[[Marco Block-Berlitz|Marco Block]], Maro Bader, [http://page.mi.fu-berlin.de/tapia/ Ernesto Tapia], Marte Ramírez, Ketill Gunnarsson, Erik Cuevas, Daniel Zaldivar, [[Raúl Rojas]] ('''2008'''). ''Using Reinforcement Learning in Chess Engines''. Concibe Science 2008, [http://www.micai.org/rcs/ Research in Computing Science]: Special Issue in Electronics and Biomedical Engineering, Computer Science and Informatics, Vol. 35, [http://page.mi.fu-berlin.de/block/concibe2008.pdf pdf], 1.1 Related Work</ref>. In a match of 4200 games against [[GNU Chess]] (One second per move), it started to play random moves within its two [[Ply|ply]] search plus [[Consistency Search]], a generalized [[Quiescence Search]] <ref>[[Don Beal]] ('''1989'''). ''Experiments with the Null Move.'' [[Advances in Computer Chess 5]], a revised version is published ('''1990''') under the title ''A Generalized Quiescence Search Algorithm''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 43, No. 1</ref>, but learned to play reasonable, but still weak chess. It archived eight draws, apparently due to a [[Repetitions|repetition]] detection bug in GNU Chess <ref> [[Michael Gherrity]] ('''1993'''). ''A Game Learning Machine''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_California,_San_Diego University of California, San Diego], advisor [[Mathematician#PKube|Paul Kube]], [http://www.gherrity.org/thesis.pdf pdf], [http://www.top-5000.nl/ps/A%20game%20learning%20machine.pdf pdf]</ref>.
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/g/Gherrity:Michael dblp: Michael Gherrity]</ref>
* [[Michael Gherrity]] ('''1989'''). ''[https://ieeexplore.ieee.org/document/118645 A Learning Algorithm for Analog, Fully Recurrent Neural Networks]''. [[IEEE|IEEE IJCNN 1989]]
* [https://scholar.google.com/citations?user=vqrY_hgAAAAJ&hl=en Richard K. Belew], [[Michael Gherrity]] ('''1989'''). ''Back Propagation for the Classifier System''. [https://dblp.uni-trier.de/db/conf/icga/icga1989.html ICGA 1989]
* <span id="thesis"></span>[[Michael Gherrity]] ('''1993'''). ''A Game Learning Machine''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_California,_San_Diego University of California, San Diego], advisor [[Mathematician#PKube|Paul Kube]], [http://www.gherrity.org/thesis.pdf pdf], [http://www.top-5000.nl/ps/A%20game%20learning%20machine.pdf pdf]
* [[Michael Gherrity]], [[Mathematician#PKube|Paul Kube]] ('''1993'''). ''Quiescent Search is Beneficial.'' Technical Report CS93-289, [https://en.wikipedia.org/wiki/University_of_California,_San_Diego University of California, San Diego]
=Forum Posts=
* [http://www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/games/doc/strategy.txt Subject: Re: Game Learning] by [[Michael Gherrity|Mike Gherrity]], [http://www.cs.cmu.edu/afs/cs/project/ai-repository/ai/ ai-repository], July 1, 1994 <ref>[[Barney Pell]] ('''1993'''). ''Strategy Generation and Evaluation for Meta-Game Playing''. Ph.D: thesis, [https://en.wikipedia.org/wiki/Trinity_College,_Cambridge Trinity College, Cambridge], [http://www.barneypell.com/papers/pell-thesis.pdf pdf]</ref>
* [https://groups.google.com/d/msg/rec.games.chess.computer/jZ5A9ShxzYU/vX50umDt5NsJ DB Tweaking Between Games] by [[Michael Gherrity|Mike Gherrity]], [[Computer Chess Forums|rgcc]], May 13, 1997 » [[Kasparov versus Deep Blue 1997]]
* [https://groups.google.com/d/msg/rec.games.chess.computer/SzZAbOQFOtU/erRKS26ISWMJ Learning necessary for chess champion?] by [[Michael Gherrity|Mike Gherrity]], [[Computer Chess Forums|rgcc]], May 16, 1997
=External Links=
* [http://www.gherrity.org/ Michael Gherrity Home]
* [http://satirist.org/learn-game/systems/sal.html SAL] from [http://satirist.org/learn-game/ Machine Learning in Games] by [[Jay Scott]]
* [http://genealogy.math.ndsu.nodak.edu/id.php?id=103352 The Mathematics Genealogy Project - Michael Gherrity]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Gherrity]]
[[Category:Programmer|Gherrity]]
