Skip to main content

Analyze and Guess Type of Piece in the Computer Game Intelligent System

  • Conference paper
Fuzzy Systems and Knowledge Discovery (FSKD 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3614))

Included in the following conference series:

Abstract

Siguo game is an interesting test-bed for artificial intelligent research. It is a game of imperfect information, where completing players must deal with possible knowledge, risk assessment, and possible deception and leaguing players have to deal with cooperation and information signal transmission. Since Siguo game is imperfect information game that the player doesn’t know the type of piece and strategy that opponent moves, to exactly guess type of opponent’ piece is a very important parameter to evaluate the capability of Siguo game program. In this paper, we first construct a fuzzy type table by analyzing more than one thousand different embattle lineups (i.e. chess manuals) of Siguo game, and then we present a algorithm that updates type table by using information from opponent during playing game. The updating type of pieces algorithm is designed by considering the two strategies, i.e. optimism and pessimism based on the fuzzy notion. At last we give a method to guess the type of piece by using fuzzy type proximity relation between two neighboring pieces.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Shannon, C.E.: Programming a computer for playing chess. Philos. Mag. 41(7), 256–275 (1950)

    MATH  MathSciNet  Google Scholar 

  2. van den Herik, H.J., van Rijswijck, J., et al.: Games solved: Now and in the future. Artificial Intelligence 134, 277–311 (2002)

    Article  MATH  Google Scholar 

  3. Fraenkel, A.S.: Complexity, appeal and challenges of combinatorial games. Theor. Comput. Sci. 303(3), 393–415 (2004)

    Article  MathSciNet  Google Scholar 

  4. Hsu, F.-h.: Behind Deep Blue. Princeton University Press, Princeton (2002)

    MATH  Google Scholar 

  5. McGrew, T.: Collaborative intelligence. The Internet Chess Club on game 2 of Kasparov vs. Deep Blue. In: Internet Computing, pp. 38–42. IEEE, Los Alamitos (1997)

    Google Scholar 

  6. Newborn, M.: Kasparov versus DEEP BLUE:Computer Chess Comes of Age. Springer, New York; ISBN 0-387-94820-1

    Google Scholar 

  7. Schaeffer, J., Culberson, J., Treloar, N., Knight, B., Lu, P., Szafron, D.: A world championship caliber checkers program. Artificial Intelligence 53(2–3), 273–289 (1992)

    Article  Google Scholar 

  8. Tesauro, G.: TD-Gammon, a self-teaching Backgammon program achieves master-level play. Neural,Comput. 6(2), 215–219 (1994)

    Article  Google Scholar 

  9. Iida, H., Sakuta, M., Rollason, J.: Computer shogi. Artificial intelligent 134(1-2), 121–144

    Google Scholar 

  10. Buro, M.: How machines have learned to play Othello. IEEE Intelligent Systems J. 14(6), 12–14 (1999)

    Google Scholar 

  11. Fang, H.-r., Hsu, T.-s., Hsu, S.-C.: Construction of Chinese Chess endgame databases by retrograde analysis. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol. 2063, pp. 99–118. Springer, Heidelberg (2002)

    Google Scholar 

  12. Wu, R., Beal, D.F.: Computer analysis of some Chinese Chess endgames. Advances in Computer Games 9, 261–273, Universities Maastricht (2001)

    Google Scholar 

  13. Thomsen, T.: Lambda-search in game trees—with application to Go. ICGA J. 23(4), 203–217 (2000)

    Google Scholar 

  14. Uiterwijk, J.W.H.M.: Knowledge and strategies in Go-Moku. In: van den Herik, H.J., Allis, L.V. (eds.) Heuristic Programming in Artificial Intelligence 3: The Third Computer Olympiad, pp. 165–179. Ellis Horwood, Chichester (1992)

    Google Scholar 

  15. Thorp, E.O., Walden, W.E.: A computer-assisted study of Go on M × N boards. Information Sciences 4, 1–33 (1972)

    MathSciNet  Google Scholar 

  16. Ginsberg, M.: GIB: Imperfect information in a computationally challenging game. J. Artificial Intelligence Res. 14, 303–358 (2001)

    MATH  Google Scholar 

  17. Zadeh, L.A.: Fuzzy sets. Inform. Control 8, 338–353 (1965)

    Article  MATH  MathSciNet  Google Scholar 

  18. Bjornsson, Y., Marsland, T., Schaeffer, J., Junghanns, A.: Searching with Uncertainty Cut-Offs. Advances in Computer Chess 8, 167–179

    Google Scholar 

  19. http://www.ourgame.com

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xia, Z.Y., Hu, Y.A., Wang, J., Jiang, Y.C., Qin, X.L. (2005). Analyze and Guess Type of Piece in the Computer Game Intelligent System. In: Wang, L., Jin, Y. (eds) Fuzzy Systems and Knowledge Discovery. FSKD 2005. Lecture Notes in Computer Science(), vol 3614. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11540007_155

Download citation

  • DOI: https://doi.org/10.1007/11540007_155

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28331-7

  • Online ISBN: 978-3-540-31828-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics