Timeline for What is the proper name for this "tersest path" problem in Infinite Craft?
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 2 at 22:00 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Oct 7 at 3:07 | comment | added | Quuxplusone | Btw, I blogged this a few days later at quuxplusone.github.io/blog/2024/03/03/infinite-craft-theory . In April I found that (besides addition chains) stackoverflow.com/questions/78228861 is yet another example of this same kind of structure, even though I still lack a really canonical name for it. | |
| Aug 4 at 21:07 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Apr 6 at 21:06 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Mar 7 at 18:57 | comment | added | Dan Piponi | I think you can view these paths as proofs in linear logic (which is a good match for this kind of problem as it can model resources) so maybe check out the linear logic proof search literature. Eg. see discussion of vending machines here: citeseerx.ist.psu.edu/… | |
| Mar 7 at 18:16 | answer | added | Steven Stadnicki | timeline score: 0 | |
| Mar 5 at 13:36 | comment | added | pcpthm | That is shortest hyperpath problem (ref: Directed hypergraphs: Introduction and fundamental algorithms—A survey) but I couldn't find any articles from a practical standpoint. | |
| Mar 5 at 12:04 | answer | added | statusfailed | timeline score: 0 | |
| Mar 1 at 15:15 | comment | added | Quuxplusone | @CommandMaster: Ah, that's very interesting! IIUC, $V=\mathbb{Z}, E=+, V_0=\{0\}$ is a (unsurprisingly) well-studied and (very surprisingly to me) non-trivial example of the exact algebraic structure I'm talking about! I'm still in the dark as to the proper name for this kind of algebraic structure, though. | |
| Mar 1 at 3:23 | comment | added | Daniel Weber | Finding addition chains is a particular instance of this task which is quite hard, so it's likely there aren't any efficient algorithms. | |
| S Mar 1 at 1:26 | review | First questions | |||
| Mar 1 at 2:55 | |||||
| S Mar 1 at 1:26 | history | asked | Quuxplusone | CC BY-SA 4.0 |