It is currently Sat Dec 07, 2013 9:38 pm Advanced search
ChrisH wrote:Based on your blog post this sounds like an enhanced version of breadth-first-search, would you agree?
Narsis wrote:You mention that the runtime is O(rows*cols). how is that faster then the time required for pathing algorithms?
erdman wrote:Interesting. Got link to games played by collaborative-diffusing anti-objecting antbot?
CrazyMLC wrote:Man, gotta love emergent solutions.
This means I can be my usual non-program savvy self and still make smart AI, as long as I model the problem right. The ants do all the work!
Only catch: How efficient is this, as far as turn time is concerned?
Users browsing this forum: No registered users and 1 guest