Timeline for Algorithm to distribute items "evenly"
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 27, 2015 at 14:25 | comment | added | Jim Mischel | @babou: My distance calculations do wrap around, as you can see in the results, but the algorithm itself doesn't make any specific allowances for the cyclical nature of the OP's problem. Nor do I see any way that I could adapt the algorithm to do so. Or, for that matter, how taking the cyclical nature into account would improve the results. Although it's interesting to consider doubling all of the counts (i.e. changing [3,2,1] to [6,4,2]), which would be effectively the same thing. My suspicion is that the algorithm would produce identical results. | |
| Mar 27, 2015 at 13:10 | comment | added | babou | Quite interesting, as I said previously. The simplicity of the idea is appealing. I did not have time to read it all carefully. Does your solution actually take into account the cyclicity of the original question? There may be a way to adapt it for the purpose, but I am not completely sure.whether it woks. | |
| Mar 27, 2015 at 4:40 | history | edited | Jim Mischel | CC BY-SA 3.0 |
Additional information
|
| Mar 27, 2015 at 4:35 | history | edited | Jim Mischel | CC BY-SA 3.0 |
Additional information
|
| Mar 26, 2015 at 22:08 | history | edited | Jim Mischel | CC BY-SA 3.0 |
corrected example data
|
| Mar 26, 2015 at 21:59 | history | answered | Jim Mischel | CC BY-SA 3.0 |