Shannon-like games are difficult

DOI10.1016/0012-365X(93)90185-VzbMATH Open0786.90107OpenAlexW2068388510MaRDI QIDQ686516FDOQ686516

Authors: Yōhei Yamasaki 

Publication date: 20 December 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90185-v

Recommendations

• A difficulty in particular Shannon-like games
• Strategies for the Shannon Switching Game
• A Solution of the Shannon Switching Game
• Entangled games are hard to approximate
• scientific article; zbMATH DE number 4031440
• A solution of the misère Shannon switching game
• The Game of n-Player Shove and Its Complexity
• Shannon switching games without terminals. II
• scientific article; zbMATH DE number 3943587
• Playing games with bounded entropy

zbMATH Keywords

\(n\)-pair gamesShannon switching game

Mathematics Subject Classification ID

Games involving graphs (91A43)

Cites Work

• Title not available (Why is that?)
• Hex ist Pspace-vollständig. (Hex is Pspace-complete)
• A difficulty in particular Shannon-like games
• Shannon switching games without terminals. III
• Theory of division games
• Shannon switching games without terminals. II

Cited In (4)

• Shannon switching games without terminals. III
• Game edge-connectivity of graphs
• Strategies for the Shannon Switching Game
• Title not available (Why is that?)

This page was built for publication: Shannon-like games are difficult

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