Timeline for Beans under the chessboard
Current License: CC BY-SA 4.0
17 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 15, 2021 at 19:37 | comment | added | Jaap Scherphuis | @littlecat Yes, that is essentially the same problem, but posed as a lights-out game like I alluded at the start of my answer. | |
| May 15, 2021 at 17:28 | comment | added | littlecat | I think this problem is actually quite similar to artofproblemsolving.com/community/c6h55342p343869: both can be solved by looking at dominoes at the edge of the board. | |
| May 1, 2021 at 7:32 | comment | added | Jaap Scherphuis | @FlorianF Yes, you are right. I've deleted it now, as it is not as interesting as I thought. | |
| May 1, 2021 at 7:20 | history | edited | Jaap Scherphuis | CC BY-SA 4.0 |
deleted 455 characters in body
|
| Apr 30, 2021 at 22:48 | comment | added | Florian F | Not sure about the 7x7 board. The standard solution would be to query the odd rows and the even columns, totalling 7 queries. If you query rows+columns 1,3,5,7, you get the parity of the white cells. | |
| Apr 30, 2021 at 10:20 | vote | accept | WhatsUp | ||
| Apr 30, 2021 at 10:20 | comment | added | WhatsUp | Now it's a perfect answer (: Good job both Jaap and @loopywalt! | |
| Apr 30, 2021 at 7:25 | history | edited | Jaap Scherphuis | CC BY-SA 4.0 |
added 144 characters in body
|
| Apr 30, 2021 at 6:53 | comment | added | Jaap Scherphuis | @loopywalt Thank you, that does the trick! I'll update my proof. | |
| Apr 30, 2021 at 4:42 | comment | added | justhalf | "proofify", I like that word. | |
| Apr 30, 2021 at 0:49 | comment | added | loopy walt | I think you can proofify your argument by instead of regarding seams between entire ranks/files using only those between squares on the outermost ring. That way you get two groups of 14 requirements, only rectangles spanning the entire length or width can satisfy the maximum 4 of them and contributing to both groups at the same time can only be done in increments of one each. | |
| Apr 29, 2021 at 18:09 | history | edited | Jaap Scherphuis | CC BY-SA 4.0 |
added 275 characters in body
|
| Apr 29, 2021 at 16:31 | history | edited | Jaap Scherphuis | CC BY-SA 4.0 |
added 1490 characters in body
|
| Apr 29, 2021 at 16:23 | history | edited | Jaap Scherphuis | CC BY-SA 4.0 |
added 1490 characters in body
|
| Apr 29, 2021 at 16:16 | history | edited | Jaap Scherphuis | CC BY-SA 4.0 |
added 1490 characters in body
|
| Apr 29, 2021 at 15:27 | comment | added | WhatsUp | Hi Jaap, thanks for answering! Although I didn't state explicitly, it would be preferable if you can also prove that your result is minimal (: | |
| Apr 29, 2021 at 15:19 | history | answered | Jaap Scherphuis | CC BY-SA 4.0 |