Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

It should suffice to check out what happens (code-wise) if one of the "players" has only one square left. Does the "winning" player have a chance to hit that square and conquer it? Or does the program immediately register a collision for the "losing" player, who goes back to two squares?


That could show that it’s endless, but it wouldn’t necessarily show that an end is possible.


I don't believe an end is possible. As one player's territory sprinks, it should quite naturally follow that it will have less travel time, hence more collisions.


s/sprinks/shrinks




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: