Skip to main content

Questions tagged [chess]

Mathematical questions in one way or another related to the game of chess.

-3 votes
1 answer
117 views

Count arrangements with pairs of attacking kings [closed]

I have a $1\times n$ chessboard and $2$ pairs of kings in it. Both components of each pair of kings must be adjacent in the chessboard, that is, they must be attacking. Now, I want to calculate the ...
Cardstdani's user avatar
9 votes
0 answers
305 views

The $n$ queens problem with no three on a line

The $n$ queens problem asks if we can place $n$ queens on an $n\times n$ chessboard such that no two queens attack one another. For example, when $n=8$, here are two solutions (images taken from ...
ho boon suan's user avatar
2 votes
2 answers
640 views

Exact calculation of n-queens solutions [closed]

I'm new to this forum, but I'm hoping this community can help me with some guidance on sharing and improving a mathematical solution that I've developed for the $n$-queens problem and $n$-queens ...
Dan S's user avatar
  • 21
2 votes
0 answers
209 views

Chess pieces metrics in higher dimensions

A couple of days ago, I was thinking about applying the knight (the well-known piece of chess) metric to any cubic lattice $\mathbb{N}^k$, $k \in \mathbb{N}-\{0,1\}$. I suddenly realized that, from $k ...
Marco Ripà's user avatar
  • 1,305
2 votes
3 answers
1k views

Strategy-stealing in chess

Is it proved that white can guarantee at least draw in chess? A while ago I was told that it was proved using strategy-stealing, but I cannot find a reference. Postscript. Please accept my apology ---...
Anton Petrunin's user avatar
0 votes
0 answers
142 views

Number of open tours by a biased rook on a specific $f(n)\times 1$ board which end on a $k$-th cell from the right

We have a simple structure - biased rook of the two types. Biased rook of the first kind which make open tours on a specific $f(n)\times 1$ board where $f(n) = \left\lfloor\log_2{2n}\right\rfloor + 1$ ...
Notamathematician's user avatar
5 votes
1 answer
1k views

How many consecutive forced moves are possible in chess?

The question concerns chess. I call a move forced if, in a given position, is the unique move consistent with the rules of the game. I wonder what is the largest integer $n$ such that there exists a ...
Alessandro Della Corte's user avatar
2 votes
1 answer
257 views

Limited rook moves

I have an algebra problem, that could be solved if I could answer the following combinatorial problem. Let $S$ and $T$ be two nonempty sets. We think of $S\times T$ as the index set for the squares ...
Pace Nielsen's user avatar
  • 18.3k
15 votes
0 answers
474 views

Does the Angel have to be really smart?

My question is about the computational complexity of the Angel's strategy in the Angels and Devils game, tl;dr does the Angel have a polynomial time strategy. I'm a big Conway fan, so as you can ...
Ville Salo's user avatar
  • 6,457
11 votes
2 answers
980 views

Algebraic properties of graph of chess pieces

For the purpose of this question, a chess piece is the King, Queen, Rook, Bishop or Knight of the game of chess. To a chess piece is attached a graph which represents the legal moves it can make on an ...
Olivier's user avatar
  • 10.6k
8 votes
1 answer
473 views

Knight's tour problem

It is known that on an infinite board, if all squares of the form $(ki,kj)$ are removed, $k$ even, $i,j\in\mathbf{Z}$, then there is no knight's tour due to unbalanced black and white squares. My ...
Haoran Chen's user avatar
1 vote
1 answer
246 views

Complexity class of chess when simulated by a Turing machine [closed]

Suppose we simulate the game of chess with a Turing machine $M$ as follows: The semi-infinite input tape of $M$ contains a sequence of symbols beginning in the first cell of the tape. Each symbol ...
user137861's user avatar
46 votes
3 answers
5k views

Does knight behave like a king in his infinite odyssey?

The Knight's Tour is a well-known mathematical chess problem. There is an extensive amount of research concerning this question in two/higher dimensional finite boards. Here, I would like to tackle ...
Morteza Azad's user avatar
1 vote
0 answers
191 views

Search strategy for Babson task in chess

I asked this on a computer chess forum (programmers hang out there, etc.) and got no substantive answers, which makes me think it's a research question. Whether it's sufficiently mathematical is ...
anonymous's user avatar
68 votes
6 answers
17k views

What is a chess piece mathematically?

Historically, the current "standard" set of chess pieces wasn't the only existing alternative or even the standard one. For instance, the famous Al-Suli's Diamond Problem (which remained ...
Morteza Azad's user avatar

15 30 50 per page