https://www.chessprogramming.org/index.php?title=Jahn-Takeshi_Saito&feed=atom&action=history
Jahn-Takeshi Saito - Revision history
2024-03-29T05:40:45Z
Revision history for this page on the wiki
MediaWiki 1.30.1
https://www.chessprogramming.org/index.php?title=Jahn-Takeshi_Saito&diff=11269&oldid=prev
GerdIsenberg at 15:32, 11 March 2019
2019-03-11T15:32:19Z
<p></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr style="vertical-align: top;" lang="en">
<td colspan="2" style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan="2" style="background-color: white; color:black; text-align: center;">Revision as of 15:32, 11 March 2019</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l4" >Line 4:</td>
<td colspan="2" class="diff-lineno">Line 4:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>'''Jahn-Takeshi Saito''',<br/></div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>'''Jahn-Takeshi Saito''',<br/></div></td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>a Japanese German computer scientist, researcher in [[Artificial Intelligence|artificial intelligence]] and computer games, with focus on [[Monte-Carlo Tree Search|Monte-Carlo <del class="diffchange diffchange-inline">tress aearch</del>]] and [[Proof-Number Search|proof-number search]].   </div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>a Japanese German computer scientist, researcher in [[Artificial Intelligence|artificial intelligence]] and computer games, with focus on [[Monte-Carlo Tree Search|Monte-Carlo <ins class="diffchange diffchange-inline">tree search</ins>]] and [[Proof-Number Search|proof-number search]].   </div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>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,  </div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>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,  </div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>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>.</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>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>.</div></td></tr>
</table>
GerdIsenberg
https://www.chessprogramming.org/index.php?title=Jahn-Takeshi_Saito&diff=11268&oldid=prev
GerdIsenberg: 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..."
2019-03-11T15:04:44Z
<p>Created page with "'''<a href="/Main_Page" title="Main Page">Home</a> * <a href="/People" title="People">People</a> * Jahn-Takeshi Saito''' FILE:JahnTakeshiSaito.JPG|border|right|thumb| Jahn-Takeshi Saito <ref>[https://www.bigcat.unimaas.nl/staff/alumni..."</p>
<p><b>New page</b></p><div>'''[[Main Page|Home]] * [[People]] * Jahn-Takeshi Saito'''<br />
<br />
[[FILE:JahnTakeshiSaito.JPG|border|right|thumb| Jahn-Takeshi Saito <ref>[https://www.bigcat.unimaas.nl/staff/alumni/ BiGCaT Bioinformatics - Alumni], [[Maastricht University]]</ref> ]] <br />
<br />
'''Jahn-Takeshi Saito''',<br/><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]]. <br />
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, <br />
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>.<br />
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. <br />
<br />
=Selected Publications= <br />
<ref>[https://dblp.org/pers/hd/s/Saito:Jahn=Takeshi dblp: Jahn-Takeshi Saito]</ref><br />
==2005 ...==<br />
* [[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]<br />
* [[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]]<br />
* [[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]]<br />
* [[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]<br />
* [[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]<br />
* [[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]<br />
==2010 ...==<br />
* [[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]<br />
* [[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]<br />
* [[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]]<br />
<br />
=External Links= <br />
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=7 Jahn-Takeshi Saito's ICGA Tournaments]<br />
* [https://www.facebook.com/bassetfrog/about Jahn-Takeshi Saito | Facebook]<br />
<br />
=References= <br />
<references /><br />
'''[[People|Up one level]]'''<br />
[[Category:Go Programmer|Saito]]<br />
[[Category:Researcher|Saito]]</div>
GerdIsenberg