An \(O(n)\)-round strategy for the Magnus-Derek game

DOI10.3390/a3030244zbMath1461.91073OpenAlexW2164222717MaRDI QIDQ1662552

Zhivko Nedev

Publication date: 20 August 2018

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a3030244

zbMATH Keywords

combinatorial gamesadditive combinatoricsalgorithmic game theory

Mathematics Subject Classification ID

Analysis of algorithms (68W40) 2-person games (91A05) Combinatorics in computer science (68R05) Combinatorial games (91A46)

Related Items

The explorer-director game on graphs ⋮ Lower bound for balanced sets ⋮ Palindromes in finite groups and the Explorer-Director game

Cites Work

• Unnamed Item
• Unnamed Item
• The c game revisited
• The Magnus-Derek game
• An algorithm for finding a nearly minimal balanced set in 𝔽_{𝕡}
• BALANCED SETS AND THE VECTOR GAME
• On the Addition of Residue Classes