Timeline for Is anything written about winning the "Dollar Game" in the minimal number of moves?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 22, 2021 at 9:13 | comment | added | Paul Johnson | The quickly produced upper bounds will be a good thing to have in mind. But the uniquness limits thing in another way -- the difficulty of figuring out the optimal number of moves is that in general there will be many winning states, and it's figuring out which of these is the "closest" to the starting state that's the hard part. | |
| Jun 22, 2021 at 9:10 | comment | added | Paul Johnson | No worries -- this duality wasn't something I was aware of and you explained it usefully! We mostly used Corry and Perkinson's text people.reed.edu/~davidp/divisors_and_sandpiles so new about the borrowing algorithm; interesting that the duality means the uniqueness of the winning state produced by algorithm is "the same" as the uniqueness of stable state produced by toppling. | |
| Jun 21, 2021 at 19:23 | comment | added | Sam Hopkins | I now see that some of this is repeating stuff explained in the article of Baker you linked to. Still, as I mentioned it is a starting point... | |
| Jun 21, 2021 at 15:56 | history | answered | Sam Hopkins | CC BY-SA 4.0 |