DeepAI AI Chat
Log In Sign Up

Quixo Is Solved

by   Satoshi Tanaka, et al.

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.


Transversal achievement game on a square grid

This paper intends to solve the Transversal achievement on an n times n ...

Let's Play Mahjong!

Mahjong is a very popular tile-based game commonly played by four player...

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

In this paper, we study the cooperative card game, The Crew: The Quest f...

Trust-ya: design of a multiplayer game for the study of small group processes

This paper presents the design of a cooperative multi-player betting gam...

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...

Computing Shapley Values for Mean Width in 3-D

The Shapley value is a common tool in game theory to evaluate the import...

Time-Space Tradeoffs for the Memory Game

A single-player Memory Game is played with n distinct pairs of cards, wi...