Mathematics Stack Exchange
Mathematics Stack Exchange

Questions tagged [chessboard]

Use this tag for questions about the board on which the game of chess is played.

A chessboard is the board on which the game of chess is played.

The board has a square shape with its side being divided into eight parts resulting in a total of sixty-four subdivisions whose colors alternate between two colors. Each subdivision of the board is called a square and receives a unique identification to be used in chess notation, which may be descriptive, algebraic, or numeric. Each horizontal array of squares is called a rank, each vertical array of squares is called a file, and each line of squares of the same color touching corner to corner is called a diagonal.

336 questions
13
votes
4 answers

Chess rook tour of 64 moves

Consider an $8\times8$ chessboard. Let the rook be placed on the square a1. Is it possible for the rook to make a tour of $64$ moves such that: the rook visits every square once, the rook visits every square, the rook begins and ends on the square…
user263286
4
votes
2 answers

A book claims there are $10^{120}$ board positions on a chess board. How would one prove this?

I have recently bought an exercise copy and there, in the cover page I got an amazing fact about chess board, "There are total $10^{120}$ board positions in a chess board." But I was just thinking how to prove this. My work: I think to first find…
AK001
  • 113
2
votes
0 answers

single king on a chessboard game

Consider the following two players game: Giving chessboard NxN, and single king placed on some square on the board. Each player in his turn, can move the king in each direction in the same way player can move king in regular chessboard game. But -…
pelegbarsever
  • 163
2
votes
1 answer

Chess parity problem

On an 8x8 chess board we place rooks so that the number of them is odd on each line or collumn. Show that the number of black squares that have rooks is even. What I found: Obviously, since the sum of all rooks is even, the numbers of black and…
Mario 04
  • 389
1
vote
1 answer

Can two "magical" chess knights meet?

I have a chess board N*M. Two "magical" knights are standing in random positions (x1,y1) and (x2,y2). They are magical, because they make moves simultaneously. The question is: "how many moves are required for them to meet (minimal amount)?" As…
Hmmman
  • 37
1
vote
2 answers

Is it possible to cover with dominos a chess-board with opposite corners removed?

This question was in my course book but without an answer. From a chessboard, two boxes each located on an opposite corner, get cut away. So for example the most top-left and bottom-right box get cut away. Is it possible to cover the whole…
O'Niel
  • 239
1
vote
1 answer

Chess Problem on Rook Placement

How many ways are there to put two black rooks on a 8x8 chessboard so that they don't attack each other? There are several ways that these two could be placed, and I am wondering how many amount of positions there are. Thank you for any…
Jmaxmanblue
  • 479
1
vote
1 answer

How many rooks are needed to capture $n$ knights on an infinite chessboard?

First question - suppose we have a knight at the origin, and $k$ rooks positioned far away. How many rooks are needed to guarantee capture the knight on an infinite board? It should be straightforward to show that four rooks suffice, but can it be…
Per Alexandersson
  • 3,626
0
votes
0 answers

Depth to Mate in a random $N$-piece chess position

What is the formula or piecewise function that gives how many moves [or half moves (plies)] are the DTMs if there are multiple checkmate variations (Depth to Mate ignoring 50-move rule) for a random $N$-piece chess position if any checkmate…
nirates biadenroc
  • 29
  • 4
0
votes
1 answer

Storing the board state of Hexagonal chess in a multi-dimensional array

Chess is normally played on a square board. This means, the board state can be easily represented in a square 8x8 2-dimensional array. On the other hand, Gliński's hexagonal chess is played on a hexagonal board. I want to store this position in a…
Richie Bendall
  • 163
0
votes
0 answers

number of paths passing by each tile of a chessboard by adjacent tiles

I have a $N\times N$ chessboard, and I need to compute all the paths from a corner to the opposite, walking once on each tile, and only walking from a tile to one of the nearest tiles (i.e., no jumps, no diagonal moving). I was thinking to solve it…
marco
  • 365
  • 1
  • 6
0
votes
1 answer

Chess Problem: What is the minimum number of white pieces required such that the black king is in check, no matter it's position?

I can think of a solution with 7 pieces required. 7 Queens on a diagonal with one missing in the corner. Is there a solution which requires less pieces than this? If so, does it generalise to an nxn board?
Joshua Farrell
  • 1,526
0
votes
1 answer

What is the most accurate estimate of total possible number of chess games

What is the most accurate estimate for the total possible number of chess games. I already know about Shannon's number, I'm just wondering if there's anything higher than that.
John Smith
  • 187
  • 2
  • 3
  • 13
0
votes
1 answer

Painting a Board

We have a board like this: (16 column, 10 row) We are gonna paint n number of box for each column. And there is one rule: There shouldn't be a 2x2 white square. What is the maximum value of n for this? I painted like this: I thought it's not 10…
Mameine
  • 3
-1
votes
0 answers

How do I solve this chessboard problem?

We are given a chessboard of size 'N' X 'N' . But it can contain any numbers of white-squares and black-squares , that too in any-order . Say there are 'a'-squares of white color and 'b'-squares of black-color , then , [ a+b=n*n ] We have to keep…
Firex Firexo
  • 295
1
2