Johann Joss
Johann Joss,
a Swiss mathematician and Ph.D in mathematics from the ETH Zurich, in the 90s affiliated with the University Institute of Social and Preventive Medicine of Lausanne. He already started computer chess programming in 1967 on a CDC 1604 A [2], and his chess program Tell participated at the first two World Computer Chess Championships, the WCCC 1974 in Stockholm and the WCCC 1977 in Toronto, and won the first German computer chess tournament, the First GI Computer Chess Tournament, 1975 in Dortmund [3] [4].
Tit for Tat
Johann Joss also researched on the Prisoner's dilemma and Tit for tat and participated in Robert Axelrod's tournaments [5] [6] on the topic of evolution of cooperation.
Selected Publications
- Johann Joss (1976). Algorithmisches Differenzieren. Ph.D thesis, ETH Zurich, advisor Peter Jost Huber
- Allan Gottlieb, Peter W. Frey, David Levy, Johann Joss (1979). Letters on Handicapping Computer Chess Programs, ICCA Newsletter, Vol. 2, No. 1
- Alfio Marazzi, Johann Joss (1989). Probabilistic algorithms for least median of squares regression. Computational Statistics & Data Analysis, Vol. 9, 1
- Alfio Marazzi, Johann Joss, Alex Randriamiharisoa (1993). Algorithms, routines, and S functions for robust statistics: the FORTRAN library ROBETH with an interface to S-PLUS. Wadsworth And Brooks/Cole Statistics/Probability Series, amazon
External Links
References
- ↑ Johanns Blog
- ↑ Erstes Computer-Schachturnier der Gesellschaft für Informatik October 17, 1975, Computerwoche 42/1975 (German)
- ↑ Tells Geschoß: Schachmatt, October 17, 1975, Computerwoche 42/1975 (German)
- ↑ Computerschach: Mini besiegt Maxi, October 17, 1975, Computerwoche 42/1975 (German)
- ↑ Robert Axelrod (1984). The Evolution of Cooperation, pdf, pp. 32
- ↑ Ronald S. Burt (1999). Private Games are too Dangerous. pdf