A winning strategy for 3×n Cylindrical Hex
نویسندگان
چکیده
For Cylindrical Hex on a board with circumference 3, we give a winning strategy for the end-to-end player. This is the first known winning strategy for odd circumference at least 3, answering a question of David Gale.
منابع مشابه
On Optimal Play in the Game of Hex
Hex is a two person game played on an n×n board in which the players take turns trying to construct paths from one side of the board to the other. It is known that there exists a winning strategy for the first player, but no one has yet been able to find such a strategy for any board larger than 9×9. Despite this, we ask the following two questions: “what is the shortest path with which player ...
متن کاملHow to play Reverse Hex
We present new results on how to play Reverse Hex, also known as Rex, or Misère Hex, on n×n boards. We give new proofs — and strengthened versions — of Lagarias and Sleator’s theorem (for n×n boards, each player can prolong the game until the board is full, so the first/second player can always win if n is even/odd) and Evans’s theorem (for even n, opening in the acute corner wins). Also, for e...
متن کاملRandom-Turn Hex and Other Selection Games
Overview. The game of Hex , invented independently by Piet Hein in 1942 and John Nash in 1948 [9], has two players who take turns placing stones of their respective colors on the hexagons of a rhombus-shaped hexagonal grid (see Figure 1). A player wins by completing a path connecting the two opposite sides of his or her color. Although it is easy to show that player I has a winning strategy, it...
متن کاملA New Solution for 7x7 Hex Game
Abstract. In this paper, we applied the decomposition method to obtain a new winning strategy for 7x7 Hex game. We also find that some positions on the 7x7 Hex board, which are called “trivial positions”, were never occupied by Black among all of strategies in the new solution. In other words, Black can still win the game by using the strategies described in this paper even if White already has...
متن کاملA Third-Order Bounded Arithmetic Theory for PSPACE
We present a novel third-order theory W 1 1 of bounded arithmetic suitable for reasoning about PSPACE functions. This theory has the advantages of avoiding the smash function symbol and is otherwise much simpler than previous PSPACE theories. As an example we outline a proof in W 1 1 that from any configuration in the game of Hex, at least one player has a winning strategy. We then exhibit a tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 331 شماره
صفحات -
تاریخ انتشار 2014