Advertisement

A Survey of Tsume-Shogi Programs Using Variable-Depth Search

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

Abstract

Recently, a number of programs have been developed that successfully apply variable-depth search to find solutions for mating problems in Japanese chess, called tsume shogi. Publications on this research domain have been written mainly in Japanese. To present the findings of this research to a wider audience, we compare six different tsume programs. To find the solutions of difficult tsume-shogi problems with solution sequences longer than 20 plies, we will see that variable-depth search and hashing to deal with a combination of transposition, domination and simulation leads to strong tsume-shogi programs that outperform human experts, both in speed and in the number of problems for which the solution can be found. The best program has been able to solve Microcosmos, a tsume-shogi problem with a solution sequence of 1525 plies.

Keywords

Variable-depth search best-first search conspiracy-number search game playing tsume shogi 
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. Searching for Solutions in Games and Artificial Intelligence PhD thesis, The Netherlands: University of Limburg, 1994. ISBN 90-9007488-0.Google Scholar
  2. [2]
    L.V. Allis, M. van der Meulen, and H.J. van den Herik. Proof-number search. Artificial Intelligence, 66:91–124, 1994.MATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    T. Anantharaman, M.S. Campbell, and F. Hsu. Singular extensions: Adding selectivity to brute-force searching. Artificial Intelligence, 43:99–109, 1990.CrossRefGoogle Scholar
  4. [4]
    A.D. de Groot. Thought and Choice in Chess. The Hague, The Netherlands: Mouton & Co, 1965.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]
    K. Ito. Best-first search to solve tsume shogi problems. In H. Matsubara, editor, Computer Shogi Progress, pages 71–89. Tokyo: Kyoritsu Shuppan Co, 1996. ISBN 4-320-02799-X. (In Japanese).Google Scholar
  7. [7]
    K. Ito, Y. Kawano, and K. Noshita. On the algorithms for solving tsume-shogi with extremely long solution-steps. Journal of the Information Processing Society of Japan, 36(12):2793–2799, 1995. (In Japanese).Google Scholar
  8. [8]
    K. Ito, Y. Kawano, M. Seo, and K. Noshita. Tsume shogi. In H. Matsubara and I. Takeuchi, editors, BIT special issue: Game Programming, pages 130–138. Kyoritsu Shuppan Co., Tokyo, Japan, 1997. ISBN 00110-2-57035. (In Japanese).Google Scholar
  9. [9]
    K. Ito and K. Noshita. Two fast programs for solving tsume-shogi and their evaluation. Journal of the Information Processing Society of Japan, 35(8):1531–1539, 1994. (In Japanese).Google Scholar
  10. [10]
    T. Ito, Y. Kawano, M. Seo, and K. Noshita. Recent progress in solving tsume-shogi by computers. Journal of the Japanese Society of Artificial Intelligence, 10(6):853–859, 1995. (In Japanese).Google Scholar
  11. [11]
    Y. Kadowaki. Tsumuya-tsumazaruya, Shogi-Muso, Shogi-Zuko. Tokyo: Heibon-sha, 1975. ISBN 4-582-80282-0. (in Japanese).Google Scholar
  12. [12]
    Y. Kadowaki. Zoku-tsumuya-tsumazaruya. Tokyo: Heibon-sha, 1978. ISBN 4-582-80335-0. (in Japanese).Google Scholar
  13. [13]
    Y. Kawano. Using similar positions to search game trees. In R.J. Nowakowski, editor, Games of no chance (Combinatorial games at MSRI, Berkeley 1994), pages 193–202. Cambridge: University Press, 1996.Google Scholar
  14. [14]
    Y. Kawano. Personal communication, 1998.Google Scholar
  15. [15]
    R.E. Korf and D.M. Chickering. Best-first minimax search. Artificial Intelligence, 84:299–337, 1996.CrossRefMathSciNetGoogle Scholar
  16. [16]
    Y. Kotani, T. Yoshikawa, Y. Kakinoki, and K. Morita. Computer Shogi. Tokyo: Saiensu-sha, 1990. (in Japanese.).Google Scholar
  17. [17]
    H. Matsubara. Shogi to computer (Shogi and computers). Kyoritsu Shuppan Co., Tokyo, Japan, 1994. ISBN 4-320-02681-0. (In Japanese).Google Scholar
  18. [18]
    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
  19. [19]
    H. Matsubara, H. Iida, and R. Grimbergen. Natural developments in game research. ICCA Journal, 19(2):103–112, June 1996.Google Scholar
  20. [20]
    D.A. McAllester. Conspiracy numbers for min-max search. Artificial Intelligence, 35:287–310, 1988.MATHCrossRefMathSciNetGoogle Scholar
  21. [21]
    K. Morita. Personal communication, 1996.Google Scholar
  22. [22]
    Y. Nakayama, T. Akazawa, and K. Noshita. A parallel algorithm for solving hard tsume shogi problems. ICCA Journal, 19(2):94–99, June 1996.Google Scholar
  23. [23]
    N. Nilsson. Problem Solving Methods in Artificial Intelligence. New York: McGraw-Hill, 1971.Google Scholar
  24. [24]
    K. Noshita. How to make a quick and accurate tsume-shogi solver. Shingaku-Kenkyukai, COMP91, 56:29–37, 1991. (In Japanese).Google Scholar
  25. [25]
    K. Noshita. The tsume shogi solver T2. In H. Matsubara, editor, Computer Shogi Progress, pages 50–70. Tokyo: Kyoritsu Shuppan Co, 1996. ISBN 4-320-02799-X. (In Japanese).Google Scholar
  26. [26]
    K. Noshita. Personal communication, 1998.Google Scholar
  27. [27]
    J. Schaeffer. Conspiracy numbers. Artificial Intelligence, 43:67–84, 1990.CrossRefGoogle Scholar
  28. [28]
    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
  29. [29]
    M. Seo. A tsume shogi solver using conspiracy numbers. In H. Matsubara, editor, Computer Shogi Progress 2, pages 1–21. Tokyo: Kyoritsu Shuppan Co, 1998. ISBN 4-320-02799-X. (In Japanese).Google Scholar
  30. [30]
    G. Stockman. A minimax algorithm better than alpha-beta? Artificial Intelligence, 12:179–196, 1979.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Reijer Grimbergen
    • 1
  1. 1.Electrotechnical LaboratoryIbaraki-kenJapan

Personalised recommendations