Timeline for Chess pieces attacking exactly N chess pieces
Current License: CC BY-SA 4.0
21 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 21, 2020 at 15:28 | comment | added | Darrel Hoffman | @DmitryKamenetsky I posted a 3-color version. | |
| Mar 14, 2020 at 14:56 | history | edited | Darrel Hoffman | CC BY-SA 4.0 |
Added one more older puzzle to the list for Queens, N=0
|
| Mar 14, 2020 at 14:51 | vote | accept | Darrel Hoffman | ||
| Mar 13, 2020 at 4:18 | comment | added | Darrel Hoffman | @DmitryKamenetsky Well, for single color, I've got at N=0: 32 Pawns/Knights, 16 Kings, 14 Bishops, and 8 Rooks/Queens. N=1, 32 Knights, 26 Kings, 20 Bishops, 10 Rooks/Queens, N=2: 33 Kings, 24 Bishops, 16 Knights/Rooks, 9 Queens. N=3: 36 Kings, 16 Queens (actually don't have Knights yet). And that's as far as I got. Do those numbers look right? (I'll probably enter these on the weekend.) | |
| Mar 13, 2020 at 3:54 | comment | added | Dmitry Kamenetsky | @DarrelHoffman my program can't prove optimality, but Rob Pratt's program can. Good idea to put everything into one post. | |
| Mar 13, 2020 at 1:46 | comment | added | Darrel Hoffman | @DmitryKamenetsky Yeah, not sure how to close this one since there's different parts of the solutions in different answers. I thought maybe I'd re-purpose that CW post to be the master collection of all of them. I was putting together the single color solutions myself just now - I've got everything up to N=3, not sure if optimal yet though. If your program can prove optimality, you're welcome to finish it off... | |
| Mar 13, 2020 at 1:13 | comment | added | Dmitry Kamenetsky | Looks like we are pretty much done with this question. We can also look at single color or even multiple colors if people are interested. My program can handle multiple colors. | |
| Mar 12, 2020 at 20:37 | answer | added | Daniel Mathias | timeline score: 4 | |
| Mar 12, 2020 at 16:53 | answer | added | RobPratt | timeline score: 5 | |
| Mar 12, 2020 at 13:57 | answer | added | Darrel Hoffman | timeline score: 5 | |
| Mar 12, 2020 at 2:55 | comment | added | Darrel Hoffman | @DanielMathias You could make that an answer, maybe with a picture or ASCII art rather than just a link? | |
| Mar 11, 2020 at 17:52 | comment | added | Daniel Mathias | Bishops: N=1 N=2 | |
| Mar 11, 2020 at 15:55 | comment | added | Darrel Hoffman | @trolley813 That could be a new question. This would also allow 32+32 pawns with N=2. That or just cylindrical chess where it only wraps around on the sides would be a bit different - As you say, though, the solutions might be a bit trivial with wraparound. I considered asking about chess pieces on an infinite board (obviously just giving a pattern rather than a count since it'd be infinite), but that would be similarly trivial. | |
| Mar 11, 2020 at 13:57 | comment | added | trolley813 | By the way, on a toroidal chessboard (when 1st and 8th ranks are considered adjacent, as well as a- and h-files) it's pretty easy to fill whole board (32+32) with queens/kings for N=6 and bishops for N=4 (placing white on 1st, 3rd, 5th and 7th ranks, and black on 2nd, 4th, 6th and 8th), as well as knights for N=8 and rooks for N=4 (placing white pieces on white squares and black on black). | |
| Mar 11, 2020 at 13:35 | comment | added | Darrel Hoffman | @musefan There were some concerns voiced about there being too many puzzles of this type posted recently, so I figured we could close the loop and finish the rest of them here. This might be more of a Community Wiki type question ultimately, since I suspect different people may solve different parts of it... | |
| Mar 11, 2020 at 13:31 | comment | added | Darrel Hoffman | @daw Yeah, I figured out Rooks 2 in my head when I posted this. Rooks 1 was already solved in one of the previous questions. The rest are a little more complicated I suspect... | |
| Mar 11, 2020 at 13:29 | answer | added | Jaap Scherphuis | timeline score: 6 | |
| Mar 11, 2020 at 10:10 | comment | added | daw | Rooks: for N=1 and N=2 you can completely fill the board with a simple pattern. | |
| Mar 11, 2020 at 10:02 | comment | added | musefan | Isn't this what "tags" are for? (To group questions) | |
| Mar 11, 2020 at 4:00 | comment | added | Dmitry Kamenetsky | I tried knights with N=4 and only got 8 pieces of each color. Knights with N=2 is 22+ pieces each - I will search this one more carefully. | |
| Mar 11, 2020 at 2:01 | history | asked | Darrel Hoffman | CC BY-SA 4.0 |