Skip to main content
SpringerLink
Log in

Solving Kriegspiel-Like Problems: Examining Efficient Search Methods

  • Conference paper
  • First Online:
Computers and Games (CG 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2063))

Included in the following conference series:

  • 884 Accesses

Abstract

We recently proposed a deterministic approach for solving problems with uncertainty, called the Uncertainty Paradigm. Under this paradigm, deterministic solving of such a problem is resolved into a plain AND/OR-tree search. The search under this paradigm is denoted by the Uncertainty Paradigm Search (UPS). As an application, we have chosen the domain of Tsuitate-Tsume-Shogi, which is the mating problem of Kriegspiel-like variant of Shogi. The early implementation of UPSwas based on a simple depth-first full-width search with iterative deepening (ID), which was unable to solve several hard problems. This paper explores an efficient search method using UPDS (Uncertainty Paradigm PDS) algorithm, which is a specialized version of PDS (Proof-number and Disproof-number Search) for UPS. UPDS generally performs better than ID or PDS, but fails to solve some easy problems. In addition, several variations of UPDS and ID have also been examined to tackle some hardest problems. All problems in the test set have been solved by a particular variation of UPDS, which shows superiority of the depth-first variants of the proof-number search in UPS.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Louis Victor Allis. Searching for Solutions in Games and Artificial Intelligence. PhD thesis, University of Limburg, Maastricht, The Netherlands, 1994.

    Google Scholar 

  2. P. Ciancarini, F. Dalla Libera, and F. Maran. Decision making under uncertainty: A rational approach to Kriegspiel. In H. Jaap van den Herik and JosW. H. M. Uiterwijk, editors, Advances in Computer Chess 8, pages 277–298. DrukkerijVan Spijk B.V.,Venlo, The Netherlands, 1997.

    Google Scholar 

  3. Thomas S. Ferguson. Mate with bishop and knight in kriegspiel. Theoretical Computer Science, 96:389–403, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  4. Ian Frank and David Basin. Search in games with incomplete information: a case study using Bridge card play. Artificial Intelligence, 100:87–123, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  5. Matthew L. Ginsberg. Partition Search. In Proceedings of Thirteenth National Conference on Artificial Intelligence, pages 228–233, Portland, Oregon, 1996.

    Google Scholar 

  6. Reijer Grimbergen. A survey of Tsume-Shogi programs using variable-depth search. In H. Jaap van den Herik and Hiroyuki Iida, editors, Proceedings of First International Conference on Computers and Games CG’98, volume 1558 of Lecture Notes in Computer Science, pages 300–317, Heidelberg, 1999. Springer.

    Google Scholar 

  7. Tetsu Kato. Collection of Kapitein documents No.1. Explanations and problems of Tsuitate-Tsume-Shogi (in Japanese), 1995.

    Google Scholar 

  8. Richard E. Korf. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search. Artificial Intelligence, 27:97–109, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  9. Ayumu Nagai. A new AND/OR tree search algorithm using proof number and disproof number. In Proceedings of Complex Games Lab Workshop, pages 40–45, ETL, Tsukuba November 1998.

    Google Scholar 

  10. Ayumu Nagai. A new depth-first-search algorithm for AND/OR trees. M.Sc. thesis, Department of Information Science, University of Tokyo, Japan, 1999.

    Google Scholar 

  11. Ayumu Nagai and Hiroshi Imai. Application of df-pn+ to Othello endgames. In Proceedings of Game Programming Workshop in Japan’ 99, pages 16–23, Hakone, Japan, October 1999.

    Google Scholar 

  12. Nils J. Nilsson. Principles of Artificial Intelligence. Tioga Publishing Company, Palo Alto, CA, 1980.

    MATH  Google Scholar 

  13. Guillermo Owen. Game Theory. Academic Press, NewYork, third edition, 1995.

    Google Scholar 

  14. D. B. Pritchard. The Encyclopedia of Chess Variants. Games & Puzzles Publications, Godalming, UK, 1994.

    Google Scholar 

  15. Makoto Sakuta and Hiroyuki Iida. An empirical comparison of innovative AND/OR-tree search algorithms on Tsume-Shogi (in Japanese, with English abstract). Studies in Information, Shizuoka University, 5:15–22, 1999.

    Google Scholar 

  16. Makoto Sakuta and Hiroyuki Iida. Solving problems with uncertainty: A case study using Tsuitate-Tsume-Shogi. In Proceedings of Game ProgrammingWorkshop in Japan’ 99, pages 145–152, Hakone, Japan, October 1999.

    Google Scholar 

  17. Makoto Sakuta and Hiroyuki Iida. Solving Kriegspiel-like problems: Exploiting a transposition table. ICGA Journal, 23(4):218–229, 2000.

    Google Scholar 

  18. Makoto Sakuta and Hiroyuki Iida. The performance of PN*, PDS, and PN Search on 6x6 Othello and Tsume-Shogi. In H. Jaap van den Herik and B. Monien, editors, Advances in Computer Games 9, pages 203–222. Universiteit Maastricht, The Netherlands, 2001.

    Google Scholar 

  19. Makoto Sakuta, Hiroyuki Iida, and Jin Yoshimura. Solving problems under Uncertainty Paradigm. In Proceedings of International Conference on Advances in Infrastructure for Electronic Business, Science and Education on the Internet (SSGRR 2000), L’Aquila, Italy, August 2000. (in CD-ROM).

    Google Scholar 

  20. Masahiro Seo. The C* algorithm for AND/OR tree search and its application to a Tsume-Shogi program. M.Sc. thesis, Department of Information Science, University ofTokyo, Japan, 1995.

    Google Scholar 

  21. Masahiro Seo, Hiroyuki Iida, and Jos W.H.M. Uiterwijk. The PN*-search algorithm: Application to tsume-shogi. Artificial Intelligence, 129(1-2): 253–277, 2001.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Shizuoka University, 3-5-1 Johoku, Hamamatsu, 432-8011, Japan

    Makoto Sakuta & Hiroyuki Iida

Authors
  1. Makoto Sakuta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hiroyuki Iida
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Alberta, Edmonton, Alberta, Canada

    Tony Marsland

  2. Future University - Hakodate, Hakodate, Hokkaido, Japan

    Ian Frank

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sakuta, M., Iida, H. (2001). Solving Kriegspiel-Like Problems: Examining Efficient Search Methods. In: Marsland, T., Frank, I. (eds) Computers and Games. CG 2000. Lecture Notes in Computer Science, vol 2063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45579-5_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-45579-5_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43080-3

  • Online ISBN: 978-3-540-45579-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation