Advertisement

Review: Computer Shogi through 2000

  • Takenobu Takizawa
  • Reijer Grimbergen
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2063)

Abstract

Since the first computer shogi program was developed by the first author in 1974, more than a quarter century has passed. During that time, shogi programming has attracted both researchers and commercial programmers and playing strength has improved steadily. Currently, the best programs have a level that is comparable to that of a strong amateur player (about 4-dan), but the level of experts is still beyond the horizon. The basic structure of strong shogi programs is similar to chess programs. However, the differences between chess and shogi have led to the development of some shogi-specific methods. In this paper we will give an overview of the computer shogi history, summarise the most successful techniques and give some ideas for the future directions of research in computer shogi.

Keywords

shogi computer shogi history evaluation function plausible move generation SUPER SOMA tsume shogi tesuji search 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    L.V. Allis, M. van der Meulen, and H.J. van den Herik. Proof-number search. Artificial Intelligence, 66:91–124, 1994.MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    R. Grimbergen.A Survey of Tsume-Shogi Programs UsingVariable-Depth Search. In H.J.van den Herik and H. Iida, editors, Computers and Games: Proceedings CG’98. LNCS 1558, pages 300–317. Springer Verlag, Berlin, 1999.CrossRefGoogle Scholar
  3. 3.
    R. Grimbergen. Plausible Move Generation Using Move Merit Analysis with Cut-Off Thresholds in Shogi. In Computers and Games: Proceedings CG2000., Hamamatsu, Japan, 2000.Google Scholar
  4. 4.
    R. Grimbergen. Report on the 10th CSA Computer-Shogi Championship. ICGA Journal, 23(2):115–120, June 2000.Google Scholar
  5. 5.
    M. Hirose, H. Matsubara, and T. Ito. The composition of Tsume-Shogi problems. In Advances in Computer Chess 8, pages 299–319, Maastricht, Holland, 1996. ISBN 9062162347.Google Scholar
  6. 6.
    Y. Kakinoki. The Search Algorithm of the Shogi Program K3.0. In H. Matsubara, editor, Computer Shogi Progress, pages 1–23. Tokyo: Kyoritsu Shuppan Co, 1996. ISBN 4-320-02799-X. (In Japanese).Google Scholar
  7. 7.
    S. Kanazawa. The Kanazawa Shogi Algorithm. In H. Matsubara, editor, Computer Shogi Progress 3, pages 15–26. Tokyo: Kyoritsu Shuppan Co, 2000. ISBN 4-320-02956-9. (In Japanese).Google Scholar
  8. 8.
    K. Koyama and Y. Kawano. Analysis of Favorable Impression Factors on Masterpieces of Tsume-shogi (Mating Problems of Japanese Chess). In Game Programming Workshop in Japan’ 94, pages 12–21, Kanagawa, Japan, 1994. (In Japanese).Google Scholar
  9. 9.
    T. Leggett. Shogi: Japan’s Game of Strategy. Charles E. Tuttle Company, England, 1966. ISBN 0-8048-1903-3.Google Scholar
  10. 10.
    D. Levy and M. Newborn. How Computers Play Chess. Computer Science Press, 1991. ISBN 0-7167-8121-2.Google Scholar
  11. 11.
    H. Matsubara and K. Handa. Some Properties of Shogi as a Game. Proceedings of Artificial Intelligence, 96(3):21–30, 1994. (In Japanese).Google Scholar
  12. 12.
    H. Matsubara, H. Iida, and R. Grimbergen. Natural developments in game research: From Chess to Shogi to Go. ICCA Journal, 19(2):103–112, June 1996.Google Scholar
  13. 13.
    D.A. McAllester. Conspiracy Numbers for Min-Max search. Artificial Intelligence, 35:287–310, 1988.MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    K. Noshita. An Algorithm for the Automatic Generation of Tsume Shogi Problems. In H. Matsubara, editor, Computer Shogi Progress 2, pages 32–46. Tokyo: Kyoritsu Shuppan Co, 1998. ISBN 4-320-02799-X. (In Japanese).Google Scholar
  15. 15.
    J. Rollason. SUPER SOMA-Solving Tactical Exchanges in Shogi without Tree Searching. In Computers and Games: Proceedings CG2000., Hamamatsu, Japan, 2000.Google Scholar
  16. 16.
    M. Seo. The C* Algorithm for AND/OR Tree Search and its Application to a Tsume-Shogi Program. Master’s thesis, Faculty of Science, University of Tokyo, 1995.Google Scholar
  17. 17.
    M. Seo. On Effective Utilization of Dominance Relations in Tsume-Shogi Solving Algorithms. In Game Programming Workshop in Japan’ 99, pages 129–136, Kanagawa, Japan, 1999. (In Japanese).Google Scholar
  18. 18.
    Y. Tanase. The IS Shogi Algorithm. In H. Matsubara, editor, Computer Shogi Progress 3, pages 1–14. Tokyo: Kyoritsu Shuppan Co, 2000. ISBN 4-320-02956-9. (In Japanese).Google Scholar
  19. 19.
  20. 20.
    H. Yamashita. YSS: About its Datastructures and Algorithm. In H. Matsubara, editor, Computer Shogi Progress 2, pages 112–142. Tokyo: Kyoritsu Shuppan Co, 1998. ISBN 4-320-02799-X. (In Japanese).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Takenobu Takizawa
    • 1
  • Reijer Grimbergen
    • 2
  1. 1.School of Political Science and EconomicsWaseda UniversityTokyoJapan
  2. 2.Complex Games LabElectrotechnical LaboratoryTsukuba-shi, Ibaraki-kenJapan

Personalised recommendations