Difference between revisions of "Christoph Wirth"

From Chessprogramming wiki
Jump to: navigation, search
Line 9: Line 9:
 
* [[Anders Kierulf]], [[Ralph Gasser]], Peter M. Geiser, [[Martin Müller]], [[Jürg Nievergelt]], [[Christoph Wirth]] ('''1991'''). ''[https://link.springer.com/chapter/10.1007/978-3-642-76698-5_16 Every Interactive System Evolves into Hyperspace: The Case of the Smart Game Board]''. [https://dblp.uni-trier.de/db/conf/him/him1991.html Hypertext/Hypermedia]
 
* [[Anders Kierulf]], [[Ralph Gasser]], Peter M. Geiser, [[Martin Müller]], [[Jürg Nievergelt]], [[Christoph Wirth]] ('''1991'''). ''[https://link.springer.com/chapter/10.1007/978-3-642-76698-5_16 Every Interactive System Evolves into Hyperspace: The Case of the Smart Game Board]''. [https://dblp.uni-trier.de/db/conf/him/him1991.html Hypertext/Hypermedia]
 
* [[Jürg Nievergelt]], [[Ralph Gasser]], [[Fabian Mäser]], [[Christoph Wirth]] ('''1995'''). ''[https://link.springer.com/chapter/10.1007/BFb0015248 All the Needles in a Haystack: Can Exhaustive Search Overcom Combinatorial Chaos?]'' [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], 1000, [http://www.cis.umassd.edu/~ivalova/Spring08/cis412/Old/NH-ESOCC.PDF pdf]
 
* [[Jürg Nievergelt]], [[Ralph Gasser]], [[Fabian Mäser]], [[Christoph Wirth]] ('''1995'''). ''[https://link.springer.com/chapter/10.1007/BFb0015248 All the Needles in a Haystack: Can Exhaustive Search Overcom Combinatorial Chaos?]'' [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], 1000, [http://www.cis.umassd.edu/~ivalova/Spring08/cis412/Old/NH-ESOCC.PDF pdf]
* [[Christoph Wirth]], [[Jürg Nievergelt]] ('''1999'''). ''Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame.'' [[ICGA Journal#22_2|ICCA Journal, Vol. 22, No. 2]]
+
* [[Christoph Wirth]], [[Jürg Nievergelt]] ('''1999'''). ''Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame.'' [[ICGA Journal#22_2|ICCA Journal, Vol. 22, No. 2]] <ref>[http://kirill-kryukov.com/chess/discussion-board/viewtopic.php?f=6&t=2923 Chris Wirth's endgame tablebases] by [[Denis Mendoza|Denis P. Mendoza]], [[Computer Chess Forums|CCRL Endgame Tablebases]], December 13, 2007 » [[Chessterfield]]</ref>
 
* [[Eugene Nalimov]], [[Christoph Wirth]], [[Guy Haworth]] ('''1999'''). ''[http://centaur.reading.ac.uk/4564/ KQQKQQ and the Kasparov-World Game]''. [[ICGA Journal#22_4|ICCA Journal, Vol. 22, No. 4]]  
 
* [[Eugene Nalimov]], [[Christoph Wirth]], [[Guy Haworth]] ('''1999'''). ''[http://centaur.reading.ac.uk/4564/ KQQKQQ and the Kasparov-World Game]''. [[ICGA Journal#22_4|ICCA Journal, Vol. 22, No. 4]]  
 
* [[Jürg Nievergelt]], [[Fabian Mäser]], Bernward Mann, [http://www.math.uni-goettingen.de/roeseler/ Karsten Roeseler], [http://www.math.okstate.edu/~mschulze/ Mathias Schulze], [[Christoph Wirth]] ('''1999'''). ''Overflow CRASH! Mathematik und kombinatorsiches Chaos prallen aufeinander''. Informatik Spektrum 22, 45-48, [http://www.math.okstate.edu/~mschulze/download/crash.pdf pdf] (German)
 
* [[Jürg Nievergelt]], [[Fabian Mäser]], Bernward Mann, [http://www.math.uni-goettingen.de/roeseler/ Karsten Roeseler], [http://www.math.okstate.edu/~mschulze/ Mathias Schulze], [[Christoph Wirth]] ('''1999'''). ''Overflow CRASH! Mathematik und kombinatorsiches Chaos prallen aufeinander''. Informatik Spektrum 22, 45-48, [http://www.math.okstate.edu/~mschulze/download/crash.pdf pdf] (German)

Revision as of 12:22, 14 June 2021

Home * People * Christoph Wirth

Christoph Wirth,
a Swiss computer scientist and software engineer. While affiliated with ETH Zurich, Wirth investigated retrograde analysis for endgame tablebases with Depth to Mate (DTM) and Depth to Conversion (DTC) metrics. In collaboration with Guy Haworth, John Tamplin and Peter Karrer, data on percentage results, maximals and mutual zugzwangs, has been filed and made available on the web, as have the DTM EGTs [1].

Selected Publications

[2] [3]

1990 ...

2000 ...

References

Up one level