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

DOI10.3390/A3030244zbMATH Open1461.91073OpenAlexW2164222717MaRDI QIDQ1662552FDOQ1662552

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 gamesalgorithmic game theoryadditive combinatorics

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The On-Line Encyclopedia of Integer Sequences
• On the Addition of Residue Classes
• The Magnus-Derek game
• The c game revisited
• An algorithm for finding a nearly minimal balanced set in 𝔽_{𝕡}
• BALANCED SETS AND THE VECTOR GAME

Cited In (4)

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

This page was built for publication: An \(O(n)\)-round strategy for the Magnus-Derek game

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