Timeline for Sandbox for Proposed Challenges
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 26, 2020 at 0:47 | comment | added | retzler | There might be some questions that can be answered for this special graph more efficient (in terms of code-size) than general graph-searching algorithms: Shortest path, longest path? - I assume there is be a function f on the graph such that f(v)<f(w) iff there's a path from v to w (but right now I don't know) - if that's interesting enough, implement that? | |
| May 26, 2020 at 0:26 | comment | added | retzler | I really like this graph's symmetries, so +1! "All such sequences"? For n=1,2,3,4 there are 0,1,2,82 such paths through the graph; I don't think enumerating all of them will be practical even for n=6. | |
| May 22, 2020 at 19:33 | history | answered | Neil | CC BY-SA 4.0 |