|
|||||
|
|
| 基于符号化模型检测的对弈必胜策略验证 | |
| 引用本文： | 何青,骆翔宇,苏开乐.基于符号化模型检测的对弈必胜策略验证[J].计算机工程与应用,2008,44(17):58-60. |
| 作者姓名： | 何青 骆翔宇 苏开乐 |
| 作者单位： | 1. 湖南文理学院计算机科学与技术系,湖南,常德,415000 2. 桂林电子科技大学计算机与控制学院计算机系,广西,桂林,541004 3. 中山大学信息科学与技术学院计算机科学系,广州,510275 |
| 摘 要： | 在对弈的研究中,验证对弈双方是否存在必胜策略的问题一直没能很好地解决,因为这涉及到超大规模的状态空间搜索。而随着符号化模型检测技术的发展,大规模系统的验证成为了可能。给出了使用符号化模型检测来验证对弈必胜策略的一般方法,并给出了一个井字棋必胜策略验证的实例。 |
| 关 键 词： | 符号化模型检测 二值判定图 对弈 必胜策略 |
| 收稿时间： | 2007-11-9 |
| 修稿时间： | 2008-2-3 |
Verifying winning strategy with symbolic model checking |
|
| HE Qing,LUO Xiang-yu,SU Kai-le.Verifying winning strategy with symbolic model checking[J].Computer Engineering and Applications,2008,44(17):58-60. | |
| Authors: | HE Qing LUO Xiang-yu SU Kai-le |
| Affiliation: | 1.Department of Computer Science，Hunan University of Arts and Science，Changde，Hunan 415000，China 2.Department of Computer Science，Guilin University of Electronic Technology，Guilin，Guangxi 541004，China 3.Department of Computer Science，Sun Yat-Sen University，Guangzhou 510275，China |
| Abstract: | 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. |
| Keywords: | symbolic model checking BDD zero-sum games winning strategy |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 | |
| 点击此处可从《计算机工程与应用》下载全文 | |
