25,161
edits
Changes
no edit summary
'''[[Main Page|Home]] * [[People]] * Akihiro Kishimoto'''
[[FILE:kishi.jpg|border|right|thumb|240px|link=http://www.is.titech.ac.jp/%7Ekishi/| Akihiro Kishimoto <ref>[http://www.is.titech.ac.jp/~kishi/ Welcome to Akihiro Kishimoto's Page]</ref> ]]
'''Akihiro Kishimoto''',<br/>
a Japanese computer scientiest, research staff member at [[IBM]] Ireland, and before assistant professor at [https://en.wikipedia.org/wiki/Future_University_Hakodate Future University Hakodate]. His research interests covers [[Artificial Intelligence|artificial intelligence]], [https://en.wikipedia.org/wiki/Artificial_intelligence AIGraph_theory graph theory], [https://en.wikipedia.org/wiki/Graph_theory graph theory], and parallel/Distributed_computing distributed computing ] and [[Parallel Search|parallel search]]. Along with [[Yasushi Tanase]], and at times [[Ayumu Nagai]] and [[Norifumi Gotoh]], Akihiro Kishimoto is author of the strong [[Shogi]] program [https://www.game-ai-forum.org/icga-tournaments/program.php?id=255 [ISshogi]], and is further author of the [[Go]] playing program [https://www.game-ai-forum.org/icga-tournaments/program.php?id=102 Akebono] (9x9). Akihiro Kishimoto was a member of the GAMES group <ref>[https://webdocs.cs.ualberta.ca/~games/ The University of Alberta GAMES Group]</ref> in the Department of Computing Science at the [[University of Alberta]], and worked with [[Jonathan Schaeffer]] et al. on solving [[Checkers]] <ref>[http://webdocs.cs.ualberta.ca/~chinook/thankyou/ Chinook - Thank You]</ref>. Additionally, he worked with [[Martin Müller]] on [[Graph History Interaction|graph history interaction]], [[Proof-Number Search|proof-number search]] and [[Go|Computer computer Go]].
=Selected Publications=
<ref>[http://wwwilk.isuvt.titech.ac.jpnl/icga/journal/~kishidocs/publicationReferences.html Akihiro Kishimoto - Publicationspdf ICGA Reference Database](pdf)</ref> <ref>[httphttps://ilk.uvtdblp.nlorg/icgapers/journalhd/docsk/References.pdf ICGA Reference DatabaseKishimoto:Akihiro dblp: Akihiro Kishimoto] (pdf)</ref>
==1999==
* [[Akihiro Kishimoto]], [[Yoshiyuki Kotani]] ('''1999'''). ''Parallel AND/OR tree search based on proof and disproof numbers''. [[Conferences#GPW|5th Game Programming Workshop]]
==2000 ...==
* [[Akihiro Kishimoto]], [[Jonathan Schaeffer]] ('''2002'''). ''[https://ieeexplore.ieee.org/document/1040888 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. [httphttps://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1dblp.132.8604&rep=rep1&type=pdf pdf] via [http:org/db/citeseerx.ist.psu.educonf/viewdocicpp/summary?doi=10icpp2002.1.1.132.8604 CiteSeerXhtml ICPP 2002]* [[Akihiro Kishimoto]], [[Jonathan Schaeffer]] ('''2002'''). ''[https://link.springer.com/chapter/10.1007/3-540-47922-8_5 Transposition Table Driven Work Scheduling in Distributed Game-Tree Search]''. Fifteenth Canadian Conference on Artificial Intelligence ([https://dblp.org/db/conf/ai/ai2002.html AI'2002)], Best Paper Prize, Volume 2338 of [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Artificial Intelligence (LNAI)], pages 56-68Vol. 2338, [httphttps://wwwen.springerlinkwikipedia.com/contentorg/47b3crn04egmmx8lwiki/ Springer_Science%2BBusiness_Media Springer]
* [[Akihiro Kishimoto]], [[Martin Müller]] ('''2003'''). ''Df-pn in Go: An Application to the One-Eye Problem''. [[Advances in Computer Games 10]]
* [[Akihiro Kishimoto]], [[Martin Müller]] ('''2004'''). ''A General Solution to the Graph History Interaction Problem''. [[AAAI]] National Conference, [http://webdocs.cs.ualberta.ca/~mmueller/ps/aaai-ghi.pdf pdf]
* [[Xiaozhen Niu]], [[Akihiro Kishimoto]], [[Martin Müller]] ('''2005'''). ''[http://link.springer.com/chapter/10.1007/11922155_7 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]] [[ICGA#BestPublicationAwards|Best-Publication Award]], [http://www.is.titech.ac.jp/%7Ekishi/pdf_file/kishi_phd_thesis.pdf pdf]
* [[Akihiro Kishimoto]], [[Martin Müller]] ('''2005'''). ''A Solution to the GHI Problem for Depth-First Proof-Number Search''. 7th Joint Conference on [https://dblp.org/db/journals/isci/isci175.html Information Sciences (JCIS2003), ppVol. 489 - 492175], [http://webdocs.cs.ualberta.ca/~mmueller/ps/kishimoto-mueller-infsci-ghi.pdf 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''. [[Conferences#IJCAI2005|IJCAI 2005]]
* [[Haruhiro Yoshimoto]], [[Kazuki Yoshizoe]], [[Tomoyuki Kaneko]], [[Akihiro Kishimoto]], [[Kenjiro Taura]] ('''2006'''). ''[http://dl.acm.org/citation.cfm?id=1597359 Monte Carlo Go Has a Way to Go]''. [http://www.informatik.uni-trier.de/~ley/db/conf/aaai/aaai2006.html#YoshimotoYKKT06 AAAI 2006], [http://www.aaai.org/Papers/AAAI/2006/AAAI06-168.pdf pdf]
* [[Jonathan Schaeffer]], [[Neil Burch]], [[Yngvi Björnsson]], [[Akihiro Kishimoto]], [[Martin Müller]], [[Rob Lake]], [[Paul Lu]], [[Steve Sutphen]] ('''2007'''). ''[http://www.sciencemag.org/content/317/5844/1518.abstract Checkers is Solved]''. [https://en.wikipedia.org/wiki/Science_%28journal%29 Science], Vol. 317, no. 5844
* [[Akihiro Kishimoto]], [[Martin Müller]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_14 About the Completeness of Depth-First Proof-Number Search]''. [[CG 2008]]
* [[Akihiro Kishimoto]], [[Alex Fukunaga]], [[Adi Botea]] ('''2009'''). ''[https://www.researchgate.net/publication/216824895_Scalable_Parallel_Best-First_Search_for_Optimal_Sequential_Planning Scalable, Parallel [[Best-First]] Search for Optimal Sequential Planning]''. In Proceedings of the [http://icaps09.uom.gr/ 19th International Conference on Automated Planning and Scheduling] (ICAPS-2009) ] (Best Paper Award), pages 201-208, [http://www.is.titech.ac.jp/~kishi/pdf_file/kishimoto_fukunaga_botea_icaps2009.pdf pdf]
==2010 ...==
* [[Richard Anthony Valenzano]], [[Nathan Sturtevant]], [[Jonathan Schaeffer]], [[Mathematician#KBuro|Karen Buro]], [[Akihiro Kishimoto]] ('''2010'''). ''Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms''. [http://www.informatik.uni-trier.de/~ley/db/conf/aips/icaps2010.html#ValenzanoSSBK10 ICAPS 2010]: 177-184, [http://webdocs.cs.ualberta.ca/~jonathan/publications/ai_publications/dovetailing.pdf pdf]
* [[Kazuki Yoshizoe]], [[Akihiro Kishimoto]], [[Tomoyuki Kaneko]], [[Haruhiro Yoshimoto]], [[Yutaka Ishikawa]] ('''2011'''). ''Scalable Distributed Monte Carlo Tree Search''. [http://www.informatik.uni-trier.de/~ley/db/conf/socs/socs2011.html#YoshizoeKKYI11 SoCS2011], [http://www.is.titech.ac.jp/~kishi/pdf_file/socs2011pmcts.pdf pdf]
* [[Junichi Hashimoto]], [[Akihiro Kishimoto]], [[Kazuki Yoshizoe]], [[Kokolo Ikeda]] ('''2011'''). ''[https://www.conftool.net/acg13/index.php?page=browseSessions&form_session=3 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#35_1|ICGA Journal, Vol. 35, No. 3]]
* [[Akihiro Kishimoto]], [[Alex Fukunaga]], [[Adi Botea]] ('''2012'''). ''Evaluation of a Simple, Scalable, Parallel Best-First Search Strategy''. [https://arxiv.org/abs/1201.3204 arXiv:1201.3204]
* [[Kunihito Hoki]], [[Tomoyuki Kaneko]], [[Akihiro Kishimoto]], [[Takeshi Ito]] ('''2013'''). ''Parallel Dovetailing and its Application to Depth-First Proof-Number Search''. [[ICGA Journal#36_1|ICGA Journal, Vol. 36, No. 1]] <ref>[https://en.wikipedia.org/wiki/Dovetailing_%28computer_science%29 Dovetailing (computer science) from Wikipedia]</ref>
* [[Shogo Takeuchi]], [[Jun Kawahara]], [[Akihiro Kishimoto]], [[Shin-ichi Minato]] ('''2013'''). ''Shared-Memory Parallel Frontier-Based Search''. [http://dblp.uni-trier.de/db/conf/walcom/walcom2013.html#TakeuchiKKM13 WALCOM 2013]
* [[Akihiro Kishimoto]], [[Alex Fukunaga]], [[Adi Botea]] ('''2013'''). ''Evaluation of a simple, scalable, parallel best-first search strategy''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_(journal) Artificial Intelligence], Vol. 195==2015 ...==* [[Akihiro Kishimoto]], [[Radu Marinescu]], [[Adi Botea]] ('''2015'''). ''[https://papers.nips.cc/paper/5980-parallel-recursive-best-first-andor-search-for-exact-map-inference-in-graphical-models Parallel Recursive Best-First AND/OR Search for Exact MAP Inference in Graphical Models]''. [https://dblp.org/db/conf/nips/nips2015.html NIPS 2015]* [[Alex Fukunaga]], [[Adi Botea]], [[Yuu Jinnai]], [[Akihiro Kishimoto]] ('''2017'''). ''A Survey of Parallel A*''. [https://arxiv.org/abs/1708.05296 arXiv:1708.05296]* [[Alex Fukunaga]], [[Adi Botea]], [[Yuu Jinnai]], [[Akihiro Kishimoto]] ('''2018'''). ''[https://link.springer.com/chapter/10.1007/978-3-319-63516-3_11 Parallel A* for State-Space Search]''. [https://link.springer.com/book/10.1007/978-3-319-63516-3 Handbook of Parallel Constraint Reasoning]
=External Links=
* [http://www.is.titech.ac.jp/~kishi/ Welcome to Akihiro Kishimoto's Page]* [httphttps://researcher.watson.ibm.com/researcher/view.php?person=ie-AKIHIROK Akihiro Kishimoto - IBM]
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=84 Akihiro Kishimoto's ICGA Tournaments]
* [httphttps://spectrum.ieee.org/robotics/artificial-intelligence/ais-have-mastered-chess-will-go-be-next AIs Have Mastered Chess. Will Go Be Next?] by [[Jonathan Schaeffer]], [[Martin Müller]] & [[Akihiro Kishimoto]], [[IEEE#Spectrum|IEEE Spectrum]], June 25, 2014
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Kishimoto]]
[[Category:Go Programmer|Kishimoto]]
[[Category:Shogi Programmer|Kishimoto]]
