1) If you see player, run towards him

2) If you can’t see the player, run towards his last known location

This works kinda good in a blocky 2d top down world – to my surprise! And I though I was gonna have to do Dijkstra, no way.

This entry was posted on Saturday, December 17th, 2011 at 7:19 am and is filed under LD #22. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.