Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games

by   Umair Z. Ahmed, et al.

Simple board games, like Tic-Tac-Toe and CONNECT-4, play an important role not only in the development of mathematical and logical skills, but also in the emotional and social development. In this paper, we address the problem of generating targeted starting positions for such games. This can facilitate new approaches for bringing novice players to mastery, and also leads to discovery of interesting game variants. We present an approach that generates starting states of varying hardness levels for player 1 in a two-player board game, given rules of the board game, the desired number of steps required for player 1 to win, and the expertise levels of the two players. Our approach leverages symbolic methods and iterative simulation to efficiently search the extremely large state space. We present experimental results that include discovery of states of varying hardness levels for several simple grid-based board games. The presence of such states for standard game variants like 4 × 4 Tic-Tac-Toe opens up new games to be played that have never been played as the default start state is heavily biased.


page 1

page 2

page 3

page 4


Concise QBF Encodings for Games on a Grid (extended version)

Encoding 2-player games in QBF correctly and efficiently is challenging ...

Calculating Ultra-Strong and Extended Solutions for Nine Men's Morris, Morabaraba, and Lasker

The strong solutions of Nine Men's Morris and its variant, Lasker Morris...

Learning Chess With Language Models and Transformers

Representing a board game and its positions by text-based notation enabl...

Implicit State and Goals in QBF Encodings for Positional Games (extended version)

We address two bottlenecks for concise QBF encodings of maker-breaker po...

Generalised agent for solving higher board states of tic tac toe using Reinforcement Learning

Tic Tac Toe is amongst the most well-known games. It has already been sh...

11 x 11 Domineering is Solved: The first player wins

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

An Upper Bound on the State-Space Complexity of Brandubh

Before chess came to Northern Europe there was Tafl, a family of asymmet...

Please sign up or login with your details

Forgot password? Click here to reset