Finding winning strategies in games on graphs

MaRDI QIDQ5507329zbMATH OpenFDO

Authors V. A. Bogun, S. V. Polotskiy

Publication date 16 December 2016

zbMATH Keywords

games on graphscombinatorial games

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Combinatorial games (91A46)

Recommendations

• Learning of winning strategies for terminal games with linear-size memory
• Deterministic graphical games revisited
• On the inference of strategies
• scientific article; zbMATH DE number 3887475
• Infinite games played on finite graphs

Cited in

(3)

• Learning of winning strategies for terminal games with linear-size memory
• Winner determination algorithms for graph games with matching structures
• Determining the results of tournament games using complete graphs generation

This page was built for publication: Finding winning strategies in games on graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5507329)