Difference between revisions of "Fabian Mäser"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
Line 8: | Line 8: | ||
=Selected Publications= | =Selected Publications= | ||
− | <ref>[ | + | <ref>[[ICGA Journal#RefDB|ICGA Reference Database]]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/m/M=auml=ser:Fabian dblp: Fabian Mäser]</ref> |
==1995 ...== | ==1995 ...== | ||
* [[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] |
Latest revision as of 17:35, 16 November 2020
Fabian Mäser,
a Swiss computer scientist, FIDE Master in chess [2], and former member of Jürg Nievergelt's research group at Institute of Theoretical Computer Science at ETH Zurich. He defended his Ph.D. thesis Divide and Conquer in Game Tree Search on combinatorial game theory in 2001 [3].
He is currently affiliated with the Ergon software company in Zürich [4].
Selected Publications
1995 ...
- Jürg Nievergelt, Ralph Gasser, Fabian Mäser, Christoph Wirth (1995). All the Needles in a Haystack: Can Exhaustive Search Overcom Combinatorial Chaos? Lecture Notes in Computer Science, 1000, pdf
- Fabian Mäser (1995). Fritz vs. Deep Blue: Opening Book vs. Opening Book. Computer Chess Reports Vol. 5 No. 2 pp. 22, WCCC 1995
- Jürg Nievergelt, Fabian Mäser, Bernward Mann, Karsten Roeseler, Mathias Schulze, Christoph Wirth (1999). Overflow CRASH! Mathematik und kombinatorsiches Chaos prallen aufeinander. Informatik Spektrum 22, 45-48, pdf (German)
2000 ...
- Fabian Mäser (2001). Divide and Conquer in Game Tree Search: Algorithms, Software and Case Studies. Ph.D. thesis. ETH Zurich, pdf
- Fabian Mäser (2002). Global Threats in Combinatorial Games: A Computation Model with Applications to Chess Endgames. in Richard J. Nowakowski (ed) (2002). More Games of No Chance. Cambridge University Press, pdf
External Links
- Fabian Mäser - Ergon Informatik AG
- Maeser, Fabian FIDE Chess Profile
- Vereinsmeisterschaft 2013/2014: Open - Schachverein Wollishofen
- Vereinsmeisterschaft 2015/2016: Open - Schachverein Wollishofen
- Fabian Mäser - The Mathematics Genealogy Project
References
- ↑ Image clipped from Fabian Mäser - Ergon Informatik AG
- ↑ Maeser, Fabian FIDE Chess Profile
- ↑ Fabian Mäser (2001). Divide and Conquer in Game Tree Search: Algorithms, Software and Case Studies. Ph.D. thesis. ETH Zurich
- ↑ Ergon Company
- ↑ ICGA Reference Database
- ↑ dblp: Fabian Mäser