Timeline for Will a greedy algorithm solve Tatham's Flood?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 3, 2020 at 23:11 | comment | added | Glen O | @Shufflepants - at no point did I say that my algorithm is optimal, just that it is likely to be more efficient than the one proposed in the question in many situations. I decided against explicitly discussing the logical extension of the algorithm to $n$-step, which will always find the optimal solution so long as $n$ is greater than or equal to the length of the optimal solution, and is likely to find the optimal solution as long as $n$ is sufficiently large. | |
| Aug 13, 2019 at 19:16 | comment | added | Shufflepants | Mike's comment on the question would seem disprove this conjecture. | |
| Jan 14, 2017 at 14:29 | vote | accept | Rand al'Thor | ||
| Dec 13, 2016 at 7:29 | history | answered | Glen O | CC BY-SA 3.0 |