Akihiro Kishimoto, a Japanese computer scientiest, research staff member at IBM Ireland, and before assistant professor at Future University Hakodate. His research interests covers AI, graph theory, and parallel/distributed computing and search. Along with Yasushi Tanase, and at times Ayumu Nagai and Norifumi Gotoh, Akihiro Kishimoto is author of the strong Shogi program ISshogi, and is further author of the Go program Akebono (9x9). Akihiro Kishimoto was a member of the GAMES group [1] in the Department of Computing Science at the University of Alberta, and worked with Jonathan Schaeffer et al. on solving Checkers [2]. Additionally, he worked with Martin Müller on Graph History Interaction, Proof-number search and Computer Go.
Akihiro Kishimoto [3]

Selected Publications

1999

• Akihiro Kishimoto, Yoshiyuki Kotani (1999). Parallel AND/OR tree search based on proof and disproof numbers. 5th Game Programming Workshop

2000 ...

• Akihiro Kishimoto, Jonathan Schaeffer (2002). Distributed Game-Tree Search Using Transposition Table Driven Work Scheduling, In Proc. of 31st International Conference on Parallel Processing (ICPP'02), pages 323-330, IEEE Computer Society Press. pdf via CiteSeerX
• Akihiro Kishimoto, Jonathan Schaeffer (2002). Transposition Table Driven Work Scheduling in Distributed Game-Tree Search. Fifteenth Canadian Conference on Artificial Intelligence (AI'2002), Best Paper Prize, Volume 2338 of Lecture Notes in Artificial Intelligence (LNAI), pages 56-68, Springer
• Akihiro Kishimoto, Martin Müller (2003). Df-pn in Go: An Application to the One-Eye Problem. Advances in Computer Games 10, pdf.
• Akihiro Kishimoto, Martin Müller (2004). A General Solution to the Graph History Interaction Problem. AAAI National Conference, pdf

2005 ...

• Xiaozhen Niu, Akihiro Kishimoto, Martin Müller (2005). Recognizing Seki in Computer Go. Advances in Computer Games 11
• Akihiro Kishimoto (2005). Correct and Efficient Search Algorithms in the Presence of Repetitions. Ph.D. thesis, University of Alberta, Received the 2005 ChessBase Best-Publication Award, pdf
• Akihiro Kishimoto, Martin Müller (2005). A Solution to the GHI Problem for Depth-First Proof-Number Search. 7th Joint Conference on Information Sciences (JCIS2003), pp. 489 - 492, pdf » Graph History Interaction
• Jonathan Schaeffer, Yngvi Björnsson, Neil Burch, Akihiro Kishimoto, Martin Müller, Rob Lake, Paul Lu, Steve Sutphen (2005). Solving Checkers. IJCAI 2005
• Haruhiro Yoshimoto, Kazuki Yoshizoe, Tomoyuki Kaneko, Akihiro Kishimoto, Kenjiro Taura (2006). Monte Carlo Go Has a Way to Go. AAAI 2006, pdf
• Kazuki Yoshizoe, Akihiro Kishimoto, Martin Müller. (2007). Lambda Depth-First Proof-Number Search and Its Application to Go. IJCAI 2007, pdf
• Jonathan Schaeffer, Neil Burch, Yngvi Björnsson, Akihiro Kishimoto, Martin Müller, Rob Lake, Paul Lu, Steve Sutphen (2007). Checkers is Solved. Science, Vol. 317, no. 5844
• Akihiro Kishimoto, Martin Müller (2008). About the Completeness of Depth-First Proof-Number Search. CG 2008
• Akihiro Kishimoto, Alex Fukunaga, Adi Botea (2009). Scalable, Parallel Best-First Search for Optimal Sequential Planning. In Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS-2009) (Best Paper Award), pages 201-208, pdf

2010 ...

• Richard Anthony Valenzano, Nathan Sturtevant, Jonathan Schaeffer, Karen Buro, Akihiro Kishimoto (2010). Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms. ICAPS 2010: 177-184, pdf
• Kazuki Yoshizoe, Akihiro Kishimoto, Tomoyuki Kaneko, Haruhiro Yoshimoto, Yutaka Ishikawa (2011). Scalable Distributed Monte Carlo Tree Search. SoCS2011, pdf
• Junichi Hashimoto, Akihiro Kishimoto, Kazuki Yoshizoe, Kokolo Ikeda (2011). Accelerated UCT and Its Application to Two-Player Games. Advances in Computer Games 13
• 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
• Kunihito Hoki, Tomoyuki Kaneko, Akihiro Kishimoto, Takeshi Ito (2013). Parallel Dovetailing and its Application to Depth-First Proof-Number Search. ICGA Journal, Vol. 36, No. 1 ^[6]
• Shogo Takeuchi, Jun Kawahara, Akihiro Kishimoto, Shin-ichi Minato (2013). Shared-Memory Parallel Frontier-Based Search. WALCOM 2013

External Links

• Welcome to Akihiro Kishimoto's Page
• Akihiro Kishimoto - IBM
• Akihiro Kishimoto's ICGA Tournaments
• AIs Have Mastered Chess. Will Go Be Next? by Jonathan Schaeffer, Martin Müller & Akihiro Kishimoto, IEEE Spectrum, June 25, 2014

References

1. ^ The University of Alberta GAMES Group
2. ^ Solving Checkers
3. ^ Welcome to Akihiro Kishimoto's Page
4. ^ Akihiro Kishimoto - Publications
5. ^ ICGA Reference Database (pdf)
6. ^ Dovetailing (computer science) from Wikipedia

What links here?