A COMMON ALGORITHM FOR GRAPH-INTERPRETABLE GAMES

Abstract

Winning Strategies of graph-interpretable games can be obtained by using “Kernels” of underlying graphs. S.A. Dunning has considered canonical forms of given game graphs which are full subgraphs of the “universal game”. This gives light to the theoretical approach to games. This paper presents a common algorithm for game graphs.