論文

• Y. Soejima, A. Kishimoto, O. Watanabe. Evaluating root parallelization in Go, IEEE Transactions on Computational Intelligence and AI in Games, IEEE, Vol. 2, No. 4, pp. 278--287, Apr. 2010.
• 副田俊介, 美添一樹, 岸本章宏, 金子知適, 田中哲朗, Martin Mueller. 証明数と反証数を用いたλ探索, 情報処理学会論文誌, Vol. 48, No. 11, page 3455-3462, Nov. 2007.
• Jonathan Schaeffer, Neil Burch, Yngvi Bjornsson, Akihiro Kishimoto, Martin Mueller, Robert Lake, Paul Lu, Steve Sutphen. Checkers Is Solved, Science, Volume 317, Number 5844, page 1518-1522, Sept. 2007.
• Akihiro Kishimoto, Martin Mueller. A Solution to the GHI Problem for Depth-First Proof-Number Search, Information Sciences, Elsevier, Volume 175, Number 4, page 296-314, Nov. 2005.

著書

• 小谷善行, 岸本 章宏, 柴原一友, 鈴木豪. ゲーム計算メカニズム - 将棋・囲碁・オセロ・チェスのプログラムはどう動く, コロナ社, Jan. 2010.

国際会議発表 (査読有り)

• Y. Kobayashi, A. Kishimoto, O. Watanabe. Evaluations of hash distributed A* in optimal sequence alignment, 29th International Joint Conference on Artificial Intelligence, IJCAI Proceedings, pp. 584--590, June 2011.
• Akihiro Kishimoto, Alex Fukunaga, Adi Botea. Scalable, parallel best-first search for optimal sequential planning, 19th International Conference on Automated Planning and Scheduling (ICAPS'2009), Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS'2009), pp. 201-208, Sept. 2009.
• Akihiro Kishimoto, Martin Mueller. About the Completeness of Depth-First Proof-Number Search, 6th International Conference on Computers and Games (CG'2008), Lecture Notes in Computer Science, Springer, Volume 5131, page 146-156, Sept. 2008.
• Akihiro Kishimoto, Nathan Sturtevant. Optimized Algorithms for Multi-Agent Routing, Seventh International Conference on Autonomous Agents and Multiagent Systems (AAMAS'08), page 1585-1588, May 2008.
• Kazuki Yoshizoe, Akihiro Kishimoto, Martin Mueller. Lambda Depth-First Proof-Number Search and Its Application to Go, 20th International Joint Conference on Artificial Intelligence (IJCAI-07), page 2404-2409, Jan. 2007.
• Xiaozhen Niu, Akihiro Kishimoto, Martin Mueller. Recognizing Seki in Computer Go, 11th Advances in Computer Games (ACG 11), Lecture Notes in Computer Science, Springer, Volume 4250, page 88-103, Dec. 2006.
• Haruhiro Yoshimoto, Kazuki Yoshizoe, Tomoyuki Kaneko, Akihiro Kishimoto, Kenjiro Taura. Monte Carlo Go Has a Way to Go, Twenty-First National Conference on Artificial Intelligence (AAAI-06), page 1070-1075, July 2006.
• Akihiro Kishimoto, Martin Mueller. Search versus Knowledge for Solving Life and Death Problems in Go, Twentieth National Conference on Artificial Intelligence (AAAI-05), page 1374-1379, July 2005.
• Akihiro Kishimoto. Solving Checkers, Nineteenth International Joint Conference on Artificial Intelligence (IJCAI'05), page 292-297, July 2005.
• Akihiro Kishimoto, Martin Mueller. Dynamic Decomposition Search: A Divide and Conquer Approach and its Application to the One-Eye Problem in Go, IEEE Symposium on Computational Intelligence and Games (CIG'05), page 164-170, Apr. 2005.
• Akihiro Kishimoto, Martin Mueller. A General Solution to the Graph History Interaction Problem, Nineteenth National Conference on Artificial Intelligence (AAAI'04), page 644-649, July 2004.
• Akihiro Kishimoto, Martin Mueller. Df-pn in Go: An Application to the One-Eye Problem, Advances in Computer Games 10, Kluwer Academic Publishers, page 125-141, Nov. 2003.
• Akihiro Kishimoto, Jonathan Schaeffer. Distributed Game-Tree Search Using Transposition Table Driven Work Scheduling, 31st International Conference on Parallel Processing (ICPP'02), IEEE Computer Societey Press, page 323-330, Aug. 2002.

国内会議発表 (査読有り)

• 副島佑介, 岸本 章宏, 渡辺治. モンテカルロ木探索のRoot並列化とコンピュータ囲碁での有効性について, 第14回ゲーム・プログラミングワークショップ, Nov. 2009.
• Akihiro Kishimoto, Jonathan Schaeffer. Transposition Table Driven Work Scheduling in Distributed Game-Tree Search, Fifteenth Canadian Conference on Artificial Intelligence (AI'2002), Lecture Notes in Artificial Intelligence (LNAI), Springer, Volume 2338, page 56-68, May 2002.

国際会議発表 (査読なし・不明)

• Akihiro Kishimoto, Martin Mueller. A Solution to the GHI Problem for Depth-First Proof-Number Search, Joint Conference on Information Sciences (JCIS2003), page 489-492, July 2003.

国内会議発表 (査読なし・不明)

• 赤木維磨, 岸本 章宏. トランスポジションテーブルを用いたIDA*アルゴリズムの理論的性質について, 冬のLAシンポジウム2009, Feb. 2010.
• 副島佑介, 岸本章宏, 渡辺治. モンテカルロ木探索のroot並列化とコンピュータ囲碁での有効性について, 第14回ゲーム・プログラミングワークショップ, pp. 27--33, Nov. 2009.
• 岸本 章宏. 詰碁とコンピュータ, 統計数理研究所公開講演会, Nov. 2009.
• 岸本 章宏, Fukunaga Alex, Adi Botea. 探索アルゴリズムの並列化とプランニングへの応用, 第23回人工知能学会全国大会, June 2009.
• 岸本 章宏, Fukunaga Alex, Adi Botea. 最適解を求めるプランニング・アルゴリズムの大規模並列化について, 第22回回路とシステム軽井沢ワークショップ, Apr. 2009.

[ BibTeX 形式で保存 ]    [ 論文・著書をCSV形式で保存 ]    [ 特許をCSV形式で保存 ]