Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Poset Positional Games (2404.07700v2)

Published 11 Apr 2024 in math.CO, cs.DM, and cs.GT

Abstract: We propose a generalization of positional games, supplementing them with a restriction on the order in which the elements of the board are allowed to be claimed. We introduce poset positional games, which are positional games with an additional structure -- a poset on the elements of the board. Throughout the game play, based on this poset and the set of the board elements that are claimed up to that point, we reduce the set of available moves for the player whose turn it is -- an element of the board can only be claimed if all the smaller elements in the poset are already claimed. We proceed to analyse these games in more detail, with a prime focus on the most studied convention, the Maker-Breaker games. First we build a general framework around poset positional games. Then, we perform a comprehensive study of the complexity of determining the game outcome, conditioned on the structure of the family of winning sets on the one side and the structure of the poset on the other.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (17)
  1. James D. Allen. Expert play in Connect-Four. 1990. https://tromp.github.io/c4.html.
  2. James D. Allen. The Complete Book of Connect 4: History, Strategy, Puzzles. Puzzlewright Press, 2010.
  3. Louis Victor Allis. A Knowledge-Based Approach of Connect-Four. Report IR-163. Vrije Universiteit Amsterdam, The Netherlands, 1988.
  4. Restricted positional games. 2021. Preprint, https://doi.org/10.48550/arXiv.2108.12839.
  5. József Beck. Combinatorial Games: Tic-Tac-Toe Theory. Encyclopedia of Mathematics and its Applications. Cambridge University Press, 2008.
  6. Jesper Makholm Byskov. Maker-Maker and Maker-Breaker games are PSPACE-complete. BRICS Report Series, 11(14), 2004.
  7. Noam D. Elkies. On numbers and endgames: combinatorial game theory in chess endgames. In Games of No Chance, Proceedings of 7/94 MSRI Conference on Combinatorial Games, pages 135–150. Cambridge University Press, 1996.
  8. On a combinatorial game. Journal of Combinatorial Theory, 14:298–301, 1973.
  9. Maker-Breaker is solved in polynomial time on hypergraphs of rank 3. Preprint, https://arxiv.org/abs/2209.12819, 2022.
  10. Regularity and positional games. Trans. Am. Math. Soc, 106:222–229, 1963.
  11. Positional Games, volume 44 of Oberwolfach Seminars. Birkhäuser (Springer), 2014.
  12. Richard M. Karp. Reducibility among combinatorial problems. In R.E. Miller, J.W. Thatcher, and J.D. Bohlinger, editors, Complexity of Computer Computations: Proceedings of a symposium on the Complexity of Computer Computations, March 20–22, 1972, chapter 9, pages 85–103. Springer US, Boston, MA, 2004.
  13. 6-uniform Maker-Breaker game is PSPACE-complete. In Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021), volume 187 of Leibniz International Proceedings in Informatics (LIPIcs), pages 57:1–15, 2021.
  14. Thomas J. Schaefer. On the complexity of some two-person perfect-information games. Journal of Computer and System Sciences, 16:185–225, 1978.
  15. Word problems requiring exponential time (preliminary report). In Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, pages 1–9, 1973.
  16. John Tromp. John’s Connect Four Playground. http://tromp.github.io/c4/c4.html.
  17. John Tromp. Solving Connect-4 on medium board sizes. ICGA Journal, 31(2):110–112, 2008.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (8)
  1. Guillaume Bagan (8 papers)
  2. Eric Duchêne (19 papers)
  3. Florian Galliot (7 papers)
  4. Valentin Gledel (17 papers)
  5. Mirjana Mikalački (13 papers)
  6. Nacim Oijid (14 papers)
  7. Aline Parreau (43 papers)
  8. Miloš Stojaković (23 papers)

Summary

We haven't generated a summary for this paper yet.