2016/05/20 by Mara Bovee, Bovee, Mara, Kyle Burke +3
Computer Science · Social Sciences · #91A46 #Artificial Intelligence in Games #Data Structures and Algorithms (cs.DS) #Digital Games and Media #E.1 #F.1.3 #F.2.2 #FOS: Computer and information sciences #Logic, programming, and type systems
paper · pdf · doi:10.48550/arxiv.1605.06327
openalex publication_date 2016/05/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we consider combinatorial game rulesets based on data structures normally covered in an undergraduate Computer Science Data Structures course: arrays, stacks, queues, priority queues, sets, linked lists, and binary trees. We describe many rulesets as well as computational and mathematical properties about them. Two of the rulesets, Tower Nim and Myopic Col, are new. We show polynomial-time solutions to Tower Nim and to Myopic Col on paths.