Timeline for Algorithm that finds 4 "O"s or 4 "X"s on a diagonal, horizontal, or vertical
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 20, 2022 at 13:19 | answer | added | bbartling | timeline score: 0 | |
| Aug 11, 2022 at 3:31 | answer | added | Matt Groff | timeline score: 0 | |
| Aug 10, 2022 at 22:21 | answer | added | Matt Groff | timeline score: 1 | |
| Aug 10, 2022 at 18:32 | vote | accept | bbartling | ||
| Aug 10, 2022 at 17:37 | history | edited | John L. | CC BY-SA 4.0 |
More descriptive title.
|
| Aug 10, 2022 at 17:14 | comment | added | John L. | Flattening the nested tuples would probably make it harder to solve the problem. | |
| Aug 10, 2022 at 17:10 | answer | added | John L. | timeline score: 0 | |
| Aug 10, 2022 at 16:02 | comment | added | bbartling |
Any chance you could post an answer how to do this in tuples directly without having to modify values to ints? The data shown above xwins owins nowins is how the data is presented in the problem.....Should I flatten the nested tuples into one large tuple?
|
|
| Aug 10, 2022 at 15:57 | comment | added | John L. | Encode "X" as $1$, "0" as $0$, None as $-1$ if you have to use 2D number array in numpy. Why not compute directly on the input 2D tuples? You should clarify how the input is given to you. | |
| S Aug 10, 2022 at 15:31 | review | First questions | |||
| Aug 10, 2022 at 15:57 | |||||
| S Aug 10, 2022 at 15:31 | history | asked | bbartling | CC BY-SA 4.0 |