簡易檢索 / 詳目顯示

回結果列表
研究生： 林敬翔
Lin, Ching-Hsiang
論文名稱： 兩個原創卵石遊戲的研究
A Study on Two Self-Invented Pebble Games
指導教授： 韓永楷
Hon, Wing-Kai
口試委員: 李哲榮
Lee, Che-Rung
蔡孟宗
Tsai, Meng-Tsung
學位類別： 碩士
Master
系所名稱： 電機資訊學院 - 資訊工程學系
Computer Science
論文出版年： 2020
畢業學年度： 108
語文別： 英文
論文頁數： 43
中文關鍵詞： 棋盤 、尼姆遊戲
外文關鍵詞： Kontsevich
相關次數： 點閱：27  下載：0 
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

    • 組合遊戲是一類沒有隨機因素及有勝負結果的遊戲，且其進行過程中所有玩家皆有公開完整的信息。
    根據玩家數量的不同，這類遊戲可以分為單人遊戲、兩人遊戲、或多人遊戲。
    在本論文中，我們研究了兩個自創的、在有向圖的棋盤上移動「卵石」的組合遊戲。

    對於第一個遊戲，它是從 Kontsevich (1981) 的卵石遊戲中推廣而來的單人遊戲，其中我們將遊戲擴展為
    在任何有向圖的棋盤上進行，而不只是在二維棋盤上進行。我們發現了一個有趣的對偶定理：
    若兩個遊戲所設定的初始盤面是「對偶的」，則此兩個遊戲同時可解或同時不可解。

    對於第二個遊戲，它是稱為「 Drop-or-Hop」的兩人游戲。此遊戲能歸類為「在一般勝利條件下的無偏博弈遊戲」（normal impartial game）。在本論文中，我們介紹如何計算此遊戲的任何盤面是否為必勝盤面。此外，我們亦討論如何計算任何盤面的「尼姆值」(nim value)，使得我們能夠知道多個獨立的 normal impartial game 一起玩時的必勝策略。此外，我們亦研究了此遊戲的幾種變形，例如可以在更一般化的棋盤上進行，或稍為改變規則而成的「Breed-or-Hop」遊戲。

    Combinatorial games are games with perfect information and no chance moves, and with a win-or-lose outcome.
    Depending on the number of players, these games can be classified into solitaire (single-player), two-player, or multiplayer games. In this thesis, we study two self-invented variants of the pebble game, where the latter is a type of combinatorial games that is played by moving ``pebbles'' along a directed graph.

    For the first game, it is a solitaire game generalized from the pebble game of Kontsevich (1981), where
    instead of playing the game on a two-dimensional chessboard, we extend the game to be played on any directed graph. We show an interesting duality theorem, such that if two initial configurations c and c' of the game are a ``dual", then the game with configuration c is solvable if and only if the game with configuration c' is solvable.

    For the second game, it is a novel two-player normal impartial game called ``Drop-or-Hop".
    We show how to determine if a certain configuration of the game is a winning position or not. Moreover, we show how to compute the ``nim value" of any configuration, which allows us to determine the winning position when the game is played in parallel with other normal impartial games. Furthermore, we study several variants of the game, say when it is played on more general kinds of chessboards, or when the rules are slightly changed so that the game becomes another game called ``Breed-or-Hop".

    1 Introduction 1 1.1 Our First Game: The Solitaire Pebble Game of Kontsevich . . . . . 2 1.2 Our Second Game: A Novel Two-Player Impartial Pebble Game . . 4 1.3 Thesis Organization . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2 The Solitaire Pebble Game 8 2.1 Duality Theorem in Z2 . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.2 Solitaire Pebble Game in Directed Graph . . . . . . . . . . . . . . . 9 2.3 Duality Theorem in DAG . . . . . . . . . . . . . . . . . . . . . . . 10 2.4 Duality Theorem in General Directed Graph . . . . . . . . . . . . . 15 2.5 Conversion Between Solutions . . . . . . . . . . . . . . . . . . . . . 17 3 The Two-Player Pebble Game 22 3.1 Nim Values of Normal Games . . . . . . . . . . . . . . . . . . . . . 22 3.2 The Drop-or-Hop Game . . . . . . . . . . . . . . . . . . . . . . . 23 3.2.1 When k = 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . 24 3.2.2 When k > 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . 26 3.2.3 Two-Dimensional Drop-or-Hop . . . . . . . . . . . . . . . 27 3.2.4 When the Chessboard is a Rooted Bipartite DAG . . . . . . 29 3.3 The Breed-or-Hop Game . . . . . . . . . . . . . . . . . . . . . . 32 3.3.1 When k = 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 3.3.2 When k = 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 4 Conclusion and Future Work 41

    [1] Robert A. Bosch. Integer Programming and Conway’s Game of Life. SIAM
    Review, 41(3):594–604, 1999.
    [2] Fan Chung, Ron Graham, John Morrison, and Andrew Odlyzko. Pebbling a
    Chessboard. The American Mathematical Monthly, 102(2):113–123, 1995.
    [3] Henrik Eriksson. Pebblings. The Electronic Journal of Combinatorics, 2(1):7,
    1995.
    [4] Thomas S. Ferguson. Game Theory, 2nd Edition, 2014.
    [5] M Kontsevich. Problem M715. Kvant, page 21, 1981.
    [6] Wikipedia. Chess, https://en.wikipedia.org/wiki/Chess
    [7] Wikipedia. Chinese Checkers, https://en.wikipedia.org/wiki/Chinese checkers
    [8] Wikipedia. Draughts, https://en.wikipedia.org/wiki/Draughts
    [9] Wikipedia. Go (game), https://en.wikipedia.org/wiki/Go (game)
    [10] Wikipedia. Nim, https://en.wikipedia.org/wiki/Nim
    [11] Wikipedia, Pebble Game, https://en.wikipedia.org/wiki/Pebble game
    [12] Wikipedia. Peg Solitaire, https://en.wikipedia.org/wiki/Peg solitaire
    [13] Wikipedia. Sokoban, https://en.wikipedia.org/wiki/Sokoban
    [14] Wikipedia. Sudoku, https://en.wikipedia.org/wiki/Sudoku

    QR CODE