Related papers: The q-Queens Problem: One-Move Riders on the Recta…
In his list of open problems, Martin Erickson described a certain game: "Two players alternately put queens on an n x n chess board so that each new queen is not in range of any queen already on the board (the color of the queens is…
We apply a one-dimensional discrete dynamical system originally considered by Arnol'd reminiscent of mathematical billiards to the study of two-move riders, a type of fairy chess piece. In this model, particles travel through a bounded…
The manuscript studies configurations of non-overlapping non-bonding dominoes on finite rectangular boards of unit squares characterized by row and column number. The non-bonding dominoes are defined here by the requirement that any domino…
We use Ratner's theorem to compute the asymptotics of the number of (cylinders of) periodic trajectories in a rectangle with a barrier, assuming that the location p/q of the barrier is rational. We also show that as q tends to infinity, the…
The N-Queens problem, placing all N queens in a N x N chessboard where none attack the other, is a classic problem for constraint satisfaction algorithms. While complete methods like backtracking guarantee a solution, their exponential time…
Following on the King Chicken Theorems originally proved by Maurer, we examine the idea of multiple flocks of chickens by bringing the chickens from tournaments to multipartite tournaments. As Kings have already been studied in multipartite…
In this paper we answer a question posed by R. Stanley in his collection of Bijection Proof Problems (Problem 240). We present a bijective proof for the enumeration of walks of length $k$ a chess rook can move along on an $m\times n$ board…
Mathematical billiards is much like the real game: a point mass, representing the ball, rolls in a straight line on a (perfectly friction-less) table, striking the sides according to the law of reflection. A billiard trajectory is then…
We give a proof of Willcocks's Conjecture, stating that if $p - q$ and $p + q$ are relatively prime, then there exists a Hamiltonian tour of a $(p, q)$-leaper on a square chessboard of side $2(p + q)$. The conjecture was formulated by T. H.…
A $(p, q)$-leaper is a fairy chess piece that, from a square $a$, can move to any of the squares $a + (\pm p, \pm q)$ or $a + (\pm q, \pm p)$. Let $L$ be a $(p, q)$-leaper with $p + q$ odd and $C$ a cycle of $L$ within a $(p + q) \times (p…
A chessboard has the property that every row and every column has as many white squares as black squares. In this mostly methodological note, we address the problem of counting such rectangular arrays with a fixed (numeric) number of rows,…
Quantum billiards have been simulated so far in many ways, but in this work a new aproximation is considerated. This study is based on the quantum billiard already obtained by others authors via a tensor product of two 1-D quantum walks .…
We study certain symplectic quotients of n-fold products of complex projective m-space by the unitary group acting diagonally. After studying nonemptiness and smoothness these quotients we construct the action-angle variables, defined on an…
In this paper, we show that the solution to a large class of "tiling" problems is given by a polynomial sequence of binomial type. More specifically, we show that the number of ways to place a fixed set of polyominos on an $n\times n$…
Define $QC(n)$ to be the number of quasiplatonic topological actions of the cyclic group $C_n$ on surfaces of genus at least two. We use formulas of Benim and Wootton to give an explicit formula for $QC(n)$. In addition, we relate the…
Let $p$ and $q$ be positive integers. The $(p, q)$-leaper $L$ is a generalised knight which leaps $p$ units away along one coordinate axis and $q$ units away along the other. Consider a free $L$, meaning that $p + q$ is odd and $p$ and $q$…
Infinite chess is chess played on an infinite edgeless chessboard. The familiar chess pieces move about according to their usual chess rules, and each player strives to place the opposing king into checkmate. The mate-in-n problem of…
For any two squares A and B of an m x n checkerboard, we determine whether it is possible to move a checker through a route that starts at A, ends at B, and visits each square of the board exactly once. Each step of the route moves to an…
This paper discusses the permutations that are generated by rotating $k \times k$ blocks of squares in a union of overlapping $k \times (k+1)$ rectangles. It is found that the single-rotation parity constraints effectively determine the…
Normally a chess problem must have a unique solution, and is deemed unsound even if there are alternatives that differ only in the order in which the same moves are played. In an enumerative chess problem, the set of moves in the solution…