A while back I wrote about the Graph Paper Race game, and it continues to be one of my most popular posts. Now computational geometer/topologist Jeff Erickson has written a blog post "How hard is optimal racing?", which give a good description of the problem with a solid mathematical perspective (and far better than my own).
And he linked to me too - Thanks Jeff!
I think the lesson from this is that problems that arise in games are non-trivial and can entertain the brightest minds. That's why we like to play.
No comments:
Post a Comment