In chess, what position has the highest number of checkmates in 1 move for a given side? You can have as many of each piece as you want, except for the king (you get exactly one). Bishops can be same color. Other color can have only the king, or other pieces if you want to. Rules same as chess rules. Pieces can be:
Queen
Rook
Bishop
Knight
Pawn
1 King (a must)
Answer
The highest number of one-move mates that I have found is currently 91. It is based off of the following idea:
RB.....K
........
......Q.
........
........
........
........
........
Here, each dot or letter represents a square on the board. There are 7 positions that the bishop can move to, so I would count this as 7 different moves that end in check mate, ie. 7 different 1 move mates. When counting the total number of moves that mate from each piece in the board, I will represent it like this:
07.....K
........
......0.
........
........
........
........
........
I found the following board based off of this idea that has a total of 91 different moves which result in checkmate:
B..RQ.BQ
Q....R..
..RB....
RB.K.B.Q
Q......Q
.R......
B..B..R.
Q..QQQQB
Where many pieces have several possible mates (a=10, b=11):
0..03.02
2....8..
..7b....
03.K.a.1
3......3
.a......
0..7..9.
2..13220
There might be a small permutation of this board which increases in incrementally, but I am interested in what other ideas people have from scratch.
No comments:
Post a Comment