Re:Tough times on the road to Starcraft
by Daniel_Newby on Saturday September 08, 2012 @08:58AM
(#4492865)
What am I missing about path finding? A simple filter on the nearest neighbors can weed out paths that are too narrow, then Dijkstra's algorithm can find the path. After you find a path the first time, it can seed subsequent rounds for efficiency. So what am I not seeing?
[ Parent
| on HN ]
Re:Tough times on the road to Starcraft
by NickPollard on Saturday September 08, 2012 @09:21AM
(#4492894)
The biggest problem in games is the number of units - you might send 12 units through a narrow pass, and the game needs to have the units go through smoothly without blocking each other too much. From what I remember, the shipped version of Starcraft still had problems where you'd send a group somewhere, they'd get a little bit stuck going through, and one or two units at the back would then re-path to a really convoluted round-trip rather than just waiting half a second then continuing their original path.
Re:Tough times on the road to Starcraft
by kzrdude on Saturday September 08, 2012 @09:59AM
(#4492940)
The bigger units like dragoons and goliaths were notorious for stupid behavior in groups.. so it was never really resolved, and became a feature that progamers had to deal with.
Re:Tough times on the road to Starcraft
by Daniel_Newby on Saturday September 08, 2012 @09:38AM
(#4492915)
Ah. Thanks.