Chess Evolution Visualization

We present a chess visualization to convey the changes in a game over successive generations. It contains a score chart, an evolution graph and a chess board, such that users can understand a game from global to local viewpoints. Unlike current graphical chess tools, which focus only on highlighting pieces that are under attack and require sequential investigation, our visualization shows potential outcomes after a piece is moved and indicates how much tactical advantage the player can have over the opponent. Users can first glance at the score chart to roughly obtain the growth and decline of advantages from both sides, and then examine the position relations and the piece placements, to know how the pieces are controlled and how the strategy works. To achieve this visualization, we compute the decision tree using artificial intelligence to analyze a game, in which each node represents a chess position and each edge connects two positions that are one-move different. We then merge nodes representing the same chess position, and shorten branches where nodes on them contain only two neighbors, in order to achieve readability. During the graph rendering, the nodes containing events such as draws, effective checks and checkmates, are highlighted because they show how a game is ended. As a result, our visualization helps players understand a chess game so that they can efficiently learn strategies and tactics. The presented results, evaluations, and the conducted user studies demonstrate the feasibility of our visualization design.

[1]  Ivan Herman,et al.  Graph Visualization and Navigation in Information Visualization: A Survey , 2000, IEEE Trans. Vis. Comput. Graph..

[2]  Allen Newell,et al.  Chess-Playing Programs and the Problem of Complexity , 1958, IBM J. Res. Dev..

[3]  Carlo Batini,et al.  Automatic graph drawing and readability of diagrams , 1988, IEEE Trans. Syst. Man Cybern..

[4]  Emden R. Gansner,et al.  Graphviz - Open Source Graph Drawing Tools , 2001, GD.

[5]  Edward L. Robertson,et al.  Techniques for non-linear magnification transformations , 1996, Proceedings IEEE Symposium on Information Visualization '96.

[6]  T. A. Marsland,et al.  A Review of Game-Tree Pruning , 1986, J. Int. Comput. Games Assoc..

[7]  Hans-Jörg Schulz,et al.  Treevis.net: A Tree Visualization Reference , 2011, IEEE Computer Graphics and Applications.

[8]  Han-Wei Shen,et al.  Multiscale Time Activity Data Exploration via Temporal Clustering Visualization Spreadsheet , 2009, IEEE Transactions on Visualization and Computer Graphics.

[9]  Gautam Kumar,et al.  Visual Exploration of Complex Time-Varying Graphs , 2006, IEEE Transactions on Visualization and Computer Graphics.

[10]  Martin Morrison Official rules of chess , 1975 .

[11]  Andrew E. Johnson,et al.  Visualizing the Evolution of Community Structures in Dynamic Social Networks , 2011, Comput. Graph. Forum.

[12]  Jeffrey Heer,et al.  Tracing genealogical data with TimeNets , 2010, AVI.

[13]  Tu Bao Ho,et al.  A visualization tool for interactive learning of large decision trees , 2000, Proceedings 12th IEEE Internationals Conference on Tools with Artificial Intelligence. ICTAI 2000.

[14]  Kwan-Liu Ma,et al.  Evaluating the Effectiveness of Tree Visualization Systems for Knowledge Discovery , 2006, EuroVis.

[15]  T. Anthony Marsland,et al.  Parallel Search of Strongly Ordered Game Trees , 1982, CSUR.

[16]  Jarke J. van Wijk,et al.  BaobabView: Interactive construction and analysis of decision trees , 2011, 2011 IEEE Conference on Visual Analytics Science and Technology (VAST).

[17]  R. Daniel Bergeron,et al.  Dynamic hierarchy specification and visualization , 1999, Proceedings 1999 IEEE Symposium on Information Visualization (InfoVis'99).

[18]  Doug Kimelman,et al.  Reduction of Visual Complexity in Dynamic Graphs , 1994, Graph Drawing.

[19]  Pertti Saariluoma,et al.  Chess players' thinking : a cognitive psychological approach , 1995 .

[20]  Kwan-Liu Ma,et al.  A Tri-Space Visualization Interface for Analyzing Time-Varying Multivariate Volume Data , 2007, EuroVis.

[21]  Murray Campbell,et al.  Experiments with the Null-Move Heuristic , 1990 .

[22]  John E. Pfeiffer The thinking machine , 1962 .

[23]  Hsu-Chun Yen,et al.  Journal of Graph Algorithms and Applications on Balloon Drawings of Rooted Trees , 2022 .

[24]  Tamara Munzner,et al.  Visual Exploration of Complex Time-Varying Graphs , 2006 .

[25]  Tong-Yee Lee,et al.  Coherent Time-Varying Graph Drawing with Multifocus+Context Interaction , 2012, IEEE Transactions on Visualization and Computer Graphics.

[26]  George W. Furnas,et al.  MuSE: a multiscale editor , 1998, UIST '98.

[27]  Donald F. Beal Mating Sequences in the Quiescence Search , 1984, J. Int. Comput. Games Assoc..

[28]  Robert M. Hyatt,et al.  The Effect of Hash Signature Collisions in a Chess Program , 2005, J. Int. Comput. Games Assoc..

[29]  Matthew O. Ward,et al.  InterRing: an interactive tool for visually navigating and manipulating hierarchical structures , 2002, IEEE Symposium on Information Visualization, 2002. INFOVIS 2002..

[30]  Ernst A. Heinz Adaptive Null-Move Pruning , 1999, J. Int. Comput. Games Assoc..

[31]  Emden R. Gansner,et al.  A Technique for Drawing Directed Graphs , 1993, IEEE Trans. Software Eng..

[32]  Xin Tong,et al.  TextFlow: Towards Better Understanding of Evolving Topics in Text , 2011, IEEE Transactions on Visualization and Computer Graphics.

[33]  Heidrun Schumann,et al.  The Design Space of Implicit Hierarchy Visualization: A Survey , 2011, IEEE Transactions on Visualization and Computer Graphics.

[34]  Andrew Vande Moere,et al.  Time-Varying Data Visualization Using Information Flocking Boids , 2004, IEEE Symposium on Information Visualization.

[35]  Kwan-Liu Ma,et al.  Software evolution storylines , 2010, SOFTVIS '10.

[36]  Ernst A. Heinz Extended Futility Pruning , 1998, J. Int. Comput. Games Assoc..