# Tag Info

Accepted

### Cover 63 squares of a chess board

These should do it: Just to show another example:
• 5,190

### How can 3 queens control the white squares?

I think this arrangement works for the bonus question:
• 1,723
Accepted

### How can 3 queens control the white squares?

I think this will do it
• 138k

### Chessboard Rook Problem

There are more ones. Proof:
• 849

### Two Knights, two Bishops, two Rooks and two Kings on a 4x4 chessboard

I'm not trying to solve the puzzle, I'm just interested in how many solutions there are, since the OP claims he doesn't know. I brute forced it with a program. There are First of all, there are ...
• 1,935
Accepted

### A chess board with numbers

The smallest sum that can be achieved is Because Reasoning
• 138k
Accepted

### 16 pawns on a chess board with no three collinear: how do I go about solving this?

The Algoritm is : Then Here is the complete solution from Achim Flammenkamp Ph.D. There are totally 57 solutions
• 17.9k
Accepted

### The shortest way from A1 to B1

The shortest way from A1 to B1 is:
• 54.6k
Accepted

### Chessboard Rook Problem

There are Proof: Now I bet the ratio of good to bad is I wrote a little Python program (possibly buggy, so apply some skepticism, but I've tested the bit most likely to have bugs and it seems OK) ...
• 120k

### Chess solitaire: The King's longest walk

First solution - 50 moves Second solution - 59 moves Current solution - 66 moves (beaten by Retudin - 70 moves and Rewan Demontay - 139 moves) Moves:
• 18.1k
Accepted

### Two Knights, two Bishops, two Rooks and two Kings on a 4x4 chessboard

I hope I didn't make any mistakes: Edit : Replace queens by king
• 534
Accepted

### Playing with one Queen on a chessboard

We can work backwards to figure this out: Conclusion:
• 148k
Accepted

### Chess with jumping

The result is a The idea is to Here's the line:
• 27.4k
Accepted

### The Popular Letter Chessboard

The rules of the question state that: On your final grid, a letter (actually several is also mathematically possible) will be more frequent than all the other letters. Your aim is that this letter ...
• 147k

### The Knight's Romp

I have a computer program for solving packing problems, and found a way to use it to solve this problem. One of the solutions it found is below: Note that this is very close to the attempted solution ...
• 54.6k
Accepted

• 1,896
Accepted

### How can the knight traverse a chessboard to make a path that sums to 100

The path is as follows: I found this path after
• 11.7k

### Two Knights, two Bishops, two Rooks and two Kings on a 4x4 chessboard

Here is mine with passive kings, some minutes late :
• 3,040

### Four fanatics and one checkerboard

I'm not sure why you'd need ANY sort of dissection for this.
• 2,767
Accepted

### A Rook's Territory in the Chessboard

I started with this: Pushed things this way and that, ended up with this: Similarly, on 9x9: And on 10x10: It took me a while to get there, but that one suggests an emerging pattern. And here is ...
• 16.1k
Accepted

### Paint 21 Squares of a 7×7 Board Without Forming a Rectangle

Here's the solution: There's a very neat method for finding this, inspired by the no-computers way of solving another related puzzle. Namely, More specifically, given the constraints of this problem:...
• 117k

### A Rook's Territory in the Chessboard

Here's an expandable solution for $n\ge 5$ (even or odd):
• 14.4k
Accepted

### Checkmate N Kings with M Knights

50 Kings,14 Knights: This is optimal but not unique, see bottom of this answer. Reasoning: I think the problem is equivalent to covering every square on the board with as few knights as possible and ...
• 21.3k
Accepted

### Coloring of a 5 x 5 chessboard

Borrowing ideas from both @Gareth and @xnor: WLOG one column has at least 3 black squares. Discard the 2 other rows. If any of the 4 other columns has more than 1 black square we are done. We are left ...
• 21.3k

### Discrete Peaceful Encampments: 9 queens on a chessboard

Nine queens of each color. Some variation is possible.
• 16.1k

### How many queens can be on a chessboard without attacking each other?

Sorry for reviving a 5 years old question, but I can fit: I hope to avoid downvotes by pointing out that this troll solution satisfies all the conditions of the original question.
• 549
Accepted

### Beans under the chessboard

This puzzle could have almost have been given the tag, though that may have given a big hint. You can think of each rectangle you pick as a move, Here is a proof for why this is the minimal number ...
• 54.6k
Accepted

This is Proof:
• 54.6k

### Two Knights, two Bishops, two Rooks and two Kings on a 4x4 chessboard

Here's a solution with the additional constraint that no piece may attack more than one piece:
• 745