A solution of the misère Shannon switching game
type: Item
instance of: scholarly article
title: A solution of the misère Shannon switching game
zbMATH Open document ID: 0656.90099
DOI: 10.1016/0012-365X(88)90205-1
author: Yahya Ould Hamidoune
author: Michel Las Vergnas
published in: Discrete Mathematics
publication date: 1988-01-01T00:00:00Z
review text: Let G be a graph and \(x_ 0\), \(x_ 1\) be two different vertices of G. Two players, Black and White, mark alternately non marked edges of G. White loses if and only if he marks all edges of a path connecting \(x_ 0\) and \(x_ 1\). This game is the misère version of the well-known Shannon Switching Game. We give its classification as a particular case of the classification of a more general game played on a matroid.
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 4072743
zbMATH Keywords: game played on a graph
zbMATH Keywords: game played on a matroid
zbMATH Keywords: misère version
zbMATH Keywords: Shannon Switching Game
MaRDI profile type: Publication
cites work: Q4114975
cites work: Directed switching games on graphs and matroids
cites work: A Solution of the Shannon Switching Game
cites work: Cycle games and cycle cut games
cites work: Q4111952
full work available at URL: 0012-365x(88)90205-1
OpenAlex ID: W2073647455
Recommended article: A Solution of the Shannon Switching Game
Recommended article: Strategies for the Shannon Switching Game
Recommended article: Q3714930
Recommended article: The solution to Berlekamp's switching game
Recommended article: Shannon switching games without terminals. II
Recommended article: Shannon switching games without terminals. III
Recommended article: The correct solution to Berlekamp's switching game
Recommended article: Q4536797
Recommended article: Shannon rate-efficient power allocation games
Recommended article: A difficulty in particular Shannon-like games
description: scientific article; zbMATH DE number 4072743