Quixo Is Solved

07/31/2020
by   Satoshi Tanaka, et al.
0

Quixo is a two-player game played on a 5×5 grid where the players try to align five identical symbols. Specifics of the game require the usage of novel techniques. Using a combination of value iteration and backward induction, we propose the first complete analysis of the game. We describe memory-efficient data structures and algorithmic optimizations that make the game solvable within reasonable time and space constraints. Our main conclusion is that Quixo is a Draw game. The paper also contains the analysis of smaller boards and presents some interesting states extracted from our computations.

READ FULL TEXT
research
01/04/2021

Transversal achievement game on a square grid

This paper intends to solve the Transversal achievement on an n times n ...
research
03/08/2019

Let's Play Mahjong!

Mahjong is a very popular tile-based game commonly played by four player...
research
10/12/2021

The Crew: The Quest for Planet Nine is NP-Complete

In this paper, we study the cooperative card game, The Crew: The Quest f...
research
02/21/2022

NP-Hardness of a 2D, a 2.5D, and a 3D Puzzle Game

In this paper, we give simple NP-hardness reductions for three popular v...
research
11/30/2017

Generalizing Gale's theorem on backward induction and domination of strategies

In 1953 Gale noticed that for every n-person game in extensive form with...
research
06/20/2020

A Stackelberg Security Investment Game for Voltage Stability of Power Systems

We formulate a Stackelberg game between an attacker and a defender of a ...
research
07/13/2023

An update on the coin-moving game on the square grid

This paper extends the work started in 2002 by Demaine, Demaine and Veri...

Please sign up or login with your details

Forgot password? Click here to reset