Dynamic One-Pile Blocking Nim
-
Published:2003-05-20
Issue:1
Volume:10
Page:
-
ISSN:1077-8926
-
Container-title:The Electronic Journal of Combinatorics
-
language:
-
Short-container-title:Electron. J. Combin.
Author:
Flammenkamp Achim,Holshouser Arthur,Reiter Harold
Abstract
The purpose of this paper is to solve a class of combinatorial games consisting of one-pile counter pickup games for which the number of counters that can be removed on each successive turn changes during the play of the game. Both the minimum and the maximum number of counters that can be removed is dependent upon the move number. Also, on each move, the opposing player can block some of the moving player's options. This number of blocks also depends upon the move number.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Last Nim Game With Shifted Alliance System;Indian Journal of Pure and Applied Mathematics;2021-08-16
2. Multi-player End-Nim games;Theoretical Computer Science;2019-02
3. Multi-player Last Nim with Passes;International Journal of Game Theory;2017-12-18
4. Misère Nim with multi-player;Discrete Applied Mathematics;2017-03
5. One pile misère bounded Nim with two alliances;Discrete Applied Mathematics;2016-12