Abstract
We have modified the rules of chess to create a game of imperfect information. By introducing hidden pieces into the game, we have been able to gauge the effect of uncertainty on playing strength. The addition of a hidden white piece led to white winning between 63%-89% of its games. The advantage gained from an invisible piece is dependent on both the type of piece that is hidden, and the search depth at which games are played. Greater search depths increase the value of hidden pieces, although diminishing returns were noted at increased depths. The advantage of a hidden piece is typically greater than the effect of an equivalent extra piece. In this sense, information superiority gained via stealth is a more powerful advantage than additional material. The results indicate that uncertainty arising from hidden pieces profoundly influences outcomes in the game of chess.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bud, A.E., Albrecht, D.W., Nicholson, A.E., Zukerman, I.: Information-Theoretic advisors in Invisible Chess. Game Theoretic and Decision Theoretic Agents. In: Papers from the 2001 AAAI Symposium. Technical Report SS-01-03, pp. 6–15. AAAI Press, Menlo Park (2001)
Smet, P., Calbert, G., Scholz, J.B., Gossink, D., Kwok, H.-W., Webb, M.: The Effects of Material, Tempo and Search Depth on Win-Loss Ratios in Chess. In: Gedeon, T(T.) D., Fung, L.C.C. (eds.) AI 2003. LNCS (LNAI), vol. 2903, pp. 501–510. Springer, Heidelberg (2003)
http://www.fide.com/official/handbook.asp?level=EE101/Article11:scoring (2000)
Sonas, J.: The sonas rating formula - better than Elo (2003), http://www.chesscenter.com/twic/event/sonas/sonasrat.html
Knuth, D.E.: The Art of Computer Programming, Seminumerical algorithms, vol. 2. Addison-Wesley, Reading (1981)
Clancy, T., Horner, C.: Every Man a Tiger, p. 361. Berkley Books, New York (1999)
Thompson, K.: Computer Chess Strength. In: Clarke, M.R.B. (ed.) Advances in Computer Chess, Pergamon, pp. 55–56 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Smet, P., Gossink, D., Calbert, G. (2005). The Value of Stealth in the Game of Chess. In: Zhang, S., Jarvis, R. (eds) AI 2005: Advances in Artificial Intelligence. AI 2005. Lecture Notes in Computer Science(), vol 3809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11589990_23
Download citation
DOI: https://doi.org/10.1007/11589990_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30462-3
Online ISBN: 978-3-540-31652-7
eBook Packages: Computer ScienceComputer Science (R0)