Transposition game

TL;DR

This paper introduces a two-player game involving sequence transpositions, analyzing strategies and outcomes based on parity control, with implications for understanding simple yet nontrivial combinatorial games.

Contribution

It presents a novel two-player game involving sequence transpositions and analyzes winning strategies based on parity control.

Findings

The game can be reduced to a simple, understandable form for children.

Winning strategies depend on controlling the parity of transpositions.

The game exhibits complex strategic behavior despite its simple rules.

Abstract

We introduce a two-player game, in which each player extends a given sequence by picking a free element in a domain D of the real line. The aim of the players is to control the parity of the number of transpositions necessary to put the final sequence in order. We will see that the winner can be the last player, the second last player, the first player, the second player, the person who wants the parity to end up even or the person who wants the parity to end up odd. A special case of the game can be reduced to a game with nontrivial winning strategy, but describable in so simple a way that children can understand it and enjoy playing it.