DeepAI AI Chat
Log In Sign Up

A Reverse Hex Solver

by   Kenny Young, et al.
University of Alberta

We present Solrex,an automated solver for the game of Reverse Hex.Reverse Hex, also known as Rex, or Misere Hex, is the variant of the game of Hex in which the player who joins her two sides loses the game. Solrex performs a mini-max search of the state space using Scalable Parallel Depth First Proof Number Search, enhanced by the pruning of inferior moves and the early detection of certain winning strategies. Solrex is implemented on the same code base as the Hex program Solver, and can solve arbitrary positions on board sizes up to 6x6, with the hardest position taking less than four hours on four threads.


At Most 43 Moves, At Least 29: Optimal Strategies and Bounds for Ultimate Tic-Tac-Toe

Ultimate Tic-Tac-Toe is a variant of the well known tic-tac-toe (noughts...

11 x 11 Domineering is Solved: The first player wins

We have developed a program called MUDoS (Maastricht University Domineer...

Towards solving the 7-in-a-row game

Our paper explores the game theoretic value of the 7-in-a-row game. We r...

A Combinatorial Game and an Efficiently Computable Shift Rule for the Prefer Max De Bruijn Sequence

We present a two-player combinatorial game over a k-ary shift-register a...

Perimeter-defense Game between Aerial Defender and Ground Intruder

We study a variant of pursuit-evasion game in the context of perimeter d...

Game Tree Search in a Robust Multistage Optimization Framework: Exploiting Pruning Mechanisms

We investigate pruning in search trees of so-called quantified integer l...

Mathematical modelling and numerical simulation of reverse-osmosis desalination

The reverse osmosis membrane module is an integral element of a desalina...