Timeline for Generate all \$3\times 3\$ magic squares
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Sep 1, 2021 at 15:52 | review | First answers | |||
| Sep 1, 2021 at 16:18 | |||||
| S Sep 1, 2021 at 15:52 | history | edited | ophact | CC BY-SA 4.0 |
deleted 283 characters in body
|
| Sep 1, 2021 at 15:52 | comment | added | ophact | @rajb245 Thanks for the information! Let me update my answer. | |
| Sep 1, 2021 at 15:51 | comment | added | rajb245 | I posted a clarification that the challenge is indeed only for the n=3 case. I think with this constraint, very lean code can be written, and that's what I'm looking for! I expect a few dozen bytes should do it in some language. | |
| Sep 1, 2021 at 15:46 | comment | added | ophact | @BrowncatPrograms I'm not really new to Code Golf as a matter of fact ;) I used to be RecursiveCo but I wanted to restart for some reason so I signed up again. | |
| Sep 1, 2021 at 15:44 | comment | added | rydwolf | Welcome to Code Golf! Great answer. | |
| S Sep 1, 2021 at 15:38 | review | First answers | |||
| Sep 1, 2021 at 15:44 | |||||
| S Sep 1, 2021 at 15:38 | history | answered | ophact | CC BY-SA 4.0 |