Partition games

DOI10.1016/J.DAM.2020.05.032MaRDI QIDQ2197465zbMATH OpenOpenAlexFDO

Authors Antoine Dailly, Urban Larsson, Gabrielle Paris, E. Duchêne

Publication date 31 August 2020

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1803.02621

zbMATH Keywords

combinatorial gamespartition gamestake-and-break games

Mathematics Subject Classification ID

2-person games (91A05) Combinatorial games (91A46)

Abstract: We introduce CUT, the class of 2-player partition games. These are NIM type games, played on a finite number of heaps of beans. The rules are given by a set of positive integers, which specifies the number of allowed splits a player can perform on a single heap. In normal play, the player with the last move wins, and the famous Sprague-Grundy theory provides a solution. We prove that several rulesets have a periodic or an arithmetic periodic Sprague-Grundy sequence (i.e. they can be partitioned into a finite number of arithmetic progressions of the same common difference). This is achieved directly for some infinite classes of games, and moreover we develop a computational testing condition, demonstrated to solve a variety of additional games. Similar results have previously appeared for various classes of games of take-and-break, for example octal and hexadecimal; see e.g. Winning Ways by Berlekamp, Conway and Guy (1982). In this context, our contribution consists of a systematic study of the subclass `break-without-take'.

Recommendations

• Games of fair division
• Games induced by the partitioning of a graph
• PARTITIONING GAMES WITH RESTRICTED COOPERATION
• Games with a changing coalitional partition
• The splitting game and applications
• scientific article; zbMATH DE number 1944042
• Three-part partition games on rectangles.
• Partitioning sequencing situations and games

Cites work

• Combinatorial game theory
• scientific article; zbMATH DE number 6490905 (Why is no real title available?)
• scientific article; zbMATH DE number 3124339 (Why is no real title available?)
• scientific article; zbMATH DE number 5145315 (Why is no real title available?)
• scientific article; zbMATH DE number 1896945 (Why is no real title available?)
• scientific article; zbMATH DE number 3020856 (Why is no real title available?)
• Invariant games
• Periodicity and arithmetic-periodicity in hexadecimal games
• Searching for periodicity in Officers
• Winning ways for your mathematical plays. Vol. 1.

Cited in

(15)

• Four-part partition games isomorphic to Silverman's game
• GAMM and the partition of Germany
• Games of fair division
• Some \(i\)-\textsc{Mark} games
• The arithmetic-periodicity of \textsc{cut} for \(\mathcal{C} = \{1, 2 c\}\)
• Searching for periodicity in Officers
• Partizan subtraction games
• Game values of arithmetic functions
• Partizan splittles
• The game of Cutblock
• scientific article; zbMATH DE number 1896945 (Why is no real title available?)
• Partizan subtraction games
• Some results on LCTR, an impartial game on partitions
• Sprague-Grundy values and complexity for LCTR
• The switch operators and push-the-button games: a sequential compound over rulesets

This page was built for publication: Partition games

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