arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.17302math.COcs.GT
收藏

So Long Sucker:终局分析

So Long Sucker: Endgame Analysis

School of Electrical Engineering and Computer Science, University of Ottawa(渥太华大学电气与计算机工程学院);Department of Mathematics and Statistics, University of Ottawa(渥太华大学数学与统计系)

Jean-Lou De Carufel, Marie Rose Jerade

AI总结:

本文通过精细的案例分析,刻画了So Long Sucker游戏终局中仅剩蓝红两名玩家时蓝方的获胜情形与策略。

摘要:

So Long Sucker 是一款策略棋盘游戏,需要4名玩家,每位玩家持有 $c$ 枚指定颜色的筹码,棋盘由 $k$ 个空堆组成。清晰的初始设置伴随着复杂的规则,例如:玩家轮流行动但顺序不固定,某些玩家之间达成的协议可随时被打破,或者玩家在手中无筹码的情况下赢得游戏。研究此游戏的主要兴趣点之一是确定玩家何时拥有获胜策略。游戏开始时四名玩家参与,他们被依次淘汰,直到仅剩获胜者。为了研究获胜策略,考察终局局面具有重要意义。为此,我们研究以下游戏设置:游戏中仅剩两名玩家,蓝方和红方,且只持有各自颜色的筹码。在本文中,我们通过精细的案例分析,刻画了在此游戏设置下蓝方的获胜情形及其策略。

英文摘要:

So Long Sucker is a strategy board game that requires 4 players, each with $c$ chips of their designated color, and a board made of $k$ empty piles. With a clear set-up comes intricate rules, such as: players taking turns but not in a fixed order, agreements made between some players broken at any time, or a player winning the game without any chips in hand. One of the main points of interest in studying this game is finding when a player has a winning strategy. The game begins with four players who get successively eliminated until only the winner is left. To study winning strategies, it is of interest to look at endgame situations. For that, we study the following game set-up: there are two players left in the game, Blue and Red, with only their respective chip colors. In this paper, we characterize Blue's winning scenarios and strategies for this game set-up through a delicate case analysis.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑