 | 2008 |
|---|
| 13 |       | Akihiro Kishimoto,
Nathan R. Sturtevant:
Optimized algorithms for multi-agent routing.
AAMAS (3) 2008: 1585-1588 |
| 12 | | Akihiro Kishimoto,
Martin Müller:
About the Completeness of Depth-First Proof-Number Search.
Computers and Games 2008: 146-156 |
| 2007 |
|---|
| 11 | | Kazuki Yoshizoe,
Akihiro Kishimoto,
Martin Müller:
Lambda Depth-First Proof Number Search and Its Application to Go.
IJCAI 2007: 2404-2409 |
| 2006 |
|---|
| 10 |  | Haruhiro Yoshimoto,
Kazuki Yoshizoe,
Tomoyuki Kaneko,
Akihiro Kishimoto,
Kenjiro Taura:
Monte Carlo Go Has a Way to Go.
AAAI 2006 |
| 9 | | Xiaozhen Niu,
Akihiro Kishimoto,
Martin Müller:
Recognizing Seki in Computer Go.
ACG 2006: 88-103 |
| 2005 |
|---|
| 8 | | Akihiro Kishimoto,
Martin Müller:
Search versus Knowledge for Solving Life and Death Problems in Go.
AAAI 2005: 1374-1379 |
| 7 | | Akihiro Kishimoto,
Martin Müller:
Dynamic Decomposition Search: A Divide and Conquer Approach and its Application to the One-Eye Problem in Go.
CIG 2005 |
| 6 | | Jonathan Schaeffer,
Yngvi Björnsson,
Neil Burch,
Akihiro Kishimoto,
Martin Müller,
Robert Lake,
Paul Lu,
Steve Sutphen:
Solving Checkers.
IJCAI 2005: 292-297 |
| 5 | | Akihiro Kishimoto,
Martin Müller:
A solution to the GHI problem for depth-first proof-number search.
Inf. Sci. 175(4): 296-314 (2005) |
| 2004 |
|---|
| 4 | | Akihiro Kishimoto,
Martin Müller:
A General Solution to the Graph History Interaction Problem.
AAAI 2004: 644-649 |
| 2003 |
|---|
| 3 | | Akihiro Kishimoto,
Martin Müller:
DF-PN in Go: An Application to the One-Eye Problem.
ACG 2003: 125-142 |
| 2002 |
|---|
| 2 | | Akihiro Kishimoto,
Jonathan Schaeffer:
Transposition Table Driven Work Scheduling in Distributed Game-Tree Search.
Canadian Conference on AI 2002: 56-68 |
| 1 | | Akihiro Kishimoto,
Jonathan Schaeffer:
Distributed Game-Tree Search Using Transposition Table Driven Work Scheduling.
ICPP 2002: 323-330 |
