This paper aims at circular chess on the new mode of playing board games by having an automated physical platform. Hence it discusses the development of an automatic chess board called as Chess. Which enables the user to play the game of chess in different formats with the opponents moves completely based user. It uses various types in graph sets the domination game played on a graph G consists of two players, Dominator and Staller, who alternate taking turns choosing a vertex of G such that whenever a vertex is chosen by either player, at least one additional vertex is dominated. Dominator wishes to dominate the graph in as few steps as possible and Staller wishes to delay the process The game domination number Gamma (G) is the number of vertices chosen when Dominator starts the game and the Staller as much as possible. Sushisen algorithms using game domination number Gamma�(G) when Staller starts the game. An imagination strategy is developed as a general Matlab tool for proving results in the domination game.

Domination, Bipartite Graph, Game Domination number, Independence sets, Coverings and Coloring

[1] Yinkui Li,Cycle multiplicity of some total graphs,Applied Mathematics and Computation, Volume 292, 1 January 2017, Pages 107-113
[2] Sofiya Ostrovska, Mikhail I. Ostrovskii,Nonexistence of embeddings with uniformly bounded distortions of Laakso graphs into diamond graphs,Discrete Mathematics, Volume 340, Issue 2, 6 February 2017, Pages 9-17
[3] Francesco Belardo, Irene Sciriha, Slobodan K. Simić, On eigenspaces of some compound signed graphs,
[4] Linear Algebra and its Applications, Volume 509, 15 November 2016, Pages 19-39
[5] Isidoro Gitler, Enrique Reyes, Juan A. Vega, CIO and ring graphs: Deficiency and testing,
[6] Journal of Symbolic Computation, Volume 79, Part 2, March�April 2017, Pages 249-268
[7] Akbar Jahanbani, Some new lower bounds for energy of graphs, Applied Mathematics and Computation, Volume 296, 1 March 2017, Pages 233-238
[8] J. Mark Keil, Joseph S.B. Mitchell, Dinabandhu Pradhan, Martin Vatshelle, An algorithm for the maximum weight independent set problem in outerstring graphs, Computational Geometry, Volume 60, January 2017, Pages 19-25
[9] Iva Jestrović, James L. Coyle, Ervin Sejdić, A fast algorithm for vertex-frequency representations of signals on graphs, Signal Processing, Volume 131, February 2017, Pages 483-491
[10] Cemil Dibek, Tınaz Ekim, Didem G�z�pek, Mordechai Shalom, Equimatchable graphs are image-free for image,
[11] Discrete Mathematics, Volume 339, Issue 12, 6 December 2016, Pages 2964-2969.
[12] Nguyen Minh Hai, Tran Dang Phuc, Le Anh Vinh, Existentially closed graphs via permutation polynomials over finite fields, Discrete Applied Mathematics, Volume 214, 11 December 2016, Pages 116-125.
[13] Dong Ye, Yujun Yang, Bholanath Mandal, Douglas J. Klein, Graph invertibility and median eigenvalues, Linear Algebra and its Applications, Volume 513, 15 January 2017, Pages 304-323
[14] Bobo Hua, Yong Lin, Stochastic completeness for graphs with curvature dimension conditions, Advances in Mathematics, Volume 306, 14 January 2017, Pages 279-302
[15] Marta R. Hidalgo, Robert Joan-Arinyo, A Henneberg-based algorithm for generating a tree-decomposable minimally rigid graphs, Journal of Symbolic Computation, Volume 79, Part 2, March�April 2017, Pages 232-248
[16] Arman Boyacı, Tınaz Ekim, Mordechai Shalom, Shmuel Zaks, Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes�Part I, Discrete Applied Mathematics, Volume 215, 31 December 2016, Pages 47-60
[17] Klavdija Kutnar, Paweł Petecki, On automorphisms and structural properties of double generalized Petersen graphs, Discrete Mathematics, Volume 339, Issue 12, 6 December 2016, Pages 2861-2870
[18] Yao Lu, Kaizhu Huang, Cheng-Lin Liu, A fast projected fixed-point algorithm for large graph matching, Pattern Recognition, Volume 60, December 2016, Pages 971-982
[19] Chun-Cheng Lin, Weidong Huang, Wan-Yu Liu, Shierly Tanizar, Shun-Yu Jhong, Evaluating esthetics for user-sketched layouts of clustered graphs with known clustering information, Journal of Visual Languages & Computing, Volume 37, December 2016, Pages 1-11
[20] Xueyi Huang, Qiongxiang Huang, On regular graphs with four distinct eigenvalues, Linear Algebra and its Applications, Volume 512, 1 January 2017, Pages 219-233
[21] Chunmei Luo, Lance Zuo, Metric properties of Sierpiimageski-like graphs, Applied Mathematics and Computation, Volume 296, 1 March 2017, Pages 124-136
[22] Primo� Potočnik, Rok Po�ar, Smallest tetravalent half-arc-transitive graphs with the vertex-stabilizer isomorphic to the dihedral group of order 8, Journal of Combinatorial Theory, Series A, Volume 145, January 2017, Pages 172-183
[23] Brijnesh J. Jain, On the geometry of graph spaces, Discrete Applied Mathematics, Volume 214, 11 December 2016, Pages 126-144
[24] Yidong Li, Hong Shen, Congyan Lang, Hairong Dong, Practical anonymity models for protecting private weighted graphs, Neurocomputing, Volume 218, 19 December 2016, Pages 359-370
[25] Domingos M. Cardoso, Oscar Rojo, Edge perturbation on graphs with clusters: Adjacency, Laplacian and signless Laplacian eigenvalues, Linear Algebra and its Applications, Volume 512, 1 January 2017, Pages 113-128