I’ll take a look, but honestly I’m not a math heavy person, is there a definitive answer ? Like others, I’m here because of the Numberphile episode. I was hoping to code a nice game around this concept and was wondering if I can compute a score.

Thanks

]]>(You might also enjoy taking a look at my expository paper https://people.math.gatech.edu/~mbaker/pdf/g4g9.pdf) ]]>

After playing around with the game, I saw that you can always win with just the “give” move. Does my theory hold on ? You mention, that “it can always be won using only borrowing moves”, but what about the “give” move ?

Another question, is there a way, from any graph to compute the least amount of moves required to win ?

Thanks

]]>duke.a-comics.ru/dollar/ ]]>