A difficulty in particular Shannon-like games

DOI10.1016/0166-218X(91)90017-QzbMath0738.90098OpenAlexW1996227092MaRDI QIDQ1173983

Yōhei Yamasaki

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1016/0166-218x(91)90017-q

zbMATH Keywords

Hexgeneralized Shannon switching gamesoccupation game

Mathematics Subject Classification ID

Combinatorial games (91A46)

Related Items (2)

Shannon switching games without terminals. III ⋮ Shannon-like games are difficult

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hex ist Pspace-vollständig. (Hex is Pspace-complete)
• Shannon switching games without terminals. III
• Theory of division games
• Shannon switching games without terminals. II
• A Combinatorial Problem Which Is Complete in Polynomial Space

This page was built for publication: A difficulty in particular Shannon-like games