25,161
edits
Changes
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..."
'''[[Main Page|Home]] * [[People]] * Jahn-Takeshi Saito'''
[[FILE:JahnTakeshiSaito.JPG|border|right|thumb| Jahn-Takeshi Saito <ref>[https://www.bigcat.unimaas.nl/staff/alumni/ BiGCaT Bioinformatics - Alumni], [[Maastricht University]]</ref> ]]
'''Jahn-Takeshi Saito''',<br/>
a Japanese German computer scientist, researcher in [[Artificial Intelligence|artificial intelligence]] and computer games, with focus on [[Monte-Carlo Tree Search|Monte-Carlo tress aearch]] and [[Proof-Number Search|proof-number search]].
He received a Master’s degree in [https://en.wikipedia.org/wiki/Computational_linguistics computational linguistics] and artificial intelligence from [https://en.wikipedia.org/wiki/University_of_Osnabr%C3%BCck University of Osnabrück] with a thesis on [[Go|Computer Go]] in 2005,
and a Ph.D. degree on ''Solving Difficult Game Positions'' at [[Maastricht University]] in 2010 <ref>[[Jahn-Takeshi Saito]] ('''2010'''). ''Solving Difficult Game Positions''. Ph.D. thesis, [[Maastricht University]], [http://www.unimaas.nl/games/files/phd/Saito_thesis.pdf pdf]</ref>.
Along with [[Guillaume Chaslot]], Jahn-Takeshi Saito is co-author of [[Go]] playing program [https://www.game-ai-forum.org/icga-tournaments/program.php?id=4 Mango] performing Monte-Carlo tree search.
=Selected Publications=
<ref>[https://dblp.org/pers/hd/s/Saito:Jahn=Takeshi dblp: Jahn-Takeshi Saito]</ref>
==2005 ...==
* [[Jahn-Takeshi Saito]] ('''2005'''). ''A pattern-based approach to monte carlo Go''. Master’s thesis, [https://en.wikipedia.org/wiki/University_of_Osnabr%C3%BCck 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 [[Maastricht University|Universiteit Maastricht]]
* [[Jahn-Takeshi Saito]], [[Guillaume Chaslot]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''2006'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-75538-8_5 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]], [https://dke.maastrichtuniversity.nl/m.winands/documents/SaitoCGW2007.pdf pdf]
* [[Mark Winands]], [[Yngvi Björnsson]], [[Jahn-Takeshi Saito]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_3 Monte-Carlo Tree Search Solver]''. [[CG 2008]], [http://www.ru.is/faculty/yngvi/pdf/WinandsBS08.pdf pdf]
* [[Jahn-Takeshi Saito]], [[Mark Winands]], [[Jaap van den Herik]] ('''2009'''). ''Randomized Parallel Proof-Number Search''. [[Advances in Computer Games 12]], [http://wwwis.win.tue.nl/bnaic2009/papers/bnaic2009_paper_23.pdf pdf]
==2010 ...==
* [[Mark Winands]], [[Yngvi Björnsson]], [[Jahn-Takeshi Saito]] ('''2010'''). ''[https://ieeexplore.ieee.org/document/5523941 Monte Carlo Tree Search in Lines of Action]''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 2, No. 4, [http://www.ru.is/~yngvi/pdf/WinandsB10a.pdf pdf]
* [[Jahn-Takeshi Saito]] ('''2010'''). ''Solving Difficult Game Positions''. Ph.D. thesis, [[Maastricht University]], [https://project.dke.maastrichtuniversity.nl/games/files/phd/Saito_thesis.pdf pdf]
* [[Akihiro Kishimoto]], [[Mark Winands]], [[Martin Müller]], [[Jahn-Takeshi Saito]] ('''2012'''). ''Game-Tree Search using Proof Numbers: The First Twenty Years''. [[ICGA Journal#35_3|ICGA Journal, Vol. 35, No. 3]]
=External Links=
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=7 Jahn-Takeshi Saito's ICGA Tournaments]
* [https://www.facebook.com/bassetfrog/about Jahn-Takeshi Saito | Facebook]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Go Programmer|Saito]]
[[Category:Researcher|Saito]]
[[FILE:JahnTakeshiSaito.JPG|border|right|thumb| Jahn-Takeshi Saito <ref>[https://www.bigcat.unimaas.nl/staff/alumni/ BiGCaT Bioinformatics - Alumni], [[Maastricht University]]</ref> ]]
'''Jahn-Takeshi Saito''',<br/>
a Japanese German computer scientist, researcher in [[Artificial Intelligence|artificial intelligence]] and computer games, with focus on [[Monte-Carlo Tree Search|Monte-Carlo tress aearch]] and [[Proof-Number Search|proof-number search]].
He received a Master’s degree in [https://en.wikipedia.org/wiki/Computational_linguistics computational linguistics] and artificial intelligence from [https://en.wikipedia.org/wiki/University_of_Osnabr%C3%BCck University of Osnabrück] with a thesis on [[Go|Computer Go]] in 2005,
and a Ph.D. degree on ''Solving Difficult Game Positions'' at [[Maastricht University]] in 2010 <ref>[[Jahn-Takeshi Saito]] ('''2010'''). ''Solving Difficult Game Positions''. Ph.D. thesis, [[Maastricht University]], [http://www.unimaas.nl/games/files/phd/Saito_thesis.pdf pdf]</ref>.
Along with [[Guillaume Chaslot]], Jahn-Takeshi Saito is co-author of [[Go]] playing program [https://www.game-ai-forum.org/icga-tournaments/program.php?id=4 Mango] performing Monte-Carlo tree search.
=Selected Publications=
<ref>[https://dblp.org/pers/hd/s/Saito:Jahn=Takeshi dblp: Jahn-Takeshi Saito]</ref>
==2005 ...==
* [[Jahn-Takeshi Saito]] ('''2005'''). ''A pattern-based approach to monte carlo Go''. Master’s thesis, [https://en.wikipedia.org/wiki/University_of_Osnabr%C3%BCck 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 [[Maastricht University|Universiteit Maastricht]]
* [[Jahn-Takeshi Saito]], [[Guillaume Chaslot]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''2006'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-75538-8_5 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]], [https://dke.maastrichtuniversity.nl/m.winands/documents/SaitoCGW2007.pdf pdf]
* [[Mark Winands]], [[Yngvi Björnsson]], [[Jahn-Takeshi Saito]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_3 Monte-Carlo Tree Search Solver]''. [[CG 2008]], [http://www.ru.is/faculty/yngvi/pdf/WinandsBS08.pdf pdf]
* [[Jahn-Takeshi Saito]], [[Mark Winands]], [[Jaap van den Herik]] ('''2009'''). ''Randomized Parallel Proof-Number Search''. [[Advances in Computer Games 12]], [http://wwwis.win.tue.nl/bnaic2009/papers/bnaic2009_paper_23.pdf pdf]
==2010 ...==
* [[Mark Winands]], [[Yngvi Björnsson]], [[Jahn-Takeshi Saito]] ('''2010'''). ''[https://ieeexplore.ieee.org/document/5523941 Monte Carlo Tree Search in Lines of Action]''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 2, No. 4, [http://www.ru.is/~yngvi/pdf/WinandsB10a.pdf pdf]
* [[Jahn-Takeshi Saito]] ('''2010'''). ''Solving Difficult Game Positions''. Ph.D. thesis, [[Maastricht University]], [https://project.dke.maastrichtuniversity.nl/games/files/phd/Saito_thesis.pdf pdf]
* [[Akihiro Kishimoto]], [[Mark Winands]], [[Martin Müller]], [[Jahn-Takeshi Saito]] ('''2012'''). ''Game-Tree Search using Proof Numbers: The First Twenty Years''. [[ICGA Journal#35_3|ICGA Journal, Vol. 35, No. 3]]
=External Links=
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=7 Jahn-Takeshi Saito's ICGA Tournaments]
* [https://www.facebook.com/bassetfrog/about Jahn-Takeshi Saito | Facebook]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Go Programmer|Saito]]
[[Category:Researcher|Saito]]
