Timeline for Break The Chain
Current License: CC BY-SA 4.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 1, 2021 at 23:15 | vote | accept | dingledooper | ||
| May 7, 2020 at 19:11 | comment | added | Darrel Hoffman | I sense an OEIS entry in this - Calculate the minimum scores for any NxN grid size. Proving optimality would be pretty challenging at higher N's though. | |
| May 7, 2020 at 2:40 | comment | added | dingledooper | @SteveBennett Yes, that is certainly another way to put it :) | |
| May 7, 2020 at 2:15 | comment | added | Steve Bennett | Out of curiosity, as someone not well versed in graph theory, is this equivalent to saying "Divide a 25x25 grid by placing obstacles in cells. Your score is the size of the largest contiguous area free of obstacles, plus the number of obstacles you placed"? | |
| May 7, 2020 at 1:26 | answer | added | Dustin G. Mixon | timeline score: 9 | |
| May 6, 2020 at 14:34 | answer | added | isaacg | timeline score: 3 | |
| May 6, 2020 at 3:00 | history | tweeted | twitter.com/StackCodeGolf/status/1257867768470388736 | ||
| May 6, 2020 at 0:07 | history | became hot network question | |||
| May 5, 2020 at 20:25 | answer | added | Neil | timeline score: 6 | |
| May 5, 2020 at 16:52 | answer | added | Level River St | timeline score: 13 | |
| May 5, 2020 at 16:36 | answer | added | the default. | timeline score: 5 | |
| May 5, 2020 at 16:34 | answer | added | Surculose Sputum | timeline score: 4 | |
| May 5, 2020 at 16:23 | answer | added | math junkie | timeline score: 1 | |
| May 5, 2020 at 16:07 | history | asked | dingledooper | CC BY-SA 4.0 |