Verifying winning strategy with symbolic model checking
Kaile Su · Computer Engineering and Applications Journal · 2008
In the research of two-player zero-sum games,verifying whether there exists winning strategy has not been solved properly,since it refers to the search of the grand scale state space.With the development of the symbolic model checking,however,verifying large systems becomes possible.This paper presents a common method of verifying the winning strategy of games with symbolic model checking,and gives a case study of Tic-Tac-Toe.