Solving 7 7 Hex: Virtual Connections and Game-state Reduction
نویسندگان
چکیده
We present an algorithm which determines the outcome of an arbitrary Hex game-state by finding a winning virtual connection for the winning player. Our algorithm performs a recursive descent search of the game-tree, combining fixed and dynamic game-state virtual connection composition rules with some new Hex game-state reduction results based on move domination. The algorithm is powerful enough to solve arbitrary 7 7 game-states; in particular, we use it to determine the outcome of a 7 7 Hex game after each of the 49 possible opening moves, in each case finding an explicit proof-tree for the winning player.
منابع مشابه
Solving 7x7 Hex: Virtual Connections and Game-State Reduction
We present an algorithm which determines the outcome of an arbitrary Hex game-state by finding a winning virtual connection for the winning player. Our algorithm performs a recursive descent search of the game-tree, combining fixed and dynamic game-state virtual connection composition rules with some new Hex game-state reduction results based on move domination. The algorithm is powerful enough...
متن کاملAn Extension of the H-Search Algorithm for Artificial Hex Players
Hex is a classic board game invented in the middle of the twentieth century by Piet Hein and rediscovered later by John Nash. The best Hex artificial players analyse the board positions by deducing complex virtual connections from elementary connections using the H-Search algorithm. In this paper, we extend the H-search with a new deduction rule. This new deduction rule is capable of discoverin...
متن کاملHexGraph: Applying Graph Drawing Algorithms to the Game of Hex
Hex is a classic board game for two players. There exists an intuitive mapping of the state of a hex game onto a graph. The motivation of the work presented in this paper was to create a new user interface paradigm for playing Hex, which is based on the graph representation of the state of the game, and which increases the player’s ability to find good moves/strategies. The paradigm uses graph ...
متن کاملMonte-Carlo Tree Search for Poly-Y
Monte-Carlo tree search (MCTS) is a heuristic search algorithm that has recently been very successful in the games of Go and Hex. In this paper, we describe an MCTS player for the game of Poly-Y, which is a connection game similar to Hex. Our player won the CodeCup 2014 AI programming competition. Our player uses MCTS with the all-moves-as-first heuristic, and detects basic heuristic patterns t...
متن کاملA Numerical Study on Using Air Cooler Heat Exchanger for Low Grade Energy Recovery from Exhaust Flue Gas in Natural Gas Pressure Reduction Stations
Heat EXchangers (HEX) that are used in City Gate Station (CGS) systems are modeled numerically to recover the exhaust waste heat. It was tried to find the best viscous model to obtain results in accordance with experimental results and to change the heat exchanger design. This HEX is used for recovering heat from exhaust flue gas with a mixture of 40% water and 60% ethylene glycol as the coolin...
متن کامل