67
votes
Accepted
54
votes
How can 3 queens control the white squares?
I think this arrangement works for the bonus question:
48
votes
Accepted
36
votes
34
votes
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 ...
34
votes
Accepted
32
votes
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
30
votes
Accepted
Could you solve a chessboard math puzzle at gunpoint?
Suppose that we have a chessboard with the desired properties.
Find the greatest number in each row. Out of these numbers, let the smallest be $m_i$ in row $i$.
Find the smallest number in each row....
29
votes
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) ...
29
votes
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:
28
votes
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
27
votes
Accepted
26
votes
Accepted
25
votes
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 ...
25
votes
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 ...
25
votes
Accepted
24
votes
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
23
votes
Two Knights, two Bishops, two Rooks and two Kings on a 4x4 chessboard
Here is mine with passive kings, some minutes late :
23
votes
Four fanatics and one checkerboard
I'm not sure why you'd need ANY sort of dissection for this.
23
votes
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 ...
22
votes
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:...
22
votes
A Rook's Territory in the Chessboard
Here's an expandable solution for $n\ge 5$ (even or odd):
20
votes
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 ...
20
votes
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 ...
19
votes
Discrete Peaceful Encampments: 9 queens on a chessboard
Nine queens of each color. Some variation is possible.
18
votes
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.
18
votes
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 ...
18
votes
Accepted
17
votes
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:
17
votes
Accepted
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
checkerboard × 191mathematics × 76
chess × 72
optimization × 44
combinatorics × 40
strategy × 17
logical-deduction × 15
game × 14
knight-moves × 12
geometry × 11
tiling × 11
board-games × 9
algorithm × 8
dissection × 8
graph-theory × 7
no-computers × 6
cellular-automata × 6
construction × 5
reachability × 5
cipher × 4
visual × 4
puzzle-creation × 4
computer-puzzle × 3
probability × 3
polyomino × 3