Final push! I'm going to declare next week the final full week of Open Problem #1, and post Open Problem #2 on December 11th.

Please compile any information at the wiki here. After December 11th I'm going to forward what we've found to the mathematician (Erich Friedman) who posed the problem in the first place.

To reiterate, here is our open question. **There is currently no known answer in the finite case.**

On a chessboard of any size, is there a configuration of kings and knights such that each king attacks exactly 2 kings and 2 knights, and each knight attacks exactly 2 kings and 2 knights? Also, what's the smallest board needed?

WIKI PAGE DEDICATED TO THE PROBLEM; WE CAN COLLECT OUR DATA HERE

Details: Kings can attack any adjacent square, including diagonally. Knights move in an L shape as shown below.

Recent highlights:

Stefan Van der Wall came up with a solution on a cube and Sizheng Chen posted a solution on a torus.

Ahmed Amrani wrote a computer program checking all cases from 5x5 to 17x17, with no solution.

Still possible routes of study:

A complete description of all possible king configurations on a finite board. The current data is on the wiki here.

Studying restrictions to configurations when they are on the side of the board or in the corner of the board.

Ahmed Amrani's program can be used to check cases larger than 17x17.

Thank you everyone for your efforts so far!

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestTo whom it may concern: when I was working on this challenge, I created some code in Python where you can put in a board with a few pieces, and it would automatically add as many pieces as possible to the board. I used it to double-check multiple pieces of the work done on this challenge, but I was never able to make any new discoveries. I forgot to post it, so better late than never I suppose. Maybe somebody else will find it useful. I hope it's commented well enough and prints enough to be understandable.

Link to the Python code

Log in to reply

@Jason Dyer What type of problems are allowed in the Open Problem #2?

Log in to reply

Go to the Thread for Suggesting Open Problems. It has guidelines and you can post your suggestions there.

Link to thread

Log in to reply