Pages that link to "Item:Q1173983"
From MaRDI portal
The following pages link to A difficulty in particular Shannon-like games (Q1173983):
Displaying 12 items.
- On the complexity of connection games (Q307770) (← links)
- The set coincidence game: Complexity, attainability, and symmetric strategies (Q582100) (← links)
- Shannon-like games are difficult (Q686516) (← links)
- A solution of the misère Shannon switching game (Q1110463) (← links)
- Shannon switching games without terminals. III (Q1199126) (← links)
- On the equivalence of the HEX game theorem and the Duggan-Schwartz theorem for strategy-proof social choice correspondences (Q2371435) (← links)
- Topological games at Princeton, a mathematical memoir (Q2389292) (← links)
- On the fairness and complexity of generalized \(k\)-in-a-row games (Q2456362) (← links)
- <i>N</i> by <i>N</i> Checkers is Exptime Complete (Q3316590) (← links)
- (Q3772005) (← links)
- On the Descriptive Complexity of a Simplified Game of Hex (Q4545013) (← links)
- Strategies for the Shannon Switching Game (Q4882671) (← links)