Jahn-Takeshi Saito
Revision as of 17:04, 11 March 2019 by GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Jahn-Takeshi Saito''' FILE:JahnTakeshiSaito.JPG|border|right|thumb| Jahn-Takeshi Saito <ref>[https://www.bigcat.unimaas.nl/staff/alumni...")
Home * People * Jahn-Takeshi Saito
Jahn-Takeshi Saito [1]
Jahn-Takeshi Saito,
a Japanese German computer scientist, researcher in artificial intelligence and computer games, with focus on Monte-Carlo tress aearch and proof-number search.
He received a Master’s degree in computational linguistics and artificial intelligence from University of Osnabrück with a thesis on Computer Go in 2005,
and a Ph.D. degree on Solving Difficult Game Positions at Maastricht University in 2010 [2].
Along with Guillaume Chaslot, Jahn-Takeshi Saito is co-author of Go playing program Mango performing Monte-Carlo tree search.
Selected Publications
2005 ...
- Jahn-Takeshi Saito (2005). A pattern-based approach to monte carlo Go. Master’s thesis, University of Osnabrück
- Jaap van den Herik, Jeroen Donkers, Jos Uiterwijk, Guillaume Chaslot, Sander Bakkes, Jahn-Takeshi Saito (2006). Intelligent Search Techniques Proof-Number Search. MICC/IKAT Universiteit Maastricht
- Jahn-Takeshi Saito, Guillaume Chaslot, Jos Uiterwijk, Jaap van den Herik (2006). Monte-Carlo Proof-Number Search for Computer Go. CG 2006
- Jahn-Takeshi Saito, Mark Winands, Jos Uiterwijk, Jaap van den Herik (2007). Grouping Nodes for Monte-Carlo Tree Search. CGW 2007, pdf
- Mark Winands, Yngvi Björnsson, Jahn-Takeshi Saito (2008). Monte-Carlo Tree Search Solver. CG 2008, pdf
- Jahn-Takeshi Saito, Mark Winands, Jaap van den Herik (2009). Randomized Parallel Proof-Number Search. Advances in Computer Games 12, pdf
2010 ...
- Mark Winands, Yngvi Björnsson, Jahn-Takeshi Saito (2010). Monte Carlo Tree Search in Lines of Action. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 2, No. 4, pdf
- Jahn-Takeshi Saito (2010). Solving Difficult Game Positions. Ph.D. thesis, Maastricht University, pdf
- Akihiro Kishimoto, Mark Winands, Martin Müller, Jahn-Takeshi Saito (2012). Game-Tree Search using Proof Numbers: The First Twenty Years. ICGA Journal, Vol. 35, No. 3
External Links
References
- ↑ BiGCaT Bioinformatics - Alumni, Maastricht University
- ↑ Jahn-Takeshi Saito (2010). Solving Difficult Game Positions. Ph.D. thesis, Maastricht University, pdf
- ↑ dblp: Jahn-Takeshi Saito
