conference-paper

Formal verification for winning strategy of chess game

Research footprint

At a glance

الاستشهادات
2
المراجع
6
Comments
0
Paper overview

Abstract

This paper presents a formal method to verify the winning strategy in a chess game by means of symbolic model checking, and demonstrate the winning strategy in tic-tac-toe game through the symbolic model checking tool NuSMV improved with the verification algorithm for winning strategy.

Record transparency

Publication details

DOI
10.1109/iwcsn.2017.8276504
OpenAlex
W2785846899
Document type
conference-paper
Language
EN
Last metadata update
المجتمع

Comments

تسجيل الدخول للانضمام إلى النقاش.

  1. لا توجد تعليقات بعد. ابدأ النقاش.