Abstract
Gaming industry has always relied on testing their product by playing it extensively. However, testers have their own limitations. When such a product is deployed, extreme gamers find those bugs that were overlooked by the testers. Hence testing is a best-effort service and does not assure that a particular product is working bug free. Application of formal methods to games is a vast area, but less explored. It has been applied to some of the simple games like Tic-Tac-Toe, Rush-Hour etc. Formalizing a chess game is complex since the game can enter a countably infinite number of states. In this paper we build a model which takes a sequence of moves (called as “Notation” in Chess Community) as input and verify that standard rules of the game are not violated. Specifications are written using LTL (Linear-Time Temporal Logic). We have used NuSMV (extension of Symbolic Model Verifier) as a model checking tool to verify the LTL specifications.
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
Khoussainov, B., Nerode, A.: Automata Theory and its Applications. Brikhauser, Boston (2001)
Zhang, Z.: Playing tic-tac-toe game using model checking. Technical report, University of Illinois, Chicago (November 2004)
Collette, S., Raskin, J.-F., Servais, F.: On the symbolic computation of the hardest configurations of the RUSH HOUR game. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol. 4630, pp. 220–233. Springer, Heidelberg (2007)
Storm, W.: Solving sudoku using simulink design verifier. Technical report, Lockheed Martin Aeronautics Company, Bethesda (September 2009)
Khomskii, Y.: Infinite games. Technical report, University of Sofia Bulgaria, Summer Course (July 2010)
Hurd, J.: Formal verification of chess endgame databases (2005)
FIDE: Fide handbook e.i.01b. appendices (2010), http://www.fide.com/fide/handbook.html?id=125&view=article
Huth, M., Ryan, M.: Logic in Computer Science, Modelling and Reasoning about Systems, 2nd edn. Cambridge University Press, Edinburgh, UK (2005)
Cavada, R.: Nusmv: a new symbolic model checker (2010), http://nusmv.fbk.eu/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Saralaya, V., Kishore, J.K., Reddy, S., Pai, R.M., Singh, S. (2011). Modeling and Verification of Chess Game Using NuSMV. In: Abraham, A., Lloret Mauri, J., Buford, J.F., Suzuki, J., Thampi, S.M. (eds) Advances in Computing and Communications. ACC 2011. Communications in Computer and Information Science, vol 191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22714-1_47
Download citation
DOI: https://doi.org/10.1007/978-3-642-22714-1_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22713-4
Online ISBN: 978-3-642-22714-1
eBook Packages: Computer ScienceComputer Science (R0)