Added: 2 years ago
From: Spinja12
Views: 2,254
Sort by time | Sort by thread (beta)

Link to this comment:

Share to:

All Comments (12)

Sign In or Sign Up now to post a comment!
  • You can grab the audio-mp3 of this vid at getyourmp3s doht cohm.

  • The enemies should move faster.

  • very smart ;)

  • The main problem with the A* algo is that it always chooses the best path. If you make it so each enemy doesn't always choose the best path It'll go a long way to eliminate bunching

  • @SoltharRygelsun That's not an A* problem, that's a programmer problem. A* doesn't search for the "best" path or the shortest path. It searches for the least-cost path. It is the programmers job to make sure that path cost evaluation prioritizes desirable paths. If you use distance as cost, then you can't complain when A* finds shortest paths, cause that's exactly what you told it to do.

  • I am trying to make a rpg too. Yours looks better though. Lol

  • Yeah, bunching up seems to be a common problem for A*, from what I've seen. Great job so far. I'll probably have to subscribe.

  • It's great as long as you can loose that aggro

  • nice

  • Great work! I really like the way you're displaying the data for algorithms. That kind of display really helps in debugging and extending the game.

Loading...
Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more