Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics
Online ISSN : 1883-2172
Print ISSN : 0373-6385
ISSN-L : 0373-6385
A COMMON ALGORITHM FOR GRAPH-INTERPRETABLE GAMES
Makoto HARAGUCHI
著者情報
ジャーナル フリー

1977 年 31 巻 2 号 p. 259-266

詳細
抄録
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.
著者関連情報
© 1977 by Department of Mathematics, Faculty of Science, Kyushu University
前の記事 次の記事
feedback
Top