Johann Joss
From Chessprogramming wiki
Jump to:navigation,search
Johann Joss[1]
Johann Joss,
a Swiss mathematician and Ph.D in mathematics from theETH Zurich, in the 90s affiliated with theUniversity Institute of Social and Preventive Medicine of Lausanne. He already started computer chess programming in 1967 on aCDC 1604 A[2], and his chess programTell participated at the first twoWorld Computer Chess Championships, theWCCC 1974 inStockholm and theWCCC 1977 inToronto, and won the first German computer chess tournament, theFirst GI Computer Chess Tournament, 1975 inDortmund[3][4].
Tit for Tat
Johann Joss also researched on thePrisoner's dilemma andTit for tat and participated inRobert Axelrod'stournaments[5][6] on the topic ofevolution of cooperation.
Selected Publications
- Johann Joss (1976).Algorithmisches Differenzieren. Ph.D thesis,ETH Zurich, advisorPeter Jost Huber
- Allan Gottlieb,Peter W. Frey,David Levy,Johann Joss (1979). Letters onHandicapping 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
